@@ -1540,10 +1540,10 @@ ReorderBufferCleanupTXN(ReorderBuffer *rb, ReorderBufferTXN *txn)
1540
1540
Assert (change -> txn == txn );
1541
1541
1542
1542
/*
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.
1547
1547
*/
1548
1548
mem_freed += ReorderBufferChangeSize (change );
1549
1549
@@ -1628,7 +1628,7 @@ static void
1628
1628
ReorderBufferTruncateTXN (ReorderBuffer * rb , ReorderBufferTXN * txn , bool txn_prepared )
1629
1629
{
1630
1630
dlist_mutable_iter iter ;
1631
- Size mem_freed = 0 ;
1631
+ Size mem_freed = 0 ;
1632
1632
1633
1633
/* cleanup subtransactions & their changes */
1634
1634
dlist_foreach_modify (iter , & txn -> subtxns )
@@ -1662,10 +1662,10 @@ ReorderBufferTruncateTXN(ReorderBuffer *rb, ReorderBufferTXN *txn, bool txn_prep
1662
1662
dlist_delete (& change -> node );
1663
1663
1664
1664
/*
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.
1669
1669
*/
1670
1670
mem_freed += ReorderBufferChangeSize (change );
1671
1671
0 commit comments