redis-semaphore
Version:
Distributed mutex and semaphore based on Redis
55 lines (51 loc) • 1.7 kB
text/typescript
import createDebug from 'debug'
import Redis from 'ioredis'
import { expireIfEqualLua } from '../mutex/refresh'
import { delIfEqualLua } from '../mutex/release'
import { getQuorum, smartSum } from '../utils/redlock'
const debug = createDebug('redis-semaphore:redlock-mutex:refresh')
export async function refreshRedlockMutex(
clients: Redis[],
key: string,
identifier: string,
lockTimeout: number
) {
debug(key, identifier)
const quorum = getQuorum(clients.length)
const promises = clients.map(client =>
expireIfEqualLua(client, [key, identifier, lockTimeout])
.then(result => +result)
.catch(() => 0)
)
const results = await Promise.all(promises)
debug('results', results)
const refreshedCount = results.reduce(smartSum, 0)
if (refreshedCount >= quorum) {
debug(key, identifier, 'refreshed')
if (refreshedCount < clients.length) {
debug(key, identifier, 'try to acquire on failed nodes')
const promises = results
.reduce<Redis[]>((failedClients, result, index) => {
if (!result) {
failedClients.push(clients[index])
}
return failedClients
}, [])
.map(client =>
client
.set(key, identifier, 'PX', lockTimeout, 'NX')
.then(result => (result === 'OK' ? 1 : 0))
.catch(() => 0)
)
const acquireResults = await Promise.all(promises)
debug(key, identifier, 'acquire on failed nodes results', acquireResults)
}
return true
} else {
const promises = clients.map(client =>
delIfEqualLua(client, [key, identifier]).catch(() => 0)
)
await Promise.all(promises)
return false
}
}