/Linux-v6.1/arch/x86/crypto/ |
D | serpent-sse2-i586-asm_32.S | 31 #define RE %xmm4 macro 513 read_blocks(%eax, RA, RB, RC, RD, RT0, RT1, RE); 515 K(RA, RB, RC, RD, RE, 0); 516 S0(RA, RB, RC, RD, RE); LK(RC, RB, RD, RA, RE, 1); 517 S1(RC, RB, RD, RA, RE); LK(RE, RD, RA, RC, RB, 2); 518 S2(RE, RD, RA, RC, RB); LK(RB, RD, RE, RC, RA, 3); 519 S3(RB, RD, RE, RC, RA); LK(RC, RA, RD, RB, RE, 4); 520 S4(RC, RA, RD, RB, RE); LK(RA, RD, RB, RE, RC, 5); 521 S5(RA, RD, RB, RE, RC); LK(RC, RA, RD, RE, RB, 6); 522 S6(RC, RA, RD, RE, RB); LK(RD, RB, RA, RE, RC, 7); [all …]
|
D | serpent-sse2-x86_64-asm_64.S | 636 K2(RA, RB, RC, RD, RE, 0); 637 S(S0, RA, RB, RC, RD, RE); LK2(RC, RB, RD, RA, RE, 1); 638 S(S1, RC, RB, RD, RA, RE); LK2(RE, RD, RA, RC, RB, 2); 639 S(S2, RE, RD, RA, RC, RB); LK2(RB, RD, RE, RC, RA, 3); 640 S(S3, RB, RD, RE, RC, RA); LK2(RC, RA, RD, RB, RE, 4); 641 S(S4, RC, RA, RD, RB, RE); LK2(RA, RD, RB, RE, RC, 5); 642 S(S5, RA, RD, RB, RE, RC); LK2(RC, RA, RD, RE, RB, 6); 643 S(S6, RC, RA, RD, RE, RB); LK2(RD, RB, RA, RE, RC, 7); 644 S(S7, RD, RB, RA, RE, RC); LK2(RC, RA, RE, RD, RB, 8); 645 S(S0, RC, RA, RE, RD, RB); LK2(RE, RA, RD, RC, RB, 9); [all …]
|
D | serpent-avx2-asm_64.S | 567 K2(RA, RB, RC, RD, RE, 0); 568 S(S0, RA, RB, RC, RD, RE); LK2(RC, RB, RD, RA, RE, 1); 569 S(S1, RC, RB, RD, RA, RE); LK2(RE, RD, RA, RC, RB, 2); 570 S(S2, RE, RD, RA, RC, RB); LK2(RB, RD, RE, RC, RA, 3); 571 S(S3, RB, RD, RE, RC, RA); LK2(RC, RA, RD, RB, RE, 4); 572 S(S4, RC, RA, RD, RB, RE); LK2(RA, RD, RB, RE, RC, 5); 573 S(S5, RA, RD, RB, RE, RC); LK2(RC, RA, RD, RE, RB, 6); 574 S(S6, RC, RA, RD, RE, RB); LK2(RD, RB, RA, RE, RC, 7); 575 S(S7, RD, RB, RA, RE, RC); LK2(RC, RA, RE, RD, RB, 8); 576 S(S0, RC, RA, RE, RD, RB); LK2(RE, RA, RD, RC, RB, 9); [all …]
|
D | serpent-avx-x86_64-asm_64.S | 567 K2(RA, RB, RC, RD, RE, 0); 568 S(S0, RA, RB, RC, RD, RE); LK2(RC, RB, RD, RA, RE, 1); 569 S(S1, RC, RB, RD, RA, RE); LK2(RE, RD, RA, RC, RB, 2); 570 S(S2, RE, RD, RA, RC, RB); LK2(RB, RD, RE, RC, RA, 3); 571 S(S3, RB, RD, RE, RC, RA); LK2(RC, RA, RD, RB, RE, 4); 572 S(S4, RC, RA, RD, RB, RE); LK2(RA, RD, RB, RE, RC, 5); 573 S(S5, RA, RD, RB, RE, RC); LK2(RC, RA, RD, RE, RB, 6); 574 S(S6, RC, RA, RD, RE, RB); LK2(RD, RB, RA, RE, RC, 7); 575 S(S7, RD, RB, RA, RE, RC); LK2(RC, RA, RE, RD, RB, 8); 576 S(S0, RC, RA, RE, RD, RB); LK2(RE, RA, RD, RC, RB, 9); [all …]
|
/Linux-v6.1/fs/btrfs/ |
D | ref-verify.c | 60 * free it until we unmount the file system in order to make sure re-allocations 117 struct root_entry *re) in insert_root_entry() argument 126 if (entry->root_objectid > re->root_objectid) in insert_root_entry() 128 else if (entry->root_objectid < re->root_objectid) in insert_root_entry() 134 rb_link_node(&re->node, parent_node, p); in insert_root_entry() 135 rb_insert_color(&re->node, root); in insert_root_entry() 234 struct root_entry *re; in free_block_entry() local 240 re = rb_entry(n, struct root_entry, node); in free_block_entry() 241 rb_erase(&re->node, &be->roots); in free_block_entry() 242 kfree(re); in free_block_entry() [all …]
|
/Linux-v6.1/tools/testing/selftests/tc-testing/plugin-lib/ |
D | valgrindPlugin.py | 8 import re 113 self.definitely_lost_re = re.compile( 114 … r'definitely lost:\s+([,0-9]+)\s+bytes in\s+([,0-9]+)\sblocks', re.MULTILINE | re.DOTALL) 115 self.indirectly_lost_re = re.compile( 116 … r'indirectly lost:\s+([,0-9]+)\s+bytes in\s+([,0-9]+)\s+blocks', re.MULTILINE | re.DOTALL) 117 self.possibly_lost_re = re.compile( 118 r'possibly lost:\s+([,0-9]+)bytes in\s+([,0-9]+)\s+blocks', re.MULTILINE | re.DOTALL) 119 self.non_leak_error_re = re.compile( 120 … r'ERROR SUMMARY:\s+([,0-9]+) errors from\s+([,0-9]+)\s+contexts', re.MULTILINE | re.DOTALL)
|
/Linux-v6.1/scripts/ |
D | checkstack.pl | 30 # $re is used for two matches: 31 # $& (whole re) matches the complete objdump line with the stack growth 35 # $& (whole re) matches the complete objdump line with the stack growth 41 my (@stack, $re, $dre, $sub, $x, $xs, $funcre, $min_stack); 60 $re = qr/^.*stp.*sp, \#-([0-9]{1,8})\]\!/o; 64 $re = qr/.*sub.*sp, sp, #([0-9]{1,4})/o; 70 $re = qr/^.*[as][du][db] \$(0x$x{1,8}),\%(e|r)sp$/o; 74 $re = qr/.*adds.*r12=-(([0-9]{2}|[3-9])[0-9]{2}),r12/o; 78 $re = qr/.*(?:linkw %fp,|addaw )#-([0-9]{1,4})(?:,%sp)?$/o; 81 $re = qr/.*daddiu.*sp,sp,-(([0-9]{2}|[3-9])[0-9]{2})/o; [all …]
|
D | checkkconfigsymbols.py | 14 import re 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) 37 REGEX_FILTER_SYMBOLS = re.compile(r"[A-Za-z0-9]$") 38 REGEX_NUMERIC = re.compile(r"0[xX][0-9a-fA-F]+|[0-9]+") 39 REGEX_QUOTES = re.compile("(\"(.*?)\")") [all …]
|
/Linux-v6.1/tools/testing/selftests/bpf/ |
D | test_bpftool_synctypes.py | 7 import re 37 array_start = re.search(start_marker, self.reader.read()) 52 if not line or re.match(end_marker, line): 65 end_marker = re.compile('^};') 69 self.start_marker = re.compile(f'(static )?const bool {self.array_name}\[.*\] = {{\n') 83 pattern = re.compile('\[(BPF_\w*)\]\s*= (true|false),?$') 87 if line == '' or re.match(self.end_marker, line): 111 if re.search(end_marker, line): 180 start_marker = re.compile(f'enum {enum_name} {{\n') 181 pattern = re.compile('^\s*(BPF_\w+),?(\s+/\*.*\*/)?$') [all …]
|
/Linux-v6.1/fs/f2fs/ |
D | extent_cache.c | 34 struct rb_entry *re; in __lookup_rb_tree_slow() local 37 re = rb_entry(node, struct rb_entry, rb_node); in __lookup_rb_tree_slow() 39 if (ofs < re->ofs) in __lookup_rb_tree_slow() 41 else if (ofs >= re->ofs + re->len) in __lookup_rb_tree_slow() 44 return re; in __lookup_rb_tree_slow() 52 struct rb_entry *re; in f2fs_lookup_rb_tree() local 54 re = __lookup_rb_tree_fast(cached_re, ofs); in f2fs_lookup_rb_tree() 55 if (!re) in f2fs_lookup_rb_tree() 58 return re; in f2fs_lookup_rb_tree() 67 struct rb_entry *re; in f2fs_lookup_rb_tree_ext() local [all …]
|
/Linux-v6.1/drivers/mtd/ubi/ |
D | cdev.c | 13 * manipulate whole volumes: create, remove, and re-size them. Volume character 651 * verify_rsvol_req - verify volume re-size request. 672 * @req: volumes re-name request 674 * This is a helper function for the volume re-name IOCTL which validates the 684 struct ubi_rename_entry *re, *re1; in rename_volumes() local 723 /* Create the re-name list */ in rename_volumes() 730 re = kzalloc(sizeof(struct ubi_rename_entry), GFP_KERNEL); in rename_volumes() 731 if (!re) { in rename_volumes() 736 re->desc = ubi_open_volume(ubi->ubi_num, vol_id, UBI_METAONLY); in rename_volumes() 737 if (IS_ERR(re->desc)) { in rename_volumes() [all …]
|
/Linux-v6.1/Documentation/process/ |
D | management-style.rst | 20 budget of your group, you're almost certainly not a kernel manager. 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. 56 makes you look like you know what you're doing, so what a kernel manager 77 fairly easy to backtrack. Since you're not going to be able to waste 81 incompetent nincompoop, say you're sorry, and undo all the worthless 160 "you're a d*ckhead" in millions of different ways [#f2]_, sometimes without 179 frankly, "A Million Ways to Tell a Developer They're a D*ckhead" doesn't 188 knowledge that we're better than the average person (let's face it, [all …]
|
/Linux-v6.1/Documentation/sphinx/ |
D | automarkup.py | 15 import re 19 # Python 2 lacks re.ASCII... 22 ascii_p3 = re.ASCII 33 RE_function = re.compile(r'\b(([a-zA-Z_]\w+)\(\))', flags=ascii_p3) 38 RE_generic_type = re.compile(r'\b(struct|union|enum|typedef)\s+([a-zA-Z_]\w+)', 45 RE_struct = re.compile(r'\b(struct)\s+([a-zA-Z_]\w+)', flags=ascii_p3) 46 RE_union = re.compile(r'\b(union)\s+([a-zA-Z_]\w+)', flags=ascii_p3) 47 RE_enum = re.compile(r'\b(enum)\s+([a-zA-Z_]\w+)', flags=ascii_p3) 48 RE_typedef = re.compile(r'\b(typedef)\s+([a-zA-Z_]\w+)', flags=ascii_p3) 54 RE_doc = re.compile(r'(\bDocumentation/)?((\.\./)*[\w\-/]+)\.(rst|txt)') [all …]
|
D | maintainers_include.py | 21 import re 73 if re.search('^[A-Z0-9]', line): 81 m = re.search(pat, line) 84 line = re.sub(pat, ':doc:`%s <../%s>`' % (m.group(2), m.group(2)), line) 93 m = re.search("\s(\S):\s", line) 97 m = re.search("\*([^\*]+)\*", line) 115 heading = re.sub("\s+", " ", line) 146 # Re-split on any added newlines in any above parsing.
|
/Linux-v6.1/fs/sysfs/ |
D | symlink.c | 57 * @kn: directory we're creating the link in. 58 * @target: object we're pointing to. 85 * @kobj: object whose directory we're creating the link in. 86 * @target: object we're pointing to. 98 * @kobj: object whose directory we're creating the link in. 99 * @target: object we're pointing to. 114 * @kobj: object we're acting for. 115 * @targ: object we're pointing to. 140 * @kobj: object we're acting for. 158 * @kobj: object we're acting for. [all …]
|
/Linux-v6.1/arch/mips/math-emu/ |
D | sp_maddf.c | 18 int re; in _sp_maddf() local 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() 178 return ieee754sp_format(rs, re, rm); in _sp_maddf() 186 if (ze > re) { in _sp_maddf() 190 s = ze - re; in _sp_maddf() 192 re += s; in _sp_maddf() 193 } else if (re > ze) { in _sp_maddf() [all …]
|
D | dp_maddf.c | 43 int re; in _dp_maddf() local 177 * rm = xm * ym, re = xe + ye basically in _dp_maddf() 184 re = xe + ye; in _dp_maddf() 222 re++; in _dp_maddf() 234 return ieee754dp_format(rs, re, lrm); in _dp_maddf() 243 if (ze > re) { in _dp_maddf() 247 s = ze - re; in _dp_maddf() 249 re += s; in _dp_maddf() 250 } else if (re > ze) { in _dp_maddf() 254 s = re - ze; in _dp_maddf() [all …]
|
/Linux-v6.1/include/uapi/mtd/ |
D | ubi-user.h | 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 169 /* Re-size an UBI volume */ 171 /* Re-name volumes */ 218 /* Maximum amount of UBI volumes that can be re-named at one go */ 356 * struct ubi_rsvol_req - a data structure used in volume re-size requests. 357 * @vol_id: ID of the volume to re-size 360 * Re-sizing is possible for both dynamic and static volumes. But while dynamic [all …]
|
/Linux-v6.1/arch/mips/mm/ |
D | uasm-mips.c | 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}, 96 [insn_drotr32] = {M(spec_op, 1, 0, 0, 0, dsrl32_op), RT | RD | RE}, 99 [insn_dsll] = {M(spec_op, 0, 0, 0, 0, dsll_op), RT | RD | RE}, 100 [insn_dsll32] = {M(spec_op, 0, 0, 0, 0, dsll32_op), RT | RD | RE}, 102 [insn_dsra] = {M(spec_op, 0, 0, 0, 0, dsra_op), RT | RD | RE}, [all …]
|
/Linux-v6.1/Documentation/userspace-api/media/mediactl/ |
D | media-request-ioc-reinit.rst | 13 MEDIA_REQUEST_IOC_REINIT - Re-initialize a request 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
|
/Linux-v6.1/arch/powerpc/crypto/ |
D | sha1-powerpc-asm.S | 31 #define RE(t) ((((t)+0)%6)+7) macro 44 add r0,RE(t),r15; \ 57 add r0,RE(t),r15; \ 71 add r0,RE(t),r15; \ 81 add r0,RE(t),r15; \ 100 add r0,RE(t),r15; \ 135 lwz RE(0),16(r3) /* E */ 174 add r20,RE(80),r20 179 mr RE(0),r20 184 stw RE(0),16(r3)
|
/Linux-v6.1/lib/ |
D | klist.c | 67 /* and no knode should die twice ever either, see we're very humane */ in knode_kill() 74 * @k: The klist we're initializing. 119 * @n: node we're adding. 131 * @n: node we're adding. 143 * @n: node we're adding. 159 * @n: node we're adding. 226 * @n: node we're deleting. 236 * @n: node we're removing. 263 * @n: Node that we're testing. 273 * @k: klist we're iterating. [all …]
|
/Linux-v6.1/scripts/dtc/ |
D | dt-extract-compatibles | 6 import re 14 for m in re.finditer(r'(?<!CPU_METHOD_)(IRQCHIP|OF)_(DECLARE|MATCH)(_DRIVER)?\(.*?\)', data): 16 compat = re.search(r'"(.*?)"', m[0])[1] 28 for m in re.finditer(r'of_device_id\s+[a-zA-Z0-9_]+\[\]\s*=\s*({.*?);', data): 29 compat_list += re.findall(r'\.compatible\s+=\s+"([a-zA-Z0-9_\-,]+)"', m[1])
|
/Linux-v6.1/arch/um/ |
D | Kconfig.debug | 13 If you're involved in UML kernel development and want to use gprof, 14 say Y. If you're unsure, say N. 28 If you're involved in UML kernel development and want to use gcov, 29 say Y. If you're unsure, say N.
|
/Linux-v6.1/Documentation/filesystems/ext4/ |
D | mmp.rst | 19 While the filesystem is live, the kernel sets up a timer to re-check the 20 MMP block at the specified MMP check interval. To perform the re-check, 21 the MMP sequence number is re-read; if it does not match the in-memory 25 memory and on disk, and the re-check is complete. 65 - The MMP re-check interval, in seconds.
|