mirror of
https://github.com/redis/redis.git
synced 2026-02-03 20:39:54 -05:00
Merge c2808f2823 into b5a37c0e42
This commit is contained in:
commit
f742ef1828
12 changed files with 13 additions and 13 deletions
|
|
@ -2585,7 +2585,7 @@ void bugReportEnd(int killViaSignal, int sig) {
|
|||
serverLogRawFromHandler(LL_WARNING|LL_RAW,
|
||||
"\n=== REDIS BUG REPORT END. Make sure to include from START to END. ===\n\n"
|
||||
" Please report the crash by opening an issue on github:\n\n"
|
||||
" http://github.com/redis/redis/issues\n\n"
|
||||
" https://github.com/redis/redis/issues\n\n"
|
||||
" If a Redis module was involved, please open in the module's repo instead.\n\n"
|
||||
" Suspect RAM error? Use redis-server --test-memory to verify it.\n\n"
|
||||
" Some other issues could be detected by redis-server --check-system\n"
|
||||
|
|
|
|||
|
|
@ -1420,7 +1420,7 @@ dictEntry *dictGetFairRandomKey(dict *d) {
|
|||
}
|
||||
|
||||
/* Function to reverse bits. Algorithm from:
|
||||
* http://graphics.stanford.edu/~seander/bithacks.html#ReverseParallel */
|
||||
* https://graphics.stanford.edu/~seander/bithacks.html#ReverseParallel */
|
||||
static unsigned long rev(unsigned long v) {
|
||||
unsigned long s = CHAR_BIT * sizeof(v); // bit size; must be power of 2
|
||||
unsigned long mask = ~0UL;
|
||||
|
|
|
|||
|
|
@ -77,7 +77,7 @@ static inline uint64_t interleave64(uint32_t xlo, uint32_t ylo) {
|
|||
}
|
||||
|
||||
/* reverse the interleave process
|
||||
* derived from http://stackoverflow.com/questions/4909263
|
||||
* derived from https://stackoverflow.com/questions/4909263
|
||||
*/
|
||||
static inline uint64_t deinterleave64(uint64_t interleaved) {
|
||||
static const uint64_t B[] = {0x5555555555555555ULL, 0x3333333333333333ULL,
|
||||
|
|
|
|||
|
|
@ -47,7 +47,7 @@ void memtest_progress_start(char *title, int pass) {
|
|||
/* Fill with dots. */
|
||||
for (j = 0; j < ws.ws_col*(ws.ws_row-2); j++) printf(".");
|
||||
printf("Please keep the test running several minutes per GB of memory.\n");
|
||||
printf("Also check http://www.memtest86.com/ and http://pyropus.ca/software/memtester/");
|
||||
printf("Also check https://www.memtest86.com/ and http://pyropus.ca/software/memtester/");
|
||||
printf("\x1b[H\x1b[2K"); /* Cursor home, clear current line. */
|
||||
printf("%s [%d]\n", title, pass); /* Print title. */
|
||||
progress_printed = 0;
|
||||
|
|
@ -341,7 +341,7 @@ void memtest(size_t megabytes, int passes) {
|
|||
memtest_alloc_and_test(megabytes,passes);
|
||||
printf("\nYour memory passed this test.\n");
|
||||
printf("Please if you are still in doubt use the following two tools:\n");
|
||||
printf("1) memtest86: http://www.memtest86.com/\n");
|
||||
printf("1) memtest86: https://www.memtest86.com/\n");
|
||||
printf("2) memtester: http://pyropus.ca/software/memtester/\n");
|
||||
exit(0);
|
||||
}
|
||||
|
|
|
|||
|
|
@ -82,7 +82,7 @@ static inline size_t spt_min(size_t a, size_t b) {
|
|||
|
||||
/*
|
||||
* For discussion on the portability of the various methods, see
|
||||
* http://lists.freebsd.org/pipermail/freebsd-stable/2008-June/043136.html
|
||||
* https://lists.freebsd.org/pipermail/freebsd-stable/2008-June/043136.html
|
||||
*/
|
||||
int spt_clearenv(void) {
|
||||
#ifdef HAVE_CLEARENV
|
||||
|
|
|
|||
|
|
@ -8,7 +8,7 @@
|
|||
specification. The others, SHA-384 and SHA-512, are not
|
||||
offered in this implementation.
|
||||
Algorithm specification can be found here:
|
||||
* http://csrc.nist.gov/publications/fips/fips180-2/fips180-2withchangenotice.pdf
|
||||
* https://csrc.nist.gov/publications/fips/fips180-2/fips180-2withchangenotice.pdf
|
||||
This implementation uses little endian byte order.
|
||||
*********************************************************************/
|
||||
|
||||
|
|
|
|||
|
|
@ -12,7 +12,7 @@
|
|||
|
||||
You should have received a copy of the CC0 Public Domain Dedication along
|
||||
with this software. If not, see
|
||||
<http://creativecommons.org/publicdomain/zero/1.0/>.
|
||||
<https://creativecommons.org/publicdomain/zero/1.0/>.
|
||||
|
||||
----------------------------------------------------------------------------
|
||||
|
||||
|
|
|
|||
|
|
@ -1,5 +1,5 @@
|
|||
/* sparkline.c -- ASCII Sparklines
|
||||
* This code is modified from http://github.com/antirez/aspark and adapted
|
||||
* This code is modified from https://github.com/antirez/aspark and adapted
|
||||
* in order to return SDS strings instead of outputting directly to
|
||||
* the terminal.
|
||||
*
|
||||
|
|
|
|||
|
|
@ -729,7 +729,7 @@ int d2string(char *buf, size_t len, double value) {
|
|||
else
|
||||
len = snprintf(buf,len,"inf");
|
||||
} else if (value == 0) {
|
||||
/* See: http://en.wikipedia.org/wiki/Signed_zero, "Comparisons". */
|
||||
/* See: https://en.wikipedia.org/wiki/Signed_zero, "Comparisons". */
|
||||
if (1.0/value < 0)
|
||||
len = snprintf(buf,len,"-0");
|
||||
else
|
||||
|
|
|
|||
|
|
@ -1114,7 +1114,7 @@ size_t zmalloc_get_private_dirty(long pid) {
|
|||
*
|
||||
* Note that this function:
|
||||
* 1) Was released under the following CC attribution license:
|
||||
* http://creativecommons.org/licenses/by/3.0/deed.en_US.
|
||||
* https://creativecommons.org/licenses/by/3.0/deed.en_US.
|
||||
* 2) Was originally implemented by David Robert Nadeau.
|
||||
* 3) Was modified for Redis by Matt Stancliff.
|
||||
* 4) This note exists in order to comply with the original license.
|
||||
|
|
|
|||
|
|
@ -1,7 +1,7 @@
|
|||
The utilities in this directory plot the distribution of SRANDMEMBER to
|
||||
evaluate how fair it is.
|
||||
|
||||
See http://theshfl.com/redis_sets for more information on the topic that lead
|
||||
See https://theshfl.com/redis_sets for more information on the topic that lead
|
||||
to such investigation fix.
|
||||
|
||||
showdist.rb -- shows the distribution of the frequency elements are returned.
|
||||
|
|
|
|||
|
|
@ -1,4 +1,4 @@
|
|||
# This script is from http://poormansprofiler.org/
|
||||
# This script is from https://poormansprofiler.org/
|
||||
#
|
||||
# NOTE: Instead of using this script, you should use the Redis
|
||||
# Software Watchdog, which provides a similar functionality but in
|
||||
|
|
|
|||
Loading…
Reference in a new issue