diff options
author | Masahiko Sawada <msawada@postgresql.org> | 2024-08-26 16:16:12 -0700 |
---|---|---|
committer | Masahiko Sawada <msawada@postgresql.org> | 2024-08-26 16:16:12 -0700 |
commit | 7229ebe011dff3f418251a4836f6d098923aa1e1 (patch) | |
tree | 8efb42ef81e250ffc7cdcd640b57ab3b1d309e45 /src/backend/replication/logical/reorderbuffer.c | |
parent | 52f1d6730bf7132a175b9b612029812859218927 (diff) | |
download | postgresql-7229ebe011dff3f418251a4836f6d098923aa1e1.tar.gz postgresql-7229ebe011dff3f418251a4836f6d098923aa1e1.zip |
Fix identation.
Diffstat (limited to 'src/backend/replication/logical/reorderbuffer.c')
-rw-r--r-- | src/backend/replication/logical/reorderbuffer.c | 18 |
1 files changed, 9 insertions, 9 deletions
diff --git a/src/backend/replication/logical/reorderbuffer.c b/src/backend/replication/logical/reorderbuffer.c index b3139c41e2b..d1c4258844f 100644 --- a/src/backend/replication/logical/reorderbuffer.c +++ b/src/backend/replication/logical/reorderbuffer.c @@ -1540,10 +1540,10 @@ ReorderBufferCleanupTXN(ReorderBuffer *rb, ReorderBufferTXN *txn) Assert(change->txn == txn); /* - * Instead of updating the memory counter for individual changes, - * we sum up the size of memory to free so we can update the memory - * counter all together below. This saves costs of maintaining - * the max-heap. + * Instead of updating the memory counter for individual changes, we + * sum up the size of memory to free so we can update the memory + * counter all together below. This saves costs of maintaining the + * max-heap. */ mem_freed += ReorderBufferChangeSize(change); @@ -1628,7 +1628,7 @@ static void ReorderBufferTruncateTXN(ReorderBuffer *rb, ReorderBufferTXN *txn, bool txn_prepared) { dlist_mutable_iter iter; - Size mem_freed = 0; + Size mem_freed = 0; /* cleanup subtransactions & their changes */ dlist_foreach_modify(iter, &txn->subtxns) @@ -1662,10 +1662,10 @@ ReorderBufferTruncateTXN(ReorderBuffer *rb, ReorderBufferTXN *txn, bool txn_prep dlist_delete(&change->node); /* - * Instead of updating the memory counter for individual changes, - * we sum up the size of memory to free so we can update the memory - * counter all together below. This saves costs of maintaining - * the max-heap. + * Instead of updating the memory counter for individual changes, we + * sum up the size of memory to free so we can update the memory + * counter all together below. This saves costs of maintaining the + * max-heap. */ mem_freed += ReorderBufferChangeSize(change); |