@@ -78,8 +78,8 @@ typedef struct ReorderBufferChange
78
78
RepOriginId origin_id ;
79
79
80
80
/*
81
- * Context data for the change, which part of the union is valid depends
82
- * on action/action_internal .
81
+ * Context data for the change. Which part of the union is valid depends
82
+ * on action.
83
83
*/
84
84
union
85
85
{
@@ -245,7 +245,7 @@ typedef struct ReorderBufferTXN
245
245
/* ---
246
246
* Position in one of three lists:
247
247
* * list of subtransactions if we are *known* to be subxact
248
- * * list of toplevel xacts (can beam as-yet unknown subxact)
248
+ * * list of toplevel xacts (can bean as-yet unknown subxact)
249
249
* * list of preallocated ReorderBufferTXNs
250
250
* ---
251
251
*/
@@ -283,7 +283,7 @@ struct ReorderBuffer
283
283
284
284
/*
285
285
* Transactions that could be a toplevel xact, ordered by LSN of the first
286
- * record bearing that xid..
286
+ * record bearing that xid.
287
287
*/
288
288
dlist_head toplevel_by_lsn ;
289
289
@@ -295,7 +295,7 @@ struct ReorderBuffer
295
295
ReorderBufferTXN * by_txn_last_txn ;
296
296
297
297
/*
298
- *Callacks to be called when a transactions commits.
298
+ *Callbacks to be called when a transactions commits.
299
299
*/
300
300
ReorderBufferBeginCB begin ;
301
301
ReorderBufferApplyChangeCB apply_change ;
@@ -318,7 +318,7 @@ struct ReorderBuffer
318
318
* overhead we cache some unused ones here.
319
319
*
320
320
* The maximum number of cached entries is controlled by const variables
321
- *ontop of reorderbuffer.c
321
+ *on top of reorderbuffer.c
322
322
*/
323
323
324
324
/* cached ReorderBufferTXNs */