jdk-sandbox: comparison hotspot/src/share/vm/runtime/objectMonitor.cpp

equal deleted inserted replaced

-:820966182ab9
+:9bf46d16dcc6
 //   More precisely, the CAS-based "push" onto cxq is ABA-oblivious.
 //
 // * Taken together, the cxq and the EntryList constitute or form a
 //   single logical queue of threads stalled trying to acquire the lock.
 //   We use two distinct lists to improve the odds of a constant-time
-//   dequeue operation after acquisition (in the ::enter() epilog) and
+//   dequeue operation after acquisition (in the ::enter() epilogue) and
 //   to reduce heat on the list ends.  (c.f. Michael Scott's "2Q" algorithm).
 //   A key desideratum is to minimize queue & monitor metadata manipulation
 //   that occurs while holding the monitor lock -- that is, we want to
 //   minimize monitor lock holds times.  Note that even a small amount of
 //   fixed spinning will greatly reduce the # of enqueue-dequeue operations
 // by LDing cxq|EntryList.  Newly arrived threads -- that is, threads
 // that arrive on cxq after the ST:MEMBAR, above -- will set Responsible
 // non-null and elect a new "Responsible" timer thread.
 //
 // This thread executes:
-//    ST Responsible=null; MEMBAR    (in enter epilog - here)
+//    ST Responsible=null; MEMBAR    (in enter epilogue - here)
 //    LD cxq|EntryList               (in subsequent exit)
 //
 // Entering threads in the slow/contended path execute:
 //    ST cxq=nonnull; MEMBAR; LD Responsible (in enter prolog)
 //    The (ST cxq; MEMBAR) is accomplished with CAS().
 if (MaxSpin >= 0) {
 if (_Spinner > MaxSpin) {
 TEVENT (Spin abort -- too many spinners) ;
 return 0 ;
 }
-// Slighty racy, but benign ...
+// Slightly racy, but benign ...
 Adjust (&_Spinner, 1) ;
 }
 // We're good to spin ... spin ingress.
 // CONSIDER: use Prefetch::write() to avoid RTS->RTO upgrades

changeset 22551	9bf46d16dcc6
parent 18025	b7bcf7497f93
child 22753	749328896281