database/postgres
1
0
Fork 0
mirror of https://github.com/postgres/postgres.git synced 2025-11-15 03:41:20 +03:00
Code Activity

Additional spelling corrections

Browse Source 
A few more minor spelling corrections, no functional changes.

Thom Brown
This commit is contained in:
Stephen Frost
2013-06-03 08:40:27 -04:00
parent e1e2bb34f1
commit f129615fe7
4 changed files with 5 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
src/backend/access/hash/README
View File

@@ -429,8 +429,8 @@ algorithm is:
(this requires read/update/write/release of fore and aft siblings)
pin meta page and take buffer content lock in shared mode
determine which bitmap page contains the free space bit for page
relase meta page buffer content lock
pin bitmap page and take buffer content lock in exclusie mode
release meta page buffer content lock
pin bitmap page and take buffer content lock in exclusive mode
update bitmap bit
mark bitmap page dirty and release buffer content lock and pin
if page number is less than what we saw as first-free-bit in meta:

2
src/backend/access/nbtree/README
View File

@@ -46,7 +46,7 @@ Lehman and Yao don't require read locks, but assume that in-memory
copies of tree pages are unshared. Postgres shares in-memory buffers
among backends. As a result, we do page-level read locking on btree
pages in order to guarantee that no record is modified while we are
examining it. This reduces concurrency but guaranteees correct
examining it. This reduces concurrency but guarantees correct
behavior. An advantage is that when trading in a read lock for a
write lock, we need not re-read the page after getting the write lock.
Since we're also holding a pin on the shared buffer containing the