@@ -1540,10 +1540,10 @@ ReorderBufferCleanupTXN(ReorderBuffer *rb, ReorderBufferTXN *txn)
15401540Assert (change -> txn == txn );
15411541
15421542/*
1543- * Instead of updating the memory counter for individual changes,
1544- *we sum up the size of memory to free so we can update the memory
1545- * counter all together below. This saves costs of maintaining
1546- *the max-heap.
1543+ * Instead of updating the memory counter for individual changes, we
1544+ * sum up the size of memory to free so we can update the memory
1545+ * counter all together below. This saves costs of maintaining the
1546+ * max-heap.
15471547 */
15481548mem_freed += ReorderBufferChangeSize (change );
15491549
@@ -1628,7 +1628,7 @@ static void
16281628ReorderBufferTruncateTXN (ReorderBuffer * rb ,ReorderBufferTXN * txn ,bool txn_prepared )
16291629{
16301630dlist_mutable_iter iter ;
1631- Size mem_freed = 0 ;
1631+ Size mem_freed = 0 ;
16321632
16331633/* cleanup subtransactions & their changes */
16341634dlist_foreach_modify (iter ,& txn -> subtxns )
@@ -1662,10 +1662,10 @@ ReorderBufferTruncateTXN(ReorderBuffer *rb, ReorderBufferTXN *txn, bool txn_prep
16621662dlist_delete (& change -> node );
16631663
16641664/*
1665- * Instead of updating the memory counter for individual changes,
1666- *we sum up the size of memory to free so we can update the memory
1667- * counter all together below. This saves costs of maintaining
1668- *the max-heap.
1665+ * Instead of updating the memory counter for individual changes, we
1666+ * sum up the size of memory to free so we can update the memory
1667+ * counter all together below. This saves costs of maintaining the
1668+ * max-heap.
16691669 */
16701670mem_freed += ReorderBufferChangeSize (change );
16711671