@@ -324,9 +324,6 @@ ReorderBufferGetTXN(ReorderBuffer *rb)
324
324
325
325
/*
326
326
* Free a ReorderBufferTXN.
327
- *
328
- * Deallocation might be delayed for efficiency purposes, for details check
329
- * the comments above max_cached_changes's definition.
330
327
*/
331
328
static void
332
329
ReorderBufferReturnTXN (ReorderBuffer * rb , ReorderBufferTXN * txn )
@@ -356,7 +353,7 @@ ReorderBufferReturnTXN(ReorderBuffer *rb, ReorderBufferTXN *txn)
356
353
}
357
354
358
355
/*
359
- * Get an unused, possibly preallocated, ReorderBufferChange.
356
+ * Get an fresh ReorderBufferChange.
360
357
*/
361
358
ReorderBufferChange *
362
359
ReorderBufferGetChange (ReorderBuffer * rb )
@@ -372,9 +369,6 @@ ReorderBufferGetChange(ReorderBuffer *rb)
372
369
373
370
/*
374
371
* Free an ReorderBufferChange.
375
- *
376
- * Deallocation might be delayed for efficiency purposes, for details check
377
- * the comments above max_cached_changes's definition.
378
372
*/
379
373
void
380
374
ReorderBufferReturnChange (ReorderBuffer * rb , ReorderBufferChange * change )
@@ -424,8 +418,8 @@ ReorderBufferReturnChange(ReorderBuffer *rb, ReorderBufferChange *change)
424
418
}
425
419
426
420
/*
427
- * Get an unused, possibly preallocated, ReorderBufferTupleBuf fitting at
428
- * least a tuple of size tuple_len (excluding header overhead).
421
+ * Get a fresh ReorderBufferTupleBuf fitting at least a tuple of size
422
+ * tuple_len (excluding header overhead).
429
423
*/
430
424
ReorderBufferTupleBuf *
431
425
ReorderBufferGetTupleBuf (ReorderBuffer * rb , Size tuple_len )
@@ -477,9 +471,6 @@ ReorderBufferGetTupleBuf(ReorderBuffer *rb, Size tuple_len)
477
471
478
472
/*
479
473
* Free an ReorderBufferTupleBuf.
480
- *
481
- * Deallocation might be delayed for efficiency purposes, for details check
482
- * the comments above max_cached_changes's definition.
483
474
*/
484
475
void
485
476
ReorderBufferReturnTupleBuf (ReorderBuffer * rb , ReorderBufferTupleBuf * tuple )
0 commit comments