re (full) in projects: linux-5.10 - OpenGrok search results

Searched full:re (Results 1 – 25 of 5304) sorted by relevance

/linux/arch/x86/crypto/
H A 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, R [all...]`
H A 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); LK [all...]`
H A D	serpent-avx2-asm_64.S	`566 K2(RA, RB, RC, RD, RE, 0); 567 S(S0, RA, RB, RC, RD, RE); LK2(RC, RB, RD, RA, RE, 1); 568 S(S1, RC, RB, RD, RA, RE); LK2(RE, RD, RA, RC, RB, 2); 569 S(S2, RE, RD, RA, RC, RB); LK2(RB, RD, RE, RC, RA, 3); 570 S(S3, RB, RD, RE, RC, RA); LK2(RC, RA, RD, RB, RE, 4); 571 S(S4, RC, RA, RD, RB, RE); LK [all...]`
H A 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); LK [all...]`
/linux/scripts/lib/abi/
H A D	abi_regex.py	`10 import re 28 (re.compile("\\\\"), ""), 31 (re.compile(r"\."), "\xf6"), 34 (re.compile(r"\[0\-9\]\+"), "\xff"), 37 (re.compile(r"\[0\-\d+\]"), "\xff"), 38 (re.compile(r"\[0:\d+\]"), "\xff"), 39 (re.compile(r"\[(\d+)\]"), "\xf4\\\\d+\xf5"), 42 (re.compile(r"\[(\d)\-(\d)\]"), "\xf4\1-\2\xf5"), 45 (re.compile(r"[\{\<\[]([\w_]+)(?:[,\|]+([\w_]+)){1,}[\}\>\]]"), r"(\1\|\2)"), 48 (re [all...]`
/linux/arch/arm64/crypto/
H A D	sm3-neon-core.S	45 #define re w7 macro 358 ldp re, rf, [RSTATE, #16] 401 R1(ra, rb, rc, rd, re, rf, rg, rh, k_even, KL, 0, 0, IW, _, 0) 402 R1(rd, ra, rb, rc, rh, re, rf, rg, k_odd, _, 1, 1, IW, _, 0) 403 R1(rc, rd, ra, rb, rg, rh, re, rf, k_even, KL, 2, 2, IW, _, 0) 404 R1(rb, rc, rd, ra, rf, rg, rh, re, k_odd, _, 3, 3, IW, _, 0) 407 R1(ra, rb, rc, rd, re, rf, rg, rh, k_even, KL, 4, 0, IW, _, 0) 408 R1(rd, ra, rb, rc, rh, re, rf, rg, k_odd, _, 5, 1, IW, _, 0) 409 R1(rc, rd, ra, rb, rg, rh, re, rf, k_even, KL, 6, 2, IW, SCHED_W_W0W1W2W3W4W5_1, 12) 410 R1(rb, rc, rd, ra, rf, rg, rh, re, k_od [all...]
/linux/scripts/lib/kdoc/
H A D	kdoc_re.py	`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.match storing its results 72 Handles a re.search storing its results 80 Alias to re.findall 87 Alias to re.split 94 Alias to re.sub 110 even harder on Python with its normal re modul [all...]`
H A D	kdoc_parser.py	`16 import re 47 known_sections = KernRe(known_section_names, flags = re.I) 50 flags=re.I, cache=False) 58 flags=re.I \| re.S, cache=False) 423 dtype = KernRe(r'([^\(]+\(\?)\s' + re.escape(param)).sub(r'\1', arg) 438 dtype = KernRe(r'([^\(]+\(\?)\s' + re.escape(param)).sub(r'\1', arg) 449 args[0] = re.sub(r'(\+)\s', r' \1', args[0]) 571 (KernRe(r'\/\\sprivate:.?\/\\spublic:.?\*\/', re.S \| re [all...]`
/linux/scripts/
H A D	checkstack.pl	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); 59 $re = qr/^.stp.sp, ?\#-([0-9]{1,8})\]\!/o; 63 $re = qr/.sub.sp, sp, #([0-9]{1,4})/o; 69 $re = qr/^.[as][du][db] \$(0x$x{1,8}),\%(e\|r)sp$/o; 74 $re = qr/.(?:linkw %fp,\|addaw )#-([0-9]{1,4})(?:,%sp)?$/o; 77 $re = qr/.daddiu.sp,sp,-([0-9]{1,8})/o; 80 $re [all...]
H A D	macro_checker.py	`9 import re 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)): 66 macro = re.sub(comment_pattern1, '', macro) 67 macro = re.sub(comment_pattern2, '', macro) 91 macro = re.match(macro_pattern, line)`
H A 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 [all...]`
/linux/tools/testing/selftests/bpf/
H A 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(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): 111 if re.search(end_marker, line): 180 start_marker = re.compile(f'enum {enum_name} {{\n') 181 pattern = re [all...]`
/linux/drivers/mtd/ubi/
H A 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 in rename_volumes() [all...]
/linux/fs/sysfs/
H A 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 actin [all...]`
/linux/Documentation/process/
H A 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 [all...]
/linux/arch/mips/math-emu/
H A 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 > z in _sp_maddf() [all...]`
H A 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 in _dp_maddf() [all...]`
/linux/Documentation/virt/hyperv/
H A D	hibernation.rst	116 resumes, the devices are re-offered by Hyper-V and are connected to 149 device driver's resume function re-allocates the ring buffer and 150 re-opens the existing channel. It then communicates with Hyper-V to 151 re-open sub-channels from scratch. 176 the previously allocated memory, then re-enables non-boot CPUs. 180 for the VMBus bus, which re-establishes the top-level VMBus 181 connection and requests that Hyper-V re-offer the VMBus devices. 185 device re-opens its primary channel, and communicates with Hyper-V 186 to re-establish sub-channels if appropriate. The sub-channels 187 are re [all...]
/linux/include/uapi/mtd/
H A 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 / 220 / Maximum amount of UBI volumes that can be re-named at one go / 360 struct ubi_rsvol_req - a data structure used in volume re-size requests. 361 * @vol_id: ID of the volume to re-size 364 * Re [all...]`
/linux/arch/mips/mm/
H A 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/Documentation/userspace-api/media/mediactl/
H A 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/lib/crypto/powerpc/
H A 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( [all...]`
/linux/scripts/dtc/
H A D	dt-extract-compatibles	`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):`
/linux/lib/
H A 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 iteratin [all...]`
/linux/Documentation/filesystems/bcachefs/
H A D	CodingStyle.rst	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 34 we're not stuck debugging undefined behaviour should it turn out that you were 66 Whenever we're debugging, and the solution isn't immediately obvious, if the 77 everywhere. Having functions to print whatever object you're working with will 90 Tracepoints shouldn't be the first thing you reach for. They're an important 92 have to rely on tracing, we have to know which tracepoints we're looking for, 97 The humble counter is an incredibly useful tool. They're cheap and simple to 113 what you're doing you'll be amazed at how patient they're happ [all...]

12 3 4 5 6 7 8 9 10 >>...213

Project(s)

Full Search
Definition
Symbol
File Path
History
Type