mirror of
https://github.com/ElementsProject/lightning.git
synced 2024-11-20 10:39:49 +01:00
7401b26824
Before: Ten builds, laptop -j5, no ccache: ``` real 0m36.686000-38.956000(38.608+/-0.65)s user 2m32.864000-42.253000(40.7545+/-2.7)s sys 0m16.618000-18.316000(17.8531+/-0.48)s ``` Ten builds, laptop -j5, ccache (warm): ``` real 0m8.212000-8.577000(8.39989+/-0.13)s user 0m12.731000-13.212000(12.9751+/-0.17)s sys 0m3.697000-3.902000(3.83722+/-0.064)s ``` After: Ten builds, laptop -j5, no ccache: 8% faster ``` real 0m33.802000-35.773000(35.468+/-0.54)s user 2m19.073000-27.754000(26.2542+/-2.3)s sys 0m15.784000-17.173000(16.7165+/-0.37)s ``` Ten builds, laptop -j5, ccache (warm): 1% faster ``` real 0m8.200000-8.485000(8.30138+/-0.097)s user 0m12.485000-13.100000(12.7344+/-0.19)s sys 0m3.702000-3.889000(3.78787+/-0.056)s ``` Signed-off-by: Rusty Russell <rusty@rustcorp.com.au>
82 lines
1.7 KiB
C
82 lines
1.7 KiB
C
#include <ccan/short_types/short_types.h>
|
|
#include <common/descriptor_checksum.h>
|
|
#include <stdlib.h>
|
|
|
|
|
|
static const char CHECKSUM_CHARSET[] = "qpzry9x8gf2tvdw0s3jn54khce6mua7l";
|
|
|
|
static const char INPUT_CHARSET[] =
|
|
"0123456789()[],'/*abcdefgh@:$%{}"
|
|
"IJKLMNOPQRSTUVWXYZ&+-.;<=>?!^_|~"
|
|
"ijklmnopqrstuvwxyzABCDEFGH`#\"\\ ";
|
|
|
|
static inline int charset_find(char ch) {
|
|
for (size_t i = 0; i < sizeof(INPUT_CHARSET); i++) {
|
|
if (INPUT_CHARSET[i] == ch)
|
|
return i;
|
|
}
|
|
return -1;
|
|
}
|
|
|
|
static u64 polymod(u64 c, int val)
|
|
{
|
|
u8 c0 = c >> 35;
|
|
c = ((c & 0x7ffffffff) << 5) ^ val;
|
|
if (c0 & 1) c ^= 0xf5dee51989;
|
|
if (c0 & 2) c ^= 0xa9fdca3312;
|
|
if (c0 & 4) c ^= 0x1bab10e32d;
|
|
if (c0 & 8) c ^= 0x3706b1677a;
|
|
if (c0 & 16) c ^= 0x644d626ffd;
|
|
return c;
|
|
}
|
|
|
|
|
|
bool descriptor_checksum(const char *descriptor, int desc_size,
|
|
struct descriptor_checksum *checksum)
|
|
{
|
|
checksum->csum[0] = 0;
|
|
|
|
int j;
|
|
u64 c = 1;
|
|
int cls = 0;
|
|
int clscount = 0;
|
|
|
|
for (int i = 0; i < desc_size; i++) {
|
|
char ch = descriptor[i];
|
|
int pos = charset_find(ch);
|
|
if (pos == -1) {
|
|
checksum->csum[0] = 0;
|
|
return false;
|
|
}
|
|
/* Emit a symbol for the position inside the group, for every
|
|
* character. */
|
|
c = polymod(c, pos & 31);
|
|
|
|
/* Accumulate the group numbers */
|
|
cls = cls * 3 + (pos >> 5);
|
|
|
|
if (++clscount == 3) {
|
|
c = polymod(c, cls);
|
|
cls = 0;
|
|
clscount = 0;
|
|
}
|
|
}
|
|
|
|
if (clscount > 0)
|
|
c = polymod(c, cls);
|
|
|
|
/* Shift further to determine the checksum. */
|
|
for (j = 0; j < DESCRIPTOR_CHECKSUM_LENGTH; ++j)
|
|
c = polymod(c, 0);
|
|
|
|
/* Prevent appending zeroes from not affecting the checksum. */
|
|
c ^= 1;
|
|
|
|
for (j = 0; j < DESCRIPTOR_CHECKSUM_LENGTH; ++j)
|
|
checksum->csum[j] = CHECKSUM_CHARSET[(c >> (5 * (7 - j))) & 31];
|
|
|
|
checksum->csum[DESCRIPTOR_CHECKSUM_LENGTH] = 0;
|
|
|
|
return true;
|
|
}
|