static CycleCtr sync_cycle_ctr = 0;
static CycleCtr checkpoint_cycle_ctr = 0;
-/* Intervals for calling AbsorbFsyncRequests */
+/* Intervals for calling AbsorbSyncRequests */
#define FSYNCS_PER_ABSORB 10
#define UNLINKS_PER_ABSORB 10
pfree(entry);
/*
- * As in ProcessFsyncRequests, we don't want to stop absorbing fsync
+ * As in ProcessSyncRequests, we don't want to stop absorbing fsync
* requests for along time when there are many deletions to be done.
- * We can safely call AbsorbFsyncRequests() at this point in the loop
+ * We can safely call AbsorbSyncRequests() at this point in the loop
* (note it might try to delete list entries).
*/
if (--absorb_counter <= 0)
* eventually wrap the counter around to the point where an old entry
* might appear new, causing us to skip it, possibly allowing a checkpoint
* to succeed that should not have. To forestall wraparound, any time the
- * previous ProcessFsyncRequests() failed to complete, run through the
+ * previous ProcessSyncRequests() failed to complete, run through the
* table and forcibly set cycle_ctr = sync_cycle_ctr.
*
* Think not to merge this loop with the main loop, as the problem is
* This is not an academic possibility. One scenario where this
* happens is when bgwriter has a pending unlink request for a file in
* a database that's being dropped. In dropdb(), we call
- * ForgetDatabaseFsyncRequests() to flush out any such pending unlink
+ * ForgetDatabaseSyncRequests() to flush out any such pending unlink
* requests, but because that's asynchronous, it's not guaranteed that
* the bgwriter receives the message in time.
*/