@@ -322,9 +322,6 @@ ReorderBufferGetTXN(ReorderBuffer *rb)
322
322
323
323
/*
324
324
* Free a ReorderBufferTXN.
325
- *
326
- * Deallocation might be delayed for efficiency purposes, for details check
327
- * the comments above max_cached_changes's definition.
328
325
*/
329
326
static void
330
327
ReorderBufferReturnTXN (ReorderBuffer * rb , ReorderBufferTXN * txn )
@@ -354,7 +351,7 @@ ReorderBufferReturnTXN(ReorderBuffer *rb, ReorderBufferTXN *txn)
354
351
}
355
352
356
353
/*
357
- * Get an unused, possibly preallocated, ReorderBufferChange.
354
+ * Get an fresh ReorderBufferChange.
358
355
*/
359
356
ReorderBufferChange *
360
357
ReorderBufferGetChange (ReorderBuffer * rb )
@@ -370,9 +367,6 @@ ReorderBufferGetChange(ReorderBuffer *rb)
370
367
371
368
/*
372
369
* Free an ReorderBufferChange.
373
- *
374
- * Deallocation might be delayed for efficiency purposes, for details check
375
- * the comments above max_cached_changes's definition.
376
370
*/
377
371
void
378
372
ReorderBufferReturnChange (ReorderBuffer * rb , ReorderBufferChange * change )
@@ -423,8 +417,8 @@ ReorderBufferReturnChange(ReorderBuffer *rb, ReorderBufferChange *change)
423
417
}
424
418
425
419
/*
426
- * Get an unused, possibly preallocated, ReorderBufferTupleBuf fitting at
427
- * least a tuple of size tuple_len (excluding header overhead).
420
+ * Get a fresh ReorderBufferTupleBuf fitting at least a tuple of size
421
+ * tuple_len (excluding header overhead).
428
422
*/
429
423
ReorderBufferTupleBuf *
430
424
ReorderBufferGetTupleBuf (ReorderBuffer * rb , Size tuple_len )
@@ -446,9 +440,6 @@ ReorderBufferGetTupleBuf(ReorderBuffer *rb, Size tuple_len)
446
440
447
441
/*
448
442
* Free an ReorderBufferTupleBuf.
449
- *
450
- * Deallocation might be delayed for efficiency purposes, for details check
451
- * the comments above max_cached_changes's definition.
452
443
*/
453
444
void
454
445
ReorderBufferReturnTupleBuf (ReorderBuffer * rb , ReorderBufferTupleBuf * tuple )
0 commit comments