Mercurial > prosody-hg
view util/random.lua @ 14198:73903352de86
util.smqueue: Refactor checkpoint logic and add tests
The previous checkpoint logic used recursion, and the code was more complex
than needed due to maintenance of the self._next_checkpoint field.
This switches to a loop, which should be a bit more efficient, partly because
there are fewer calls (although it was a tail call) and because table lookups
can now be cached between each execution.
_call_checkpoints() is now called unconditionally for every ack, which is
simpler though adds a function call, it should be more than balanced out by
the other changes.
| author | Matthew Wild <mwild1@gmail.com> |
|---|---|
| date | Tue, 26 May 2026 15:36:36 +0100 |
| parents | d10957394a3c |
| children |
line wrap: on
line source
-- Prosody IM -- Copyright (C) 2008-2014 Matthew Wild -- Copyright (C) 2008-2014 Waqas Hussain -- -- This project is MIT/X11 licensed. Please see the -- COPYING file in the source package for more information. -- local ok, crand = pcall(require, "prosody.util.crand"); if ok and pcall(crand.bytes, 1) then return crand; end local urandom, urandom_err = io.open("/dev/urandom", "r"); local function bytes(n) local data, err = urandom:read(n); if not data then if err then error("Unable to retrieve data from secure random number generator (/dev/urandom): "..tostring(err)); else error("Secure random number generator (/dev/urandom) returned an end-of-file condition"); end end return data; end if not urandom then function bytes() error("Unable to obtain a secure random number generator, please see https://prosody.im/doc/random ("..urandom_err..")"); end end return { bytes = bytes; _source = "/dev/urandom"; };
