Commit1b4998f

committed

Further corrections from the department of redundancy department.

Thom Brown

1 parente01e66f commit1b4998fCopy full SHA for 1b4998f

File tree

-3

lines changed

-3

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -125,7 +125,7 @@ we get a disk layout like this:`
`125`	`125`	`where the numbers are page numbers at that level, starting from 0.`
`126`	`126`
`127`	`127`	`To find the physical block # corresponding to leaf page n, we need to`
`128`		`-count the numbernumberof leaf and upper-level pages preceding page n.`
	`128`	`+count the number of leaf and upper-level pages preceding page n.`
`129`	`129`	`This turns out to be`
`130`	`130`
`131`	`131`	`y = n + (n / F + 1) + (n / F^2 + 1) + ... + 1`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -1009,7 +1009,7 @@ LogAccessExclusiveLockPrepare(void)`
`1009`	`1009`	`* RecordTransactionAbort() do not optimise away the transaction`
`1010`	`1010`	`* completion record which recovery relies upon to release locks. It's a`
`1011`	`1011`	`* hack, but for a corner case not worth adding code for into the main`
`1012`		`- * commit path. Second,must must assign an xid before the lock is`
	`1012`	`+ * commit path. Second,we must assign an xid before the lock is`
`1013`	`1013`	`* recorded in shared memory, otherwise a concurrently executing`
`1014`	`1014`	`* GetRunningTransactionLocks() might see a lock associated with an`
`1015`	`1015`	`* InvalidTransactionId which we later assert cannot happen.`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -128,7 +128,7 @@ And the reader can do this:`
`128`	`128`
`129`	`129`	`On machines with strong memory ordering, these weaker barriers will simply`
`130`	`130`	`prevent compiler rearrangement, without emitting any actual machine code.`
`131`		`-On machines with weak memory ordering, they willwillprevent compiler`
	`131`	`+On machines with weak memory ordering, they will prevent compiler`
`132`	`132`	`reordering and also emit whatever hardware barrier may be required. Even`
`133`	`133`	`on machines with weak memory ordering, a read or write barrier may be able`
`134`	`134`	`to use a less expensive instruction than a full barrier.`

Comments

(0)