| /kernel/linux/linux-5.10/lib/ |
| D | test_string.c | 1 // SPDX-License-Identifier: GPL-2.0-only
10 u16 v, *p; in memset16_selftest() local
12 p = kmalloc(256 * 2 * 2, GFP_KERNEL); in memset16_selftest()
13 if (!p) in memset16_selftest()
14 return -1; in memset16_selftest()
16 for (i = 0; i < 256; i++) { in memset16_selftest()
17 for (j = 0; j < 256; j++) { in memset16_selftest()
18 memset(p, 0xa1, 256 * 2 * sizeof(v)); in memset16_selftest()
19 memset16(p + i, 0xb1b2, j); in memset16_selftest()
21 v = p[k]; in memset16_selftest()
[all …]
|
| D | crc32.c | 3 * cleaned up code to current version of sparse and added the slicing-by-8
4 * algorithm to the closely similar existing slicing-by-4 algorithm.
9 * subsequently included in the kernel, thus was re-licensed under the
56 /* implements slicing-by-4 or slicing-by-8 algorithm */
58 crc32_body(u32 crc, unsigned char const *buf, size_t len, const u32 (*tab)[256]) argument
88 } while ((--len) && ((long)buf)&3);
101 --b;
104 for (--b; len; --len) {
118 u8 *p = (u8 *)(b + 1) - 1; local
121 DO_CRC(*++p); /* use pre increment for speed */
[all …]
|
| /kernel/linux/linux-6.6/lib/ |
| D | test_string.c | 1 // SPDX-License-Identifier: GPL-2.0-only
10 u16 v, *p; in memset16_selftest() local
12 p = kmalloc(256 * 2 * 2, GFP_KERNEL); in memset16_selftest()
13 if (!p) in memset16_selftest()
14 return -1; in memset16_selftest()
16 for (i = 0; i < 256; i++) { in memset16_selftest()
17 for (j = 0; j < 256; j++) { in memset16_selftest()
18 memset(p, 0xa1, 256 * 2 * sizeof(v)); in memset16_selftest()
19 memset16(p + i, 0xb1b2, j); in memset16_selftest()
21 v = p[k]; in memset16_selftest()
[all …]
|
| /kernel/linux/linux-5.10/lib/raid6/ |
| D | recov_s390xc.c | 1 // SPDX-License-Identifier: GPL-2.0
3 * RAID-6 data recovery in dual failure mode based on the XC instruction.
14 typedef struct { u8 _[256]; } addrtype; in xor_block()
17 " xc 0(256,%[p1]),0(%[p2])\n" in xor_block()
26 u8 *p, *q, *dp, *dq; in raid6_2data_recov_s390xc() local
27 const u8 *pbmul; /* P multiplier table for B data */ in raid6_2data_recov_s390xc()
31 p = (u8 *)ptrs[disks-2]; in raid6_2data_recov_s390xc()
32 q = (u8 *)ptrs[disks-1]; in raid6_2data_recov_s390xc()
36 delta p and delta q */ in raid6_2data_recov_s390xc()
39 ptrs[disks-2] = dp; in raid6_2data_recov_s390xc()
[all …]
|
| /kernel/linux/linux-6.6/lib/raid6/ |
| D | recov_s390xc.c | 1 // SPDX-License-Identifier: GPL-2.0
3 * RAID-6 data recovery in dual failure mode based on the XC instruction.
14 typedef struct { u8 _[256]; } addrtype; in xor_block()
17 " xc 0(256,%[p1]),0(%[p2])\n" in xor_block()
26 u8 *p, *q, *dp, *dq; in raid6_2data_recov_s390xc() local
27 const u8 *pbmul; /* P multiplier table for B data */ in raid6_2data_recov_s390xc()
31 p = (u8 *)ptrs[disks-2]; in raid6_2data_recov_s390xc()
32 q = (u8 *)ptrs[disks-1]; in raid6_2data_recov_s390xc()
36 delta p and delta q */ in raid6_2data_recov_s390xc()
39 ptrs[disks-2] = dp; in raid6_2data_recov_s390xc()
[all …]
|
| /kernel/linux/linux-6.6/net/sunrpc/auth_gss/ |
| D | gss_krb5_mech.c | 1 // SPDX-License-Identifier: BSD-3-Clause
5 * Copyright (c) 2001-2008 The Regents of the University of Michigan.
36 * AES-128 with SHA-1 (RFC 3962)
41 .name = "aes128-cts",
54 .signalg = -1,
55 .sealalg = -1,
65 * AES-256 with SHA-1 (RFC 3962)
70 .name = "aes256-cts",
83 .signalg = -1,
84 .sealalg = -1,
[all …]
|
| /kernel/linux/linux-6.6/crypto/ |
| D | ecrdsa_defs.h | 1 /* SPDX-License-Identifier: GPL-2.0+ */
3 * Definitions of EC-RDSA Curve Parameters
22 * EC-RDSA uses its own set of curves.
24 * cp256{a,b,c} curves first defined for GOST R 34.10-2001 in RFC 4357 (as
25 * 256-bit {A,B,C}-ParamSet), but inherited for GOST R 34.10-2012 and
26 * proposed for use in R 50.1.114-2016 and RFC 7836 as the 256-bit curves.
35 static u64 cp256a_p[] = { /* p = 2^256 - 617 */
41 static u64 cp256a_a[] = { /* a = p - 3 */
53 .ndigits = 256 / 64,
55 .p = cp256a_p,
[all …]
|
| /kernel/linux/linux-5.10/crypto/ |
| D | ecrdsa_defs.h | 1 /* SPDX-License-Identifier: GPL-2.0+ */
3 * Definitions of EC-RDSA Curve Parameters
22 * EC-RDSA uses its own set of curves.
24 * cp256{a,b,c} curves first defined for GOST R 34.10-2001 in RFC 4357 (as
25 * 256-bit {A,B,C}-ParamSet), but inherited for GOST R 34.10-2012 and
26 * proposed for use in R 50.1.114-2016 and RFC 7836 as the 256-bit curves.
35 static u64 cp256a_p[] = { /* p = 2^256 - 617 */
41 static u64 cp256a_a[] = { /* a = p - 3 */
53 .ndigits = 256 / 64,
55 .p = cp256a_p,
[all …]
|
| D | gf128mul.c | 1 /* gf128mul.c - GF(2^128) multiplication functions
17 ---------------------------------------------------------------------------
44 ---------------------------------------------------------------------------
94 * 16-bit value that must be XOR-ed into the low-degree end of the
98 * the "be" convention where the highest-order bit is the coefficient of
99 * the highest-degree polynomial term, and one for the "le" convention
100 * where the highest-order bit is the coefficient of the lowest-degree
129 static const u16 gf128mul_table_le[256] = gf128mul_dat(xda_le);
130 static const u16 gf128mul_table_be[256] = gf128mul_dat(xda_be);
134 * the polynomial field representation. They use 64-bit word operations
[all …]
|
| /kernel/linux/linux-6.6/tools/testing/selftests/tc-testing/tc-tests/qdiscs/ |
| D | fq_codel.json | 18 …"matchPattern": "qdisc fq_codel 1: root refcnt [0-9]+ limit 10240p flows 1024 quantum.*target 5ms …
41 …"matchPattern": "qdisc fq_codel 1: root refcnt [0-9]+ limit 1000p flows 1024 quantum.*target 5ms i…
64 …"matchPattern": "qdisc fq_codel 1: root refcnt [0-9]+ limit 10240p flows 1024 quantum.*target 5ms …
87 …"matchPattern": "qdisc fq_codel 1: root refcnt [0-9]+ limit 10240p flows 1024 quantum.*target 2ms …
110 …"matchPattern": "qdisc fq_codel 1: root refcnt [0-9]+ limit 10240p flows 1024 quantum.*target 5ms …
133 …"matchPattern": "qdisc fq_codel 1: root refcnt [0-9]+ limit 10240p flows 1024 quantum 9000 target …
156 …"matchPattern": "qdisc fq_codel 1: root refcnt [0-9]+ limit 10240p flows 1024 quantum.*target 5ms …
179 …"matchPattern": "qdisc fq_codel 1: root refcnt [0-9]+ limit 10240p flows 1024 quantum.*target 5ms …
202 …"matchPattern": "qdisc fq_codel 1: root refcnt [0-9]+ limit 10240p flows 1024 quantum.*target 5ms …
222 …"cmdUnderTest": "$TC qdisc add dev $DUMMY handle 1: root fq_codel limit 1000 flows 256 drop_batch …
[all …]
|
| /kernel/linux/linux-5.10/drivers/s390/crypto/ |
| D | zcrypt_cex2a.h | 1 /* SPDX-License-Identifier: GPL-2.0+ */
19 * Note that all unsigned char arrays are right-justified and left-padded
42 /* Mod-Exp, with a small modulus */
52 /* Mod-Exp, with a large modulus */
57 unsigned char exponent[256];
58 unsigned char modulus[256];
59 unsigned char message[256];
62 /* Mod-Exp, with a larger modulus */
77 unsigned char p[64]; member
90 unsigned char p[128]; member
[all …]
|
| D | zcrypt_msgtype50.c | 1 // SPDX-License-Identifier: GPL-2.0+
47 * Note that all unsigned char arrays are right-justified and left-padded
70 /* Mod-Exp, with a small modulus */
80 /* Mod-Exp, with a large modulus */
85 unsigned char exponent[256];
86 unsigned char modulus[256];
87 unsigned char message[256];
90 /* Mod-Exp, with a larger modulus */
105 unsigned char p[64]; member
118 unsigned char p[128]; member
[all …]
|
| /kernel/linux/linux-6.6/drivers/s390/crypto/ |
| D | zcrypt_msgtype50.c | 1 // SPDX-License-Identifier: GPL-2.0+
44 * Note that all unsigned char arrays are right-justified and left-padded
67 /* Mod-Exp, with a small modulus */
77 /* Mod-Exp, with a large modulus */
82 unsigned char exponent[256];
83 unsigned char modulus[256];
84 unsigned char message[256];
87 /* Mod-Exp, with a larger modulus */
102 unsigned char p[64]; member
115 unsigned char p[128]; member
[all …]
|
| /kernel/linux/linux-6.6/fs/jffs2/ |
| D | compr_rubin.c | 2 * JFFS2 -- Journalling Flash File System, Version 2.
4 * Copyright © 2001-2007 Red Hat, Inc.
5 * Copyright © 2004-2010 David Woodhouse <dwmw2@infradead.org>
23 #define UPPER_BIT_RUBIN (((long) 1)<<(RUBIN_REG_SIZE-1))
24 #define LOWER_BITS_RUBIN ((((long) 1)<<(RUBIN_REG_SIZE-1))-1)
38 unsigned long p; member
51 pp->buf = buf; in init_pushpull()
52 pp->buflen = buflen; in init_pushpull()
53 pp->ofs = ofs; in init_pushpull()
54 pp->reserve = reserve; in init_pushpull()
[all …]
|
| /kernel/linux/linux-5.10/fs/jffs2/ |
| D | compr_rubin.c | 2 * JFFS2 -- Journalling Flash File System, Version 2.
4 * Copyright © 2001-2007 Red Hat, Inc.
5 * Copyright © 2004-2010 David Woodhouse <dwmw2@infradead.org>
23 #define UPPER_BIT_RUBIN (((long) 1)<<(RUBIN_REG_SIZE-1))
24 #define LOWER_BITS_RUBIN ((((long) 1)<<(RUBIN_REG_SIZE-1))-1)
38 unsigned long p; member
51 pp->buf = buf; in init_pushpull()
52 pp->buflen = buflen; in init_pushpull()
53 pp->ofs = ofs; in init_pushpull()
54 pp->reserve = reserve; in init_pushpull()
[all …]
|
| /kernel/linux/linux-6.6/Documentation/userspace-api/media/rc/ |
| D | keytable.c.rst | 1 .. SPDX-License-Identifier: GPL-2.0 OR GFDL-1.1-no-invariants-or-later
6 .. code-block:: c
8 /* keytable.c - This program allows checking/replacing keys at IR
10 Copyright (C) 2006-2009 Mauro Carvalho Chehab <mchehab@kernel.org>
35 struct parse_key *p;
37 for (p=keynames;p->name!=NULL;p++) {
38 if (p->value == (unsigned)codes[1]) {
39 printf("scancode 0x%04x = %s (0x%02x)\\n", codes[0], p->name, codes[1]);
52 struct parse_key *p;
54 for (p=keynames;p->name!=NULL;p++) {
[all …]
|
| /kernel/linux/linux-5.10/Documentation/userspace-api/media/rc/ |
| D | keytable.c.rst | 1 .. SPDX-License-Identifier: GFDL-1.1-no-invariants-or-later
6 .. code-block:: c
8 /* keytable.c - This program allows checking/replacing keys at IR
10 Copyright (C) 2006-2009 Mauro Carvalho Chehab <mchehab@kernel.org>
35 struct parse_key *p;
37 for (p=keynames;p->name!=NULL;p++) {
38 if (p->value == (unsigned)codes[1]) {
39 printf("scancode 0x%04x = %s (0x%02x)\\n", codes[0], p->name, codes[1]);
52 struct parse_key *p;
54 for (p=keynames;p->name!=NULL;p++) {
[all …]
|
| /kernel/linux/linux-5.10/security/selinux/ss/ |
| D | avtab.h | 1 /* SPDX-License-Identifier: GPL-2.0-only */
52 * extended permissions may be used to provide 256 bits of permissions.
55 /* These are not flags. All 256 values may be used */
61 * if 256 bits is not adequate as is often the case with ioctls, then
66 /* 256 bits of permissions */
100 struct avtab_datum *d, void *p),
101 void *p);
104 int avtab_write_item(struct policydb *p, struct avtab_node *cur, void *fp);
105 int avtab_write(struct policydb *p, struct avtab *a, void *fp);
|
| /kernel/linux/linux-6.6/drivers/isdn/mISDN/ |
| D | dsp_audio.c | 20 /* ulaw[unsigned char] -> signed 16-bit */
21 s32 dsp_audio_ulaw_to_s32[256];
22 /* alaw[unsigned char] -> signed 16-bit */
23 s32 dsp_audio_alaw_to_s32[256];
28 /* signed 16-bit -> law */
32 /* alaw -> ulaw */
33 u8 dsp_audio_alaw_to_ulaw[256];
34 /* ulaw -> alaw */
35 static u8 dsp_audio_ulaw_to_alaw[256];
61 pcm_val = -pcm_val; in linear2alaw()
[all …]
|
| /kernel/linux/linux-5.10/drivers/isdn/mISDN/ |
| D | dsp_audio.c | 20 /* ulaw[unsigned char] -> signed 16-bit */
21 s32 dsp_audio_ulaw_to_s32[256];
22 /* alaw[unsigned char] -> signed 16-bit */
23 s32 dsp_audio_alaw_to_s32[256];
28 /* signed 16-bit -> law */
32 /* alaw -> ulaw */
33 u8 dsp_audio_alaw_to_ulaw[256];
34 /* ulaw -> alaw */
35 static u8 dsp_audio_ulaw_to_alaw[256];
61 pcm_val = -pcm_val; in linear2alaw()
[all …]
|
| /kernel/linux/linux-6.6/security/selinux/ss/ |
| D | avtab.h | 1 /* SPDX-License-Identifier: GPL-2.0-only */
52 * extended permissions may be used to provide 256 bits of permissions.
55 /* These are not flags. All 256 values may be used */
61 * if 256 bits is not adequate as is often the case with ioctls, then
66 /* 256 bits of permissions */
106 const struct avtab_datum *d, void *p),
107 void *p);
110 int avtab_write_item(struct policydb *p, const struct avtab_node *cur, void *fp);
111 int avtab_write(struct policydb *p, struct avtab *a, void *fp);
|
| /kernel/linux/linux-6.6/drivers/tty/vt/ |
| D | conmakehash.c | 1 // SPDX-License-Identifier: GPL-2.0-or-later
11 * Copyright (C) 1995-1997 H. Peter Anvin
20 #define MAX_FONTLEN 256
33 char *p = *p0; in getunicode() local
35 while (*p == ' ' || *p == '\t') in getunicode()
36 p++; in getunicode()
37 if (*p != 'U' || p[1] != '+' || in getunicode()
38 !isxdigit(p[2]) || !isxdigit(p[3]) || !isxdigit(p[4]) || in getunicode()
39 !isxdigit(p[5]) || isxdigit(p[6])) in getunicode()
40 return -1; in getunicode()
[all …]
|
| /kernel/linux/linux-5.10/drivers/tty/vt/ |
| D | conmakehash.c | 1 // SPDX-License-Identifier: GPL-2.0-or-later
11 * Copyright (C) 1995-1997 H. Peter Anvin
20 #define MAX_FONTLEN 256
33 char *p = *p0; in getunicode() local
35 while (*p == ' ' || *p == '\t') in getunicode()
36 p++; in getunicode()
37 if (*p != 'U' || p[1] != '+' || in getunicode()
38 !isxdigit(p[2]) || !isxdigit(p[3]) || !isxdigit(p[4]) || in getunicode()
39 !isxdigit(p[5]) || isxdigit(p[6])) in getunicode()
40 return -1; in getunicode()
[all …]
|
| /kernel/linux/linux-5.10/arch/arm/mach-shmobile/ |
| D | pm-rcar-gen2.c | 1 // SPDX-License-Identifier: GPL-2.0
3 * R-Car Generation 2 Power management support
5 * Copyright (C) 2013 - 2015 Renesas Electronics Corporation
18 #include "rcar-gen2.h"
33 #define CA15RESCNT_CPUS 0xf /* CPU0-3 */
35 #define CA7RESCNT_CPUS 0xf /* CPU0-3 */
37 /* On-chip RAM */
47 void __iomem *p; in rcar_gen2_pm_init() local
60 if (of_device_is_compatible(np, "arm,cortex-a15")) in rcar_gen2_pm_init()
62 else if (of_device_is_compatible(np, "arm,cortex-a7")) in rcar_gen2_pm_init()
[all …]
|
| /kernel/linux/linux-6.6/arch/arm/mach-shmobile/ |
| D | pm-rcar-gen2.c | 1 // SPDX-License-Identifier: GPL-2.0
3 * R-Car Generation 2 Power management support
5 * Copyright (C) 2013 - 2015 Renesas Electronics Corporation
18 #include "rcar-gen2.h"
33 #define CA15RESCNT_CPUS 0xf /* CPU0-3 */
35 #define CA7RESCNT_CPUS 0xf /* CPU0-3 */
37 /* On-chip RAM */
47 void __iomem *p; in rcar_gen2_pm_init() local
60 if (of_device_is_compatible(np, "arm,cortex-a15")) in rcar_gen2_pm_init()
62 else if (of_device_is_compatible(np, "arm,cortex-a7")) in rcar_gen2_pm_init()
[all …]
|