Home
last modified time | relevance | path

Searched +full:p +full:- +full:256 (Results 1 – 25 of 1038) sorted by relevance

12345678910>>...42

/linux/lib/raid6/
H A Drecov_s390xc.c1 // SPDX-License-Identifier: GPL-2.0
3 * RAID-6 data recovery in dual failure mode based on the XC instruction.
13 typedef struct { u8 _[256]; } addrtype; in xor_block()
16 " xc 0(256,%[p1]),0(%[p2])\n" in xor_block()
25 u8 *p, *q, *dp, *dq; in raid6_2data_recov_s390xc() local
26 const u8 *pbmul; /* P multiplier table for B data */ in raid6_2data_recov_s390xc()
30 p = (u8 *)ptrs[disks-2]; in raid6_2data_recov_s390xc()
31 q = (u8 *)ptrs[disks-1]; in raid6_2data_recov_s390xc()
35 delta p and delta q */ in raid6_2data_recov_s390xc()
38 ptrs[disks-2] = dp; in raid6_2data_recov_s390xc()
[all …]
/linux/crypto/
H A Decrdsa_defs.h1 /* 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 */
50 .nbits = 256,
54 .ndigits = 256 / 64,
[all …]
H A Decc_curve_defs.h1 /* SPDX-License-Identifier: GPL-2.0 */
5 /* NIST P-192: a = p - 3 */
26 .p = nist_p192_p,
32 /* NIST P-256: a = p - 3 */
47 .nbits = 256,
53 .p = nist_p256_p,
59 /* NIST P-384 */
86 .p = nist_p384_p,
92 /* NIST P-521 */
131 .p = nist_p521_p,
[all …]
H A DKconfig1 # SPDX-License-Identifier: GPL-2.0
156 cbc(aes), and the support for the crypto self-tests.
178 bool "Enable cryptographic self-tests"
181 Enable the cryptographic self-tests.
183 The cryptographic self-tests run at boot time, or at algorithm
188 - Development and pre-release testing. In this case, also enable
192 - Production kernels, to help prevent buggy drivers from being used
193 and/or meet FIPS 140-3 pre-operational testing requirements. In
197 bool "Enable the full set of cryptographic self-tests"
200 Enable the full set of cryptographic self-tests for each algorithm.
[all …]
/linux/net/sunrpc/auth_gss/
H A Dgss_krb5_mech.c1 // 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 …]
/linux/tools/testing/selftests/tc-testing/tc-tests/qdiscs/
H A Dfq_codel.json17 …"matchPattern": "qdisc fq_codel 1: root refcnt [0-9]+ limit 10240p flows 1024 quantum.*target 5ms …
38 …"matchPattern": "qdisc fq_codel 1: root refcnt [0-9]+ limit 1000p flows 1024 quantum.*target 5ms i…
59 …"matchPattern": "qdisc fq_codel 1: root refcnt [0-9]+ limit 10240p flows 1024 quantum.*target 5ms …
80 …"matchPattern": "qdisc fq_codel 1: root refcnt [0-9]+ limit 10240p flows 1024 quantum.*target 2ms …
101 …"matchPattern": "qdisc fq_codel 1: root refcnt [0-9]+ limit 10240p flows 1024 quantum.*target 5ms …
122 …"matchPattern": "qdisc fq_codel 1: root refcnt [0-9]+ limit 10240p flows 1024 quantum 9000 target …
143 …"matchPattern": "qdisc fq_codel 1: root refcnt [0-9]+ limit 10240p flows 1024 quantum.*target 5ms …
164 …"matchPattern": "qdisc fq_codel 1: root refcnt [0-9]+ limit 10240p flows 1024 quantum.*target 5ms …
185 …"matchPattern": "qdisc fq_codel 1: root refcnt [0-9]+ limit 10240p flows 1024 quantum.*target 5ms …
203 …"cmdUnderTest": "$TC qdisc add dev $DUMMY handle 1: root fq_codel limit 1000 flows 256 drop_batch …
[all …]
/linux/fs/jffs2/
H A Dcompr_rubin.c2 * 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 …]
/linux/Documentation/userspace-api/media/rc/
H A Dkeytable.c.rst1 .. 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 …]
/linux/drivers/isdn/mISDN/
H A Ddsp_audio.c20 /* 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 …]
/linux/tools/testing/selftests/net/
H A Dtfo_passive.sh2 # SPDX-License-Identifier: GPL-2.0
5 NSIM_SV_ID=$((256 + RANDOM % 256))
7 NSIM_CL_ID=$((512 + RANDOM % 256))
21 set -e
25 NSIM_SV_NAME=$(find $NSIM_SV_SYS/net -maxdepth 1 -type d ! \
26 -pat
[all...]
/linux/drivers/tty/vt/
H A Dconmakehash.c1 // 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 …]
/linux/scripts/mod/
H A Dfile2alias.c5 * Copyright 2002-2003 Rusty Russell, IBM Corporation
20 #include "devicetable-offsets.h"
41 * module_alias_printf - add auto-generated MODULE_ALIAS()
45 * @fmt: printf(3)-like format
75 n = vsnprintf(new->str, len, fmt, ap); in module_alias_printf()
84 if (append_wildcard && (n == 0 || new->str[n - 1] != '*')) { in module_alias_printf()
85 new->str[n] = '*'; in module_alias_printf()
86 new->st in module_alias_printf()
1007 char *p = *outp; append_nibble_mask() local
1050 char *p = alias; do_amba_entry() local
1511 const struct devtable *p = &amp;devtable[i]; handle_moddevtable() local
[all...]
/linux/arch/riscv/crypto/
H A Daes-riscv64-zvkned.S1 /* SPDX-License-Identifier: Apache-2.0 OR BSD-2-Clause */
3 // This file is dual-licensed, meaning that you can use it under your
41 // The generated code of this file depends on the following RISC-V extensions:
42 // - RV64I
43 // - RISC-V Vector ('V') with VLEN >= 128
44 // - RISC-V Vector AES block cipher extension ('Zvkned')
51 #include "aes-macros.S"
68 __aes_crypt_zvkned \enc, 256
88 // t0 is the remaining length in 32-bit words. It's a multiple of 4.
105 __aes_ecb_crypt \enc, 256
[all …]
/linux/drivers/clk/sunxi/
H A Dclk-sun9i-core.c1 // SPDX-License-Identifier: GPL-2.0-or-later
3 * Copyright 2014 Chen-Yu Tsai
5 * Chen-Yu Tsai <wens@csie.org>
9 #include <linux/clk-provider.h>
14 #include "clk-factors.h"
18 * sun9i_a80_get_pll4_factors() - calculates n, p, m factors for PLL4
20 * rate = (parent_rate * n >> p) / (m + 1);
23 * p and m are named div1 and div2 in Allwinner's SDK
30 int p = 1; in sun9i_a80_get_pll4_factors() local
33 n = DIV_ROUND_UP(req->rate, 6000000); in sun9i_a80_get_pll4_factors()
[all …]
/linux/fs/hpfs/
H A Dmap.c1 // SPDX-License-Identifier: GPL-2.0
5 * Mikulas Patocka (mikulas@artax.karlin.mff.cuni.cz), 1998-1999
14 return hpfs_map_4sectors(s, hpfs_sb(s)->sb_dmap, qbh, 0); in hpfs_map_dnode_bitmap()
22 unsigned n_bands = (hpfs_sb(s)->sb_fs_size + 0x3fff) >> 14; in hpfs_map_bitmap()
23 if (hpfs_sb(s)->sb_chk) if (bmp_block >= n_bands) { in hpfs_map_bitmap()
27 sec = le32_to_cpu(hpfs_sb(s)->sb_bmp_dir[bmp_block]); in hpfs_map_bitmap()
28 if (!sec || sec > hpfs_sb(s)->sb_fs_size-4) { in hpfs_map_bitmap()
29 hpfs_error(s, "invalid bitmap block pointer %08x -> %08x at %s", bmp_block, sec, id); in hpfs_map_bitmap()
40 unsigned n_bands = (hpfs_sb(s)->sb_fs_size + 0x3fff) >> 14; in hpfs_prefetch_bitmap()
43 to_prefetch = le32_to_cpu(hpfs_sb(s)->sb_bmp_dir[bmp_block]); in hpfs_prefetch_bitmap()
[all …]
/linux/tools/testing/selftests/net/netfilter/
H A Dnft_concat_range.sh2 # SPDX-License-Identifier: GPL-2.0
4 # nft_concat_range.sh - Tests for sets with concatenation of ranged fields
16 # - reported_issues: check for issues that were reported in the past
17 # - correctness: check that packets match given entries, and only those
18 # - correctness_large: same but with additional non-matching entries
19 # - concurrency: attempt races between insertion, deletion and lookup
20 # - timeou
[all...]
/linux/drivers/watchdog/
H A Dat91rm9200_wdt.c1 // SPDX-License-Identifier: GPL-2.0+
19 #include <linux/mfd/syscon/atmel-st.h>
32 #define WDT_MAX_TIME 256 /* seconds */
109 return -EBUSY; in at91_wdt_open()
136 * All counting occurs at SLOW_CLOCK / 128 = 256 Hz in at91_wdt_settimeout()
138 * Since WDV is a 16-bit counter, the maximum period is in at91_wdt_settimeout()
139 * 65536 / 256 = 256 seconds. in at91_wdt_settimeout()
142 return -EINVAL; in at91_wdt_settimeout()
156 * Handle commands from user-space.
162 int __user *p = argp; in at91_wdt_ioctl() local
[all …]
/linux/mm/
H A Ddmapool_test.c2 #include <linux/dma-map-ops.h>
3 #include <linux/dma-mapping.h>
25 { .size = 256, .align = 256, .boundary = 0 },
40 static int dmapool_test_alloc(struct dma_pool_pair *p, int blocks) in dmapool_test_alloc() argument
45 p[i].v = dma_pool_alloc(pool, GFP_KERNEL, in dmapool_test_alloc()
46 &p[i].dma); in dmapool_test_alloc()
47 if (!p[i].v) in dmapool_test_alloc()
52 dma_pool_free(pool, p[i].v, p[i].dma); in dmapool_test_alloc()
57 for (--i; i >= 0; i--) in dmapool_test_alloc()
58 dma_pool_free(pool, p[i].v, p[i].dma); in dmapool_test_alloc()
[all …]
/linux/arch/x86/mm/
H A Dtestmmiotrace.c1 // SPDX-License-Identifier: GPL-2.0-only
3 * Written by Pekka Paalanen, 2008-2009 <pq@iki.fi>
16 "(or 8 MB if read_far is non-zero).");
20 MODULE_PARM_DESC(read_far, " Offset of a 32-bit read within 8 MB "
33 static void do_write_test(void __iomem *p) in do_write_test() argument
39 for (i = 0; i < 256; i++) in do_write_test()
40 iowrite8(i, p + i); in do_write_test()
43 iowrite16(v16(i), p + i); in do_write_test()
46 iowrite32(v32(i), p + i); in do_write_test()
49 static void do_read_test(void __iomem *p) in do_read_test() argument
[all …]
/linux/drivers/media/dvb-frontends/
H A Dstv0367.c1 // SPDX-License-Identifier: GPL-2.0-or-later
5 * Driver for ST STV0367 DVB-T & DVB-C demodulator IC.
39 /* DVB-C */
58 /* DVB-T */
84 /* DVB-C */
86 /* DVB-T */
98 /* RF Level (for RF AGC->AGC1) Lookup Table, depends on the board and tuner.*/
110 /* RF Level (for IF AGC->AGC2) Lookup Table, depends on the board and tuner.*/
126 .addr = state->config->demod_address, in stv0367_writereg()
135 state->config->demod_address, reg, data); in stv0367_writereg()
[all …]
/linux/tools/perf/ui/browsers/
H A Dscripts.c1 // SPDX-License-Identifier: GPL-2.0
15 #include <subcmd/exec-cmd.h>
22 * /home/username/libexec/perf-core/scripts/python/xxx.py
23 * /home/username/libexec/perf-core/scripts/perl/xxx.pl
24 * So 256 should be long enough to contain the full path.
26 #define SCRIPT_FULLPATH_LEN 256
33 char extra_format[256];
39 if (attr->read_format & PERF_FORMAT_GROUP) in attr_to_script()
40 strcat(extra_format, " -F +metric"); in attr_to_script()
41 if (attr->sample_type & PERF_SAMPLE_BRANCH_STACK) in attr_to_script()
[all …]
/linux/lib/crc/
H A Dcrc64-main.c1 // SPDX-License-Identifier: GPL-2.0
3 * Normal 64-bit CRC calculation.
5 * This is a basic crc64 implementation following ECMA-182 specification,
7 * https://www.ecma-international.org/publications/standards/Ecma-182.htm
10 * algorithm, here the CRC64 code is also inspired by the table-driven
15 * crc64table[256] is the lookup table of a table-driven 64-bit CRC
17 * time. The polynomial of crc64 arithmetic is from ECMA-182 specification
25 * crc64nvmetable[256] uses the CRC64 polynomial from the NVME NVM Command Set
26 * Specification and uses least-significant-bit first bit order:
44 crc64_be_generic(u64 crc, const u8 *p, size_t len) in crc64_be_generic() argument
[all …]
/linux/lib/crypto/
H A Dgf128mul.c1 /* gf128mul.c - GF(2^128) multiplication functions
17 ---------------------------------------------------------------------------
44 ---------------------------------------------------------------------------
95 * 16-bit value that must be XOR-ed into the low-degree end of the
99 * the "be" convention where the highest-order bit is the coefficient of
100 * the highest-degree polynomial term, and one for the "le" convention
101 * where the highest-order bit is the coefficient of the lowest-degree
130 static const u16 gf128mul_table_le[256] = gf128mul_dat(xda_le);
131 static const u16 gf128mul_table_be[256] = gf128mul_dat(xda_be);
135 * the polynomial field representation. They use 64-bit word operations
[all …]
/linux/arch/arm/mach-tegra/
H A Diomap.h1 /* SPDX-License-Identifier: GPL-2.0-only */
47 #define TEGRA_SB_SIZE 256
89 * two 256MB io windows (that actually only use about 64KB
113 #define IO_TO_VIRT_BETWEEN(p, st, sz) ((p) >= (st) && (p) < ((st) + (sz))) argument
114 #define IO_TO_VIRT_XLATE(p, pst, vst) (((p) - (pst) + (vst))) argument
/linux/drivers/s390/char/
H A Dkeyboard.c1 // SPDX-License-Identifier: GPL-2.0
38 255, ARRAY_SIZE(func_table) - 1, NR_FN_HANDLER - 1, 0,
39 NR_DEAD - 1, 0, 0, 0, 0, 0, 0, 0, 0, 0
63 '-', /* dead_stroke */
84 kbd->key_maps = kzalloc(sizeof(ebc_key_maps), GFP_KERNEL); in kbd_alloc()
85 if (!kbd->key_maps) in kbd_alloc()
89 kbd->key_maps[i] = kmemdup(ebc_key_maps[i], in kbd_alloc()
92 if (!kbd->key_maps[i]) in kbd_alloc()
96 kbd->func_table = kzalloc(sizeof(ebc_func_table), GFP_KERNEL); in kbd_alloc()
97 if (!kbd->func_table) in kbd_alloc()
[all …]

12345678910>>...42