@ -1366,10 +1366,11 @@ ReorderBufferIterTXNNext(ReorderBuffer *rb, ReorderBufferIterTXNState *state)
dlist_push_tail ( & state - > old_change , & change - > node ) ;
/*
* Update the total bytes processed before releasing the current set
* of changes and restoring the new set of changes .
* Update the total bytes processed by the txn for which we are
* releasing the current set of changes and restoring the new set of
* changes .
*/
rb - > totalBytes + = rb - > size ;
rb - > totalBytes + = entry - > txn - > size ;
if ( ReorderBufferRestoreChanges ( rb , entry - > txn , & entry - > file ,
& state - > entries [ off ] . segno ) )
{
@ -2371,9 +2372,9 @@ ReorderBufferProcessTXN(ReorderBuffer *rb, ReorderBufferTXN *txn,
iterstate = NULL ;
/*
* Update total transaction count and total transaction bytes
* processed . Ensure to not count the streamed transaction multipl e
* times .
* Update total transaction count and total bytes processed by the
* transaction and its subtransactions . Ensure to not count the
* streamed transaction multiple times .
*
* Note that the statistics computation has to be done after
* ReorderBufferIterTXNFinish as it releases the serialized change
@ -2382,7 +2383,7 @@ ReorderBufferProcessTXN(ReorderBuffer *rb, ReorderBufferTXN *txn,
if ( ! rbtxn_is_streamed ( txn ) )
rb - > totalTxns + + ;
rb - > totalBytes + = rb - > size ;
rb - > totalBytes + = txn - > total_ size;
/*
* Done with current changes , send the last message for this set of
@ -3073,7 +3074,7 @@ ReorderBufferChangeMemoryUpdate(ReorderBuffer *rb,
{
Size sz ;
ReorderBufferTXN * txn ;
ReorderBufferTXN * toptxn = NULL ;
ReorderBufferTXN * toptxn ;
Assert ( change - > txn ) ;
@ -3087,14 +3088,14 @@ ReorderBufferChangeMemoryUpdate(ReorderBuffer *rb,
txn = change - > txn ;
/* If streaming supported, update the total size in top level as well. */
if ( ReorderBufferCanStream ( rb ) )
{
/*
* Update the total size in top level as well . This is later used to
* compute the decoding stats .
*/
if ( txn - > toptxn ! = NULL )
toptxn = txn - > toptxn ;
else
toptxn = txn ;
}
sz = ReorderBufferChangeSize ( change ) ;
@ -3104,7 +3105,6 @@ ReorderBufferChangeMemoryUpdate(ReorderBuffer *rb,
rb - > size + = sz ;
/* Update the total size in the top transaction. */
if ( toptxn )
toptxn - > total_size + = sz ;
}
else
@ -3114,7 +3114,6 @@ ReorderBufferChangeMemoryUpdate(ReorderBuffer *rb,
rb - > size - = sz ;
/* Update the total size in the top transaction. */
if ( toptxn )
toptxn - > total_size - = sz ;
}