summaryrefslogtreecommitdiff
path: root/src/backend/access
diff options
context:
space:
mode:
authorStephen Frost <sfrost@snowman.net>2013-06-03 08:40:27 -0400
committerStephen Frost <sfrost@snowman.net>2013-06-03 08:40:27 -0400
commitf129615fe72f70868a86862b663dd7d78dd5cb71 (patch)
tree1b9f8556d85e961dd9a346f5c2b1c036acaa49c0 /src/backend/access
parente1e2bb34f1237cbec396bcaa795f0fa955af0e72 (diff)
Additional spelling corrections
A few more minor spelling corrections, no functional changes. Thom Brown
Diffstat (limited to 'src/backend/access')
-rw-r--r--src/backend/access/hash/README4
-rw-r--r--src/backend/access/nbtree/README2
2 files changed, 3 insertions, 3 deletions
diff --git a/src/backend/access/hash/README b/src/backend/access/hash/README
index 2652cae729c..0a7da892852 100644
--- a/src/backend/access/hash/README
+++ b/src/backend/access/hash/README
@@ -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:
diff --git a/src/backend/access/nbtree/README b/src/backend/access/nbtree/README
index 6d438a7662e..fcf1a951409 100644
--- a/src/backend/access/nbtree/README
+++ b/src/backend/access/nbtree/README
@@ -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