63 lines
2 KiB
JavaScript
63 lines
2 KiB
JavaScript
|
// note: max backoff is the maximum that any *single* backoff will do
|
||
|
|
export const MAXBACKOFF = 200;
|
||
|
|
export const RATE = 1.2;
|
||
|
|
export const MAXRETRIES = 10;
|
||
|
|
export const codes = new Set(['EMFILE', 'ENFILE', 'EBUSY']);
|
||
|
|
export const retryBusy = (fn) => {
|
||
|
|
const method = async (path, opt, backoff = 1, total = 0) => {
|
||
|
|
const mbo = opt.maxBackoff || MAXBACKOFF;
|
||
|
|
const rate = opt.backoff || RATE;
|
||
|
|
const max = opt.maxRetries || MAXRETRIES;
|
||
|
|
let retries = 0;
|
||
|
|
while (true) {
|
||
|
|
try {
|
||
|
|
return await fn(path);
|
||
|
|
}
|
||
|
|
catch (er) {
|
||
|
|
const fer = er;
|
||
|
|
if (fer?.path === path && fer?.code && codes.has(fer.code)) {
|
||
|
|
backoff = Math.ceil(backoff * rate);
|
||
|
|
total = backoff + total;
|
||
|
|
if (total < mbo) {
|
||
|
|
return new Promise((res, rej) => {
|
||
|
|
setTimeout(() => {
|
||
|
|
method(path, opt, backoff, total).then(res, rej);
|
||
|
|
}, backoff);
|
||
|
|
});
|
||
|
|
}
|
||
|
|
if (retries < max) {
|
||
|
|
retries++;
|
||
|
|
continue;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
throw er;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
};
|
||
|
|
return method;
|
||
|
|
};
|
||
|
|
// just retries, no async so no backoff
|
||
|
|
export const retryBusySync = (fn) => {
|
||
|
|
const method = (path, opt) => {
|
||
|
|
const max = opt.maxRetries || MAXRETRIES;
|
||
|
|
let retries = 0;
|
||
|
|
while (true) {
|
||
|
|
try {
|
||
|
|
return fn(path);
|
||
|
|
}
|
||
|
|
catch (er) {
|
||
|
|
const fer = er;
|
||
|
|
if (fer?.path === path &&
|
||
|
|
fer?.code &&
|
||
|
|
codes.has(fer.code) &&
|
||
|
|
retries < max) {
|
||
|
|
retries++;
|
||
|
|
continue;
|
||
|
|
}
|
||
|
|
throw er;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
};
|
||
|
|
return method;
|
||
|
|
};
|
||
|
|
//# sourceMappingURL=retry-busy.js.map
|