File tree 2 files changed +2
-2
lines changed
2 files changed +2
-2
lines changed Original file line number Diff line number Diff line change @@ -412,7 +412,7 @@ the cost of walking down the tree in such common cases.
412
412
413
413
The optimization works on the assumption that there can only be one
414
414
non-ignorable leaf rightmost page, and so not even a visible-to-everyone
415
- style interlock required. We cannot fail to detect that our hint was
415
+ style interlock is required. We cannot fail to detect that our hint was
416
416
invalidated, because there can only be one such page in the B-Tree at
417
417
any time. It's possible that the page will be deleted and recycled
418
418
without a backend's cached page also being detected as invalidated, but
Original file line number Diff line number Diff line change @@ -318,7 +318,7 @@ XID less than this could be about to appear in the ProcArray, because of the
318
318
XidGenLock interlock discussed above.)
319
319
320
320
As GetSnapshotData is performance critical, it does not perform an accurate
321
- oldest-xmin calculation (it used to, until v13 ). The contents of a snapshot
321
+ oldest-xmin calculation (it used to, until v14 ). The contents of a snapshot
322
322
only depend on the xids of other backends, not their xmin. As backend's xmin
323
323
changes much more often than its xid, having GetSnapshotData look at xmins
324
324
can lead to a lot of unnecessary cacheline ping-pong. Instead
You can’t perform that action at this time.
0 commit comments