Pushes queued files to R2 and removes the ones that left.
Serving a page from R2 on a custom domain costs zero Worker requests,
which is the only lever on the serving ceiling -- every other optimisation moves CPU or rows
while the ceiling stays at 3M visits/month. The queue existed and drained nowhere, so the
ceiling stayed saturated.
The refusal is re-checked here, having already been checked at enqueue, because of the boundary
rule: isMirrorable() at enqueue guards the queue, and a queue row
can outlive the state that admitted it. Only the check adjacent to the put guards the bucket.
Sequential rather than concurrent. A pass runs inside one invocation against a 10 ms
CPU budget, and limit is what bounds it; firing N puts at once would make the slowest one
decide the invocation and remove the only control there is over that.
Pushes queued files to R2 and removes the ones that left.
Serving a page from R2 on a custom domain costs zero Worker requests, which is the only lever on the serving ceiling -- every other optimisation moves CPU or rows while the ceiling stays at 3M visits/month. The queue existed and drained nowhere, so the ceiling stayed saturated.
The refusal is re-checked here, having already been checked at enqueue, because of the boundary rule:
isMirrorable()at enqueue guards the queue, and a queue row can outlive the state that admitted it. Only the check adjacent to theputguards the bucket.Sequential rather than concurrent. A pass runs inside one invocation against a 10 ms CPU budget, and
limitis what bounds it; firing N puts at once would make the slowest one decide the invocation and remove the only control there is over that.