mirrors
/
postgres
mirror of https://github.com/postgres/postgres
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Fix identation.

This commit is contained in:
Masahiko Sawada 2024-08-26 16:16:12 -07:00
parent 52f1d6730b
commit 7229ebe011
1 changed files with 9 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

18
src/backend/replication/logical/reorderbuffer.c
View File

@ -1540,10 +1540,10 @@ ReorderBufferCleanupTXN(ReorderBuffer *rb, ReorderBufferTXN *txn)
Assert(change->txn == txn); Assert(change->txn == txn);
/* /*
* Instead of updating the memory counter for individual changes, * Instead of updating the memory counter for individual changes, we
* we sum up the size of memory to free so we can update the memory * sum up the size of memory to free so we can update the memory
* counter all together below. This saves costs of maintaining * counter all together below. This saves costs of maintaining the
* the max-heap. * max-heap.
*/ */
mem_freed += ReorderBufferChangeSize(change); mem_freed += ReorderBufferChangeSize(change);
@ -1628,7 +1628,7 @@ static void
ReorderBufferTruncateTXN(ReorderBuffer *rb, ReorderBufferTXN *txn, bool txn_prepared) ReorderBufferTruncateTXN(ReorderBuffer *rb, ReorderBufferTXN *txn, bool txn_prepared)
{ {
dlist_mutable_iter iter; dlist_mutable_iter iter;
Size mem_freed = 0; Size mem_freed = 0;
/* cleanup subtransactions & their changes */ /* cleanup subtransactions & their changes */
dlist_foreach_modify(iter, &txn->subtxns) dlist_foreach_modify(iter, &txn->subtxns)
@ -1662,10 +1662,10 @@ ReorderBufferTruncateTXN(ReorderBuffer *rb, ReorderBufferTXN *txn, bool txn_prep
dlist_delete(&change->node); dlist_delete(&change->node);
/* /*
* Instead of updating the memory counter for individual changes, * Instead of updating the memory counter for individual changes, we
* we sum up the size of memory to free so we can update the memory * sum up the size of memory to free so we can update the memory
* counter all together below. This saves costs of maintaining * counter all together below. This saves costs of maintaining the
* the max-heap. * max-heap.
*/ */
mem_freed += ReorderBufferChangeSize(change); mem_freed += ReorderBufferChangeSize(change);