|
|
|
@ -1213,12 +1213,11 @@ CompactCheckpointerRequestQueue(void) |
|
|
|
|
* backwards from the end of the queue and check whether a request is |
|
|
|
|
* *preceded* by an earlier, identical request, in the hopes of doing less |
|
|
|
|
* copying. But that might change the semantics, if there's an |
|
|
|
|
* intervening FORGET_RELATION_FSYNC or FORGET_DATABASE_FSYNC request, so |
|
|
|
|
* we do it this way. It would be possible to be even smarter if we made |
|
|
|
|
* the code below understand the specific semantics of such requests (it |
|
|
|
|
* could blow away preceding entries that would end up being canceled |
|
|
|
|
* anyhow), but it's not clear that the extra complexity would buy us |
|
|
|
|
* anything. |
|
|
|
|
* intervening SYNC_FORGET_REQUEST or SYNC_FILTER_REQUEST, so we do it |
|
|
|
|
* this way. It would be possible to be even smarter if we made the code |
|
|
|
|
* below understand the specific semantics of such requests (it could blow |
|
|
|
|
* away preceding entries that would end up being canceled anyhow), but |
|
|
|
|
* it's not clear that the extra complexity would buy us anything. |
|
|
|
|
*/ |
|
|
|
|
for (n = 0; n < CheckpointerShmem->num_requests; n++) |
|
|
|
|
{ |
|
|
|
|