Home
last modified time | relevance | path

Searched refs:x2n_table (Results 1 – 5 of 5) sorted by relevance

/third_party/zlib/
Dcrc32.c155 local z_crc_t FAR x2n_table[32]; variable
300 x2n_table[0] = p; in make_crc_table()
302 x2n_table[n] = p = multmodp(p, p); in make_crc_table()
436 write_table(out, x2n_table, 32); in make_crc_table()
584 p = multmodp(x2n_table[k & 31], p);
Dcrc32.h9439 local const z_crc_t FAR x2n_table[] = { variable
/third_party/node/deps/zlib/
Dcrc32.c146 local z_crc_t FAR x2n_table[32]; variable
189 p = multmodp(x2n_table[k & 31], p); in x2nmodp()
334 x2n_table[0] = p; in make_crc_table()
336 x2n_table[n] = p = multmodp(p, p); in make_crc_table()
470 write_table(out, x2n_table, 32); in make_crc_table()
Dcrc32.h9439 local const z_crc_t FAR x2n_table[] = { variable
/third_party/chromium/patch/
D0001-cve.patch9320 +local z_crc_t FAR x2n_table[32];
9526 + x2n_table[0] = p;
9528 + x2n_table[n] = p = multmodp(p, p);
9531 + /* initialize the braiding tables -- needs x2n_table[] */
9674 + "local const z_crc_t FAR x2n_table[] = {\n"
9676 + write_table(out, x2n_table, 32);
9817 + Return x^(n * 2^k) modulo p(x). Requires that x2n_table[] has been
9829 + p = multmodp(x2n_table[k & 31], p);
20436 +local const z_crc_t FAR x2n_table[] = {