Age | Commit message (Collapse) | Author |
|
weecrypto_totp_validate
|
|
NULL hash
|
|
|
|
|
|
|
|
Allowed algorithms are:
* PBKDF2 (SHA256 or SHA512, salt, iterations)
* SHA256
* SHA512
|
|
|
|
to crypto_hash
|
|
function string_hash
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
The order of operators are different from the initial test, so this increases
the code coverage in wee-calc.c.
|
|
|
|
|
|
|
|
"revscr:"
|
|
"modifier:name,data,string" (issue #60)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
"calc:..." (issue #997)
|
|
It is possible to trigger a segmentation fault while processing
an evaluation of repeating string. On a Linux 64 bit system,
enter this (or adjust arguments for 32 bit accordingly):
/eval -n ${repeat:1073741824,----}
It will overflow an integer calculation because int instead of
size_t is used. Proper check of int limitations fixes this issue.
I haven't changed this specific piece of code to size_t because it
would crash in other parts of the code tree instead. For now, int
is a limitating factor when it comes to strings (and should be
enough for sane use cases).
Signed-off-by: Tobias Stoeckmann <tobias@stoeckmann.org>
|
|
(issue #1394)
|