Skip to content
GitLab
Explore
Sign in
Register
Primary navigation
Search or go to…
Project
P
postgres-lambda-diff
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Container registry
Model registry
Operate
Environments
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Jakob Huber
postgres-lambda-diff
Commits
876f78d5
Commit
876f78d5
authored
11 years ago
by
Robert Haas
Browse files
Options
Downloads
Patches
Plain Diff
Fix capitalization in README.
Vik Fearing
parent
e7f40975
Branches
Branches containing commit
Tags
Tags containing commit
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
src/backend/storage/buffer/README
+7
-7
7 additions, 7 deletions
src/backend/storage/buffer/README
with
7 additions
and
7 deletions
src/backend/storage/buffer/README
+
7
−
7
View file @
876f78d5
...
...
@@ -176,8 +176,8 @@ small limit value) whenever the buffer is pinned. (This requires only the
buffer header spinlock, which would have to be taken anyway to increment the
buffer reference count, so it's nearly free.)
The "clock hand" is a buffer index,
N
extVictimBuffer, that moves circularly
through all the available buffers.
N
extVictimBuffer is protected by the
The "clock hand" is a buffer index,
n
extVictimBuffer, that moves circularly
through all the available buffers.
n
extVictimBuffer is protected by the
BufFreelistLock.
The algorithm for a process that needs to obtain a victim buffer is:
...
...
@@ -189,8 +189,8 @@ is pinned or has a nonzero usage count, it cannot be used; ignore it and
return to the start of step 2. Otherwise, pin the buffer, release
BufFreelistLock, and return the buffer.
3. Otherwise, select the buffer pointed to by
N
extVictimBuffer, and
circularly advance
N
extVictimBuffer for next time.
3. Otherwise, select the buffer pointed to by
n
extVictimBuffer, and
circularly advance
n
extVictimBuffer for next time.
4. If the selected buffer is pinned or has a nonzero usage count, it cannot
be used. Decrement its usage count (if nonzero) and return to step 3 to
...
...
@@ -254,11 +254,11 @@ Background Writer's Processing
The background writer is designed to write out pages that are likely to be
recycled soon, thereby offloading the writing work from active backends.
To do this, it scans forward circularly from the current position of
N
extVictimBuffer (which it does not change!), looking for buffers that are
n
extVictimBuffer (which it does not change!), looking for buffers that are
dirty and not pinned nor marked with a positive usage count. It pins,
writes, and releases any such buffer.
If we can assume that reading
N
extVictimBuffer is an atomic action, then
If we can assume that reading
n
extVictimBuffer is an atomic action, then
the writer doesn't even need to take the BufFreelistLock in order to look
for buffers to write; it needs only to spinlock each buffer header for long
enough to check the dirtybit. Even without that assumption, the writer
...
...
@@ -268,7 +268,7 @@ the contention cost of the writer compared to PG 8.0.)
During a checkpoint, the writer's strategy must be to write every dirty
buffer (pinned or not!). We may as well make it start this scan from
N
extVictimBuffer, however, so that the first-to-be-written pages are the
n
extVictimBuffer, however, so that the first-to-be-written pages are the
ones that backends might otherwise have to write for themselves soon.
The background writer takes shared content lock on a buffer while writing it
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment