| /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, 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 …]
|
| 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); 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 …]
|
| H A D | serpent-avx-x86_64-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); LK2(RA, RD, RB, RE, RC, 5);
572 S(S5, RA, RD, RB, RE, RC); LK2(RC, RA, RD, RE, RB, 6);
573 S(S6, RC, RA, RD, RE, RB); LK2(RD, RB, RA, RE, RC, 7);
574 S(S7, RD, RB, RA, RE, RC); LK2(RC, RA, RE, RD, RB, 8);
575 S(S0, RC, RA, RE, RD, RB); LK2(RE, RA, RD, RC, RB, 9);
[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); LK2(RA, RD, RB, RE, RC, 5);
572 S(S5, RA, RD, RB, RE, RC); LK2(RC, RA, RD, RE, RB, 6);
573 S(S6, RC, RA, RD, RE, RB); LK2(RD, RB, RA, RE, RC, 7);
574 S(S7, RD, RB, RA, RE, RC); LK2(RC, RA, RE, RD, RB, 8);
575 S(S0, RC, RA, RE, RD, RB); LK2(RE, RA, RD, RC, RB, 9);
[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_odd, _, 7, 3, IW, SCHED_W_W0W1W2W3W4W5_2, 12)
[all …]
|
| /linux/fs/btrfs/ |
| H A D | ref-verify.c | 63 * free it until we unmount the file system in order to make sure re-allocations
120 struct root_entry *re) in insert_root_entry() argument
129 if (entry->root_objectid > re->root_objectid) in insert_root_entry()
131 else if (entry->root_objectid < re->root_objectid) in insert_root_entry()
137 rb_link_node(&re->node, parent_node, p); in insert_root_entry()
138 rb_insert_color(&re->node, root); in insert_root_entry()
237 struct root_entry *re; in free_block_entry() local
243 re = rb_entry(n, struct root_entry, node); in free_block_entry()
244 rb_erase(&re->node, &be->roots); in free_block_entry()
245 kfree(re); in free_block_entry()
[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 = qr/.*addiu.*sp,sp,-([0-9]{1,8})/o;
[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.compile("(\"(.*?)\")")
[all …]
|
| /linux/Documentation/sphinx/ |
| H A D | automarkup.py | 11 import re
15 # Python 2 lacks re.ASCII...
18 ascii_p3 = re.ASCII
29 RE_function = re.compile(r'\b(([a-zA-Z_]\w+)\(\))', flags=ascii_p3)
34 RE_generic_type = re.compile(r'\b(struct|union|enum|typedef)\s+([a-zA-Z_]\w+)',
41 RE_struct = re.compile(r'\b(struct)\s+([a-zA-Z_]\w+)', flags=ascii_p3)
42 RE_union = re.compile(r'\b(union)\s+([a-zA-Z_]\w+)', flags=ascii_p3)
43 RE_enum = re.compile(r'\b(enum)\s+([a-zA-Z_]\w+)', flags=ascii_p3)
44 RE_typedef = re.compile(r'\b(typedef)\s+([a-zA-Z_]\w+)', flags=ascii_p3)
50 RE_doc = re.compile(r'(\bDocumentation/)?((\.\./)*[\w\-/]+)\.(rst|txt)')
[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(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/tools/testing/selftests/tc-testing/plugin-lib/ |
| H A D | valgrindPlugin.py | 8 import re
114 self.definitely_lost_re = re.compile(
115 … r'definitely lost:\s+([,0-9]+)\s+bytes in\s+([,0-9]+)\sblocks', re.MULTILINE | re.DOTALL)
116 self.indirectly_lost_re = re.compile(
117 … r'indirectly lost:\s+([,0-9]+)\s+bytes in\s+([,0-9]+)\s+blocks', re.MULTILINE | re.DOTALL)
118 self.possibly_lost_re = re.compile(
119 r'possibly lost:\s+([,0-9]+)bytes in\s+([,0-9]+)\s+blocks', re.MULTILINE | re.DOTALL)
120 self.non_leak_error_re = re.compile(
121 … r'ERROR SUMMARY:\s+([,0-9]+) errors from\s+([,0-9]+)\s+contexts', re.MULTILINE | re.DOTALL)
|
| /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 a D*ckhead" doesn't
188 knowledge that we're better than the average person (let's face it,
[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 acting for.
[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 > ze) { 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 - ze; in _dp_maddf()
[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 */
218 /* Maximum amount of UBI volumes that can be re-named at one go */
358 * struct ubi_rsvol_req - a data structure used in volume re-size requests.
359 * @vol_id: ID of the volume to re-size
362 * Re-sizing is possible for both dynamic and static volumes. But while dynamic
[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/bpf/ |
| H A D | llvm_reloc.rst | 244 .. _btf-co-re-relocations:
247 CO-RE Relocations
250 From object file point of view CO-RE mechanism is implemented as a set
251 of CO-RE specific relocation records. These relocation records are not
256 CO-RE relocations are applied to BPF instructions to update immediate
269 There are several kinds of CO-RE relocations that could be split in
347 CO-RE Relocation Record
414 CO-RE Relocation Examples
457 00: CO-RE <byte_off> [2] struct foo::a (0:0)
460 10: CO-RE <byte_off> [2] struct foo::a (0:0)
[all …]
|
| /linux/arch/powerpc/crypto/ |
| 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(0),16(r3)
|
| /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 iterating.
[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/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/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 happy to be. Users
|
| /linux/drivers/gpu/drm/xe/ |
| H A D | xe_guc_db_mgr.c | 227 unsigned int rs, re; in dbm_print_locked() local
235 for_each_clear_bitrange(rs, re, dbm->bitmap, dbm->count) { in dbm_print_locked()
237 rs, re - 1, re - rs); in dbm_print_locked()
238 total += re - rs; in dbm_print_locked()
243 for_each_set_bitrange(rs, re, dbm->bitmap, dbm->count) { in dbm_print_locked()
245 rs, re - 1, re - rs); in dbm_print_locked()
246 total += re - rs; in dbm_print_locked()
|