/linux/arch/x86/crypto/ |
H A D | serpent-sse2-i586-asm_32.S | 1 /* SPDX-License-Identifier: GPL-2.0-or-later */ 3 * Serpent Cipher 4-way parallel algorithm (i586/SSE2) 14 .file "serpent-sse2-i586-asm_32.S" 23 4-way SSE2 serpent 31 #define RE %xmm4 macro 55 psrld $(32 - 13), x4; \ 60 psrld $(32 - 3), x4; \ 65 psrld $(32 - 1), x4; \ 73 psrld $(32 - 7), x4; \ 87 psrld $(32 - 5), x4; \ [all …]
|
H A D | serpent-sse2-x86_64-asm_64.S | 1 /* SPDX-License-Identifier: GPL-2.0-or-later */ 3 * Serpent Cipher 8-way parallel algorithm (x86_64/SSE2) 14 .file "serpent-sse2-x86_64-asm_64.S" 20 8-way SSE2 serpent 394 psrld $(32 - 13), x4 ## 1; \ 399 psrld $(32 - 3), x4 ## 1; \ 404 psrld $(32 - 13), x4 ## 2; \ 409 psrld $(32 - 3), x4 ## 2; \ 414 psrld $(32 - 1), x4 ## 1; \ 424 psrld $(32 - 1), x4 ## 2; \ [all …]
|
H A D | serpent-avx2-asm_64.S | 1 /* SPDX-License-Identifier: GPL-2.0-or-later */ 5 * Copyright © 2012-2013 Jussi Kivilinna <jussi.kivilinna@mbnet.fi> 9 * <Johannes.Goetzfried@informatik.stud.uni-erlangen.de> 14 #include "glue_helper-asm-avx2.S" 16 .file "serpent-avx2-asm_64.S" 386 vpsrld $(32 - 13), x0 ## 1, x0 ## 1; \ 390 vpsrld $(32 - 3), x2 ## 1, x2 ## 1; \ 394 vpsrld $(32 - 13), x0 ## 2, x0 ## 2; \ 398 vpsrld $(32 - 3), x2 ## 2, x2 ## 2; \ 402 vpsrld $(32 - 1), x1 ## 1, x1 ## 1; \ [all …]
|
/linux/arch/arm64/crypto/ |
H A D | sm3-neon-core.S | 1 // SPDX-License-Identifier: GPL-2.0-or-later 3 * sm3-neon-core.S - SM3 secure hash using NEON instructions 45 #define re w7 macro 92 ror o, a, #(32 - n); 148 eor h, t3, t3, ror #(32-9); \ 153 eor h, h, t3, ror #(32-17); /* P0(t3) => h */ 166 /* Byte-swapped input address. */ 172 (STACK_W + ((((round) / 3) - 4) % 2) * 64 + (offs) + ((widx) * 4)) 174 /* Rounds 1-12, byte-swapped input block addresses. */ 178 /* Rounds 1-12, expanded input block addresses. */ [all …]
|
/linux/fs/btrfs/ |
H A D | ref-verify.c | 1 // SPDX-License-Identifier: GPL-2.0 10 #include "disk-io.h" 12 #include "delayed-ref.h" 13 #include "ref-verify.h" 63 * free it until we unmount the file system in order to make sure re-allocations 83 if (entry->bytenr < *bytenr) in block_entry_bytenr_key_cmp() 85 else if (entry->bytenr > *bytenr) in block_entry_bytenr_key_cmp() 86 return -1; in block_entry_bytenr_key_cmp() 95 return block_entry_bytenr_key_cmp(&new_entry->bytenr, existing); in block_entry_bytenr_cmp() 103 node = rb_find_add(&be->node, root, block_entry_bytenr_cmp); in insert_block_entry() [all …]
|
/linux/scripts/ |
H A D | checkstack.pl | 2 # SPDX-License-Identifier: GPL-2.0 9 # s390 port and big speedup by Arnd Bergmann <arnd@bergmann-dalldorf.de> 21 # objdump -d vmlinux | scripts/checkstack.pl [arch] [min_stack] 29 # $re is used for two matches: 30 # $& (whole re) matches the complete objdump line with the stack growth 34 # $& (whole re) matches the complete objdump line with the stack growth 40 my (@stack, $re, $dre, $sub, $x, $xs, $funcre, $min_stack); 44 $arch = `uname -m`; 53 $x = "[0-9a-f]"; # hex character 54 $xs = "[0-9a-f ]"; # hex character or space [all …]
|
H A D | macro_checker.py | 2 # SPDX-License-Identifier: GPL-2.0 9 import re 14 parser.add_argument("-v", "--verbose", action="store_true", 27 match = re.match(macro_pattern, macro_line) 29 macro_def = re.sub(macro_pattern, '', macro_line) 42 if (re.match(fp_pattern, macro_def)): 54 print(f"Argument {arg} is not used in function-line macro {identifier}") 66 macro = re.sub(comment_pattern1, '', macro) 67 macro = re.sub(comment_pattern2, '', macro) 88 cond_compile -= 1 [all …]
|
H A D | checkkconfigsymbols.py | 2 # SPDX-License-Identifier: GPL-2.0-only 6 # (c) 2014-2017 Valentin Rothberg <valentinrothberg@gmail.com> 14 import re 23 SYMBOL = r"(?:\w*[A-Z0-9]\w*){2,}" 31 REGEX_FILE_KCONFIG = re.compile(r".*Kconfig[\.\w+\-]*$") 32 REGEX_SYMBOL = re.compile(r'(?!\B)' + SYMBOL + r'(?!\B)') 33 REGEX_SOURCE_SYMBOL = re.compile(SOURCE_SYMBOL) 34 REGEX_KCONFIG_DEF = re.compile(DEF) 35 REGEX_KCONFIG_EXPR = re.compile(EXPR) 36 REGEX_KCONFIG_STMT = re.compile(STMT) [all …]
|
/linux/scripts/lib/kdoc/ |
H A D | kdoc_re.py | 2 # SPDX-License-Identifier: GPL-2.0 8 Those help caching regular expressions and do matching for kernel-doc. 11 import re 21 It calls re.compile for a given pattern. It also allows adding 30 Adds a new regex or re-use it from the cache. 34 self.regex = re.compile(string, flags=flags) 64 Handles a re [all...] |
H A D | kdoc_parser.py | 2 # SPDX-License-Identifier: GPL-2.0 16 import re 23 # Regular expressions used to parse kernel-doc markups at KernelDoc class. 43 # @{section-name}: 47 known_sections = KernRe(known_section_names, flags = re.I) 50 flags=re.I, cache=False) 57 attribute = KernRe(r"__attribute__\s*\(\([a-z0- [all...] |
/linux/tools/testing/selftests/bpf/ |
H A D | test_bpftool_synctypes.py | 2 # SPDX-License-Identifier: (GPL-2.0-only OR BSD-2-Clause) 7 import re 15 os.path.join(BPFTOOL_DIR, 'bash-completion')) 37 array_start = re.search(start_marker, self.reader.read()) 52 if not line or re.match(end_marker, line): 61 A parser for extracting a set of values from some BPF-related arrays. 65 end_marker = re.compile('^};') 69 self.start_marker = re.compile(fr'(static )?const bool {self.array_name}\[.*\] = {{\n') 83 pattern = re.compile(r'\[(BPF_\w*)\]\s*= (true|false),?$') 87 if line == '' or re.match(self.end_marker, line): [all …]
|
/linux/tools/testing/selftests/tc-testing/plugin-lib/ |
H A D | valgrindPlugin.py | 8 import re 43 for xx in range(index - 1, self.testcount): 44 res = TestResult('{}-mem'.format(self.testidlist[xx]), 'Test skipped') 49 subprocess.check_output('rm -f vgnd-*.log', shell=True) 58 '-V', '--valgrind', action='store_true', 84 cmdlist.insert(0, '--track-origins=yes') 85 cmdlist.insert(0, '--show-leak-kinds=definite,indirect') 86 cmdlist.insert(0, '--leak-check=full') 87 cmdlist.insert(0, '--log-file=vgnd-{}.log'.format(self.args.testid)) 88 cmdlist.insert(0, '-v') # ask for summary of non-leak errors [all …]
|
/linux/drivers/mtd/ubi/ |
H A D | cdev.c | 1 // SPDX-License-Identifier: GPL-2.0-or-later 13 * manipulate whole volumes: create, remove, and re-size them. Volume character 19 * Well, there is the third kind of character devices - the UBI control 20 * character device, which allows to manipulate by UBI devices - create and 33 #include <mtd/ubi-user.h> 37 * get_exclusive - get exclusive access to an UBI volume. 47 struct ubi_volume *vol = desc->vol; in get_exclusive() 49 spin_lock(&vol->ubi->volumes_lock); in get_exclusive() 50 users = vol->readers + vol->writers + vol->exclusive + vol->metaonly; in get_exclusive() 53 ubi_err(vol->ubi, "%d users for volume %d", users, vol->vol_id); in get_exclusive() [all …]
|
/linux/Documentation/process/ |
H A D | management-style.rst | 8 mirror the :ref:`process/coding-style.rst <codingstyle>` document to some 20 budget of your group, you're almost certainly not a kernel manager. 35 ------------ 37 Everybody thinks managers make decisions, and that decision-making is 44 to decide on this", you're in trouble as a manager. The people you 46 you for a technical decision, you're screwed. You're clearly not 50 you, you're also screwed, although for a totally different reason. 55 painful ones. Making small and non-consequential decisions is fine, and 56 makes you look like you know what you're doing, so what a kernel manager 65 **two** inconsequential decisions - the wrong one **and** the right one. [all …]
|
/linux/fs/sysfs/ |
H A D | symlink.c | 1 // SPDX-License-Identifier: GPL-2.0 3 * fs/sysfs/symlink.c - sysfs symlink implementation 5 * Copyright (c) 2001-3 Patrick Mochel 27 return -EINVAL; in sysfs_do_create_link_sd() 35 if (target_kobj->sd) { in sysfs_do_create_link_sd() 36 target = target_kobj->sd; in sysfs_do_create_link_sd() 42 return -ENOENT; in sysfs_do_create_link_sd() 50 if (warn && PTR_ERR(kn) == -EEXIST) in sysfs_do_create_link_sd() 56 * sysfs_create_link_sd - create symlink to a given object. 57 * @kn: directory we're creating the link in. [all …]
|
/linux/arch/mips/math-emu/ |
H A D | sp_maddf.c | 1 // SPDX-License-Identifier: GPL-2.0-only 18 int re; in _sp_maddf() local 105 /* Handle cases +0 + (-0) and similar ones. */ in _sp_maddf() 146 * rm = xm * ym, re = xe + ye basically in _sp_maddf() 151 /* rm = xm * ym, re = xe+ye basically */ in _sp_maddf() 155 re = xe + ye; in _sp_maddf() 166 re++; in _sp_maddf() 177 rm = XSPSRS64(rm64, (62 - 26)); in _sp_maddf() 178 return ieee754sp_format(rs, re, rm); in _sp_maddf() 182 zm64 = (uint64_t)zm << (62 - 23); in _sp_maddf() [all …]
|
H A D | dp_maddf.c | 1 // SPDX-License-Identifier: GPL-2.0-only 28 *lptr = *hptr >> (count - 64); in srl128() 29 *lptr |= (*hptr << (128 - count)) != 0 || low != 0; in srl128() 34 *lptr = low >> count | *hptr << (64 - count); in srl128() 35 *lptr |= (low << (64 - count)) != 0; in srl128() 43 int re; in _dp_maddf() local 136 /* Handle cases +0 + (-0) and similar ones. */ in _dp_maddf() 177 * rm = xm * ym, re = xe + ye basically in _dp_maddf() 184 re = xe + ye; in _dp_maddf() 187 xm <<= 64 - (DP_FBITS + 1); in _dp_maddf() [all …]
|
/linux/include/uapi/mtd/ |
H A D | ubi-user.h | 1 /* SPDX-License-Identifier: GPL-2.0+ WITH Linux-syscall-note */ 17 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA 33 * &struct ubi_attach_req object - UBI will attach the MTD device specified in 54 * device should be used. A pointer to the 32-bit volume ID hast to be passed 57 * UBI volume re-size 60 * To re-size a volume, the %UBI_IOCRSVOL ioctl command of the UBI character 64 * UBI volumes re-name 67 * To re-name several volumes atomically at one go, the %UBI_IOCRNVOL command 75 * corresponding UBI volume character device. A pointer to a 64-bit update 109 * a physical eraseblock and returns. Only non-mapped logical eraseblocks can [all …]
|
/linux/Documentation/bpf/ |
H A D | llvm_reloc.rst | 1 .. SPDX-License-Identifier: (LGPL-2.1 OR BSD-2-Clause) 12 LLVM BPF backend records each relocation with the following 16-byte 31 Compiled with ``clang --target=bpf -O2 -c test.c``, the following is 32 the code with ``llvm-objdump -dr test.o``:: 52 The following ``llvm-readelf -r test.o`` shows the binary values of the four 66 The following is the symbol table with ``llvm-readelf -s test.o``:: 100 section offset for static variables/functions. The non-section-offset 115 10 R_BPF_64_32 call insn 32 r_offset + 4 (S + A) / 8 - 1 118 The actual to-be-relocated data (0 or section offset) 125 In another case, ``R_BPF_64_ABS64`` relocation type is used for normal 64-bit data. [all …]
|
/linux/arch/mips/mm/ |
H A D | uasm-mips.c | 6 * A small micro-assembler. It is intentionally kept simple, does only 12 * Copyright (C) 2006 Ralf Baechle (ralf@linux-mips.org) 31 /* This macro sets the non-variable bits of an instruction. */ 40 /* This macro sets the non-variable bits of an R6 instruction. */ 73 [insn_cfcmsa] = {M(msa_op, 0, msa_cfc_op, 0, 0, msa_elm_op), RD | RE}, 75 [insn_ctcmsa] = {M(msa_op, 0, msa_ctc_op, 0, 0, msa_elm_op), RD | RE}, 82 [insn_dins] = {M(spec3_op, 0, 0, 0, 0, dins_op), RS | RT | RD | RE}, 83 [insn_dinsm] = {M(spec3_op, 0, 0, 0, 0, dinsm_op), RS | RT | RD | RE}, 84 [insn_dinsu] = {M(spec3_op, 0, 0, 0, 0, dinsu_op), RS | RT | RD | RE}, 95 [insn_drotr] = {M(spec_op, 1, 0, 0, 0, dsrl_op), RT | RD | RE}, [all …]
|
/linux/Documentation/userspace-api/media/mediactl/ |
H A D | media-request-ioc-reinit.rst | 1 .. SPDX-License-Identifier: GPL-2.0 OR GFDL-1.1-no-invariants-or-later 13 MEDIA_REQUEST_IOC_REINIT - Re-initialize a request 31 If the media device supports :ref:`requests <media-request-api>`, then 32 this request ioctl can be used to re-initialize a previously allocated 35 Re-initializing a request will clear any existing data from the request. 38 be re-initialized and it is ready to be used again. 40 A request can only be re-initialized if it either has not been queued 47 On success 0 is returned, on error -1 and the ``errno`` variable is set
|
/linux/lib/crypto/powerpc/ |
H A D | sha1-powerpc-asm.S | 1 /* SPDX-License-Identifier: GPL-2.0 */ 3 * SHA-1 implementation for PowerPC. 9 #include <asm/asm-offsets.h> 10 #include <asm/asm-compat.h> 24 * We use registers 7 - 12 for this. 31 #define RE(t) ((((t)+0)%6)+7) macro 33 /* We use registers 16 - 31 for the W values */ 44 add r0,RE(t),r15; \ 57 add r0,RE(t),r15; \ 58 xor r5,W((t)+4-3),W((t)+4-8); \ [all …]
|
/linux/lib/ |
H A D | klist.c | 1 // SPDX-License-Identifier: GPL-2.0-only 3 * klist.c - Routines for manipulating klists. 20 * It works using a 3rd object type - struct klist_iter - that is declared 50 ((unsigned long)knode->n_klist & KNODE_KLIST_MASK); in knode_klist() 55 return (unsigned long)knode->n_klist & KNODE_DEAD; in knode_dead() 60 knode->n_klist = klist; in knode_set_klist() 67 /* and no knode should die twice ever either, see we're very humane */ in knode_kill() 69 *(unsigned long *)&knode->n_klist |= KNODE_DEAD; in knode_kill() 73 * klist_init - Initialize a klist structure. 74 * @k: The klist we're initializing. [all …]
|
/linux/scripts/dtc/ |
H A D | dt-extract-compatibles | 2 # SPDX-License-Identifier: GPL-2.0-only 6 import re 18 for m in re.finditer(re_macros, data): 20 compat = re.search(r'"(.*?)"', m[0])[1] 32 for m in re.finditer(r'of_device_id(\s+\S+)?\s+(\S+)\[\](\s+\S+)?\s*=\s*({.*?);', data): 35 compat_list += re.findall(r'\.compatible\s+=\s+"(\S+)"', m[4]) 43 for m in re.finditer(r'\.of_match_table\s+=\s+(of_match_ptr\()?([a-zA-Z0-9_-]+)', data): 52 for m in re.finditer(rf'{func_name}\(([a-zA-Z0-9_>\(\)"\-]+,\s)*"([a-zA-Z0-9_,-]+)"\)', data): 59 with open(file, 'r', encoding='utf-8') as f: 80 with open(file, 'r', encoding='utf-8') as f: [all …]
|
/linux/Documentation/filesystems/bcachefs/ |
H A D | CodingStyle.rst | 1 .. SPDX-License-Identifier: GPL-2.0 11 Things don't always have to be perfect - nitpicking often does more harm than 12 good. But appreciate beauty when you see it - and let people know. 26 you're not sure if it can happen and not sure how to handle it yet - make it a 32 are logically impossible. (Or, make them debug mode assertions if they're 33 expensive - but don't turn everything into a debug mode assertion, so that 34 we're not stuck debugging undefined behaviour should it turn out that you were 52 elide - if we were working in a language with embedded correctness proofs that 56 invariants with runtime checks - much like the way people working in 60 Looking for ways to make your assertions simpler - and higher level - will [all …]
|