Home
last modified time | relevance | path

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

12345678910>>...250

/kernel/linux/linux-5.10/arch/x86/crypto/
Dserpent-sse2-i586-asm_32.S31 #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 …]
Dserpent-sse2-x86_64-asm_64.S636 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 …]
Dserpent-avx2-asm_64.S577 K2(RA, RB, RC, RD, RE, 0);
578 S(S0, RA, RB, RC, RD, RE); LK2(RC, RB, RD, RA, RE, 1);
579 S(S1, RC, RB, RD, RA, RE); LK2(RE, RD, RA, RC, RB, 2);
580 S(S2, RE, RD, RA, RC, RB); LK2(RB, RD, RE, RC, RA, 3);
581 S(S3, RB, RD, RE, RC, RA); LK2(RC, RA, RD, RB, RE, 4);
582 S(S4, RC, RA, RD, RB, RE); LK2(RA, RD, RB, RE, RC, 5);
583 S(S5, RA, RD, RB, RE, RC); LK2(RC, RA, RD, RE, RB, 6);
584 S(S6, RC, RA, RD, RE, RB); LK2(RD, RB, RA, RE, RC, 7);
585 S(S7, RD, RB, RA, RE, RC); LK2(RC, RA, RE, RD, RB, 8);
586 S(S0, RC, RA, RE, RD, RB); LK2(RE, RA, RD, RC, RB, 9);
[all …]
Dserpent-avx-x86_64-asm_64.S571 K2(RA, RB, RC, RD, RE, 0);
572 S(S0, RA, RB, RC, RD, RE); LK2(RC, RB, RD, RA, RE, 1);
573 S(S1, RC, RB, RD, RA, RE); LK2(RE, RD, RA, RC, RB, 2);
574 S(S2, RE, RD, RA, RC, RB); LK2(RB, RD, RE, RC, RA, 3);
575 S(S3, RB, RD, RE, RC, RA); LK2(RC, RA, RD, RB, RE, 4);
576 S(S4, RC, RA, RD, RB, RE); LK2(RA, RD, RB, RE, RC, 5);
577 S(S5, RA, RD, RB, RE, RC); LK2(RC, RA, RD, RE, RB, 6);
578 S(S6, RC, RA, RD, RE, RB); LK2(RD, RB, RA, RE, RC, 7);
579 S(S7, RD, RB, RA, RE, RC); LK2(RC, RA, RE, RD, RB, 8);
580 S(S0, RC, RA, RE, RD, RB); LK2(RE, RA, RD, RC, RB, 9);
[all …]
/kernel/linux/linux-4.19/arch/x86/crypto/
Dserpent-sse2-i586-asm_32.S46 #define RE %xmm4 macro
528 read_blocks(%eax, RA, RB, RC, RD, RT0, RT1, RE);
530 K(RA, RB, RC, RD, RE, 0);
531 S0(RA, RB, RC, RD, RE); LK(RC, RB, RD, RA, RE, 1);
532 S1(RC, RB, RD, RA, RE); LK(RE, RD, RA, RC, RB, 2);
533 S2(RE, RD, RA, RC, RB); LK(RB, RD, RE, RC, RA, 3);
534 S3(RB, RD, RE, RC, RA); LK(RC, RA, RD, RB, RE, 4);
535 S4(RC, RA, RD, RB, RE); LK(RA, RD, RB, RE, RC, 5);
536 S5(RA, RD, RB, RE, RC); LK(RC, RA, RD, RE, RB, 6);
537 S6(RC, RA, RD, RE, RB); LK(RD, RB, RA, RE, RC, 7);
[all …]
Dserpent-sse2-x86_64-asm_64.S651 K2(RA, RB, RC, RD, RE, 0);
652 S(S0, RA, RB, RC, RD, RE); LK2(RC, RB, RD, RA, RE, 1);
653 S(S1, RC, RB, RD, RA, RE); LK2(RE, RD, RA, RC, RB, 2);
654 S(S2, RE, RD, RA, RC, RB); LK2(RB, RD, RE, RC, RA, 3);
655 S(S3, RB, RD, RE, RC, RA); LK2(RC, RA, RD, RB, RE, 4);
656 S(S4, RC, RA, RD, RB, RE); LK2(RA, RD, RB, RE, RC, 5);
657 S(S5, RA, RD, RB, RE, RC); LK2(RC, RA, RD, RE, RB, 6);
658 S(S6, RC, RA, RD, RE, RB); LK2(RD, RB, RA, RE, RC, 7);
659 S(S7, RD, RB, RA, RE, RC); LK2(RC, RA, RE, RD, RB, 8);
660 S(S0, RC, RA, RE, RD, RB); LK2(RE, RA, RD, RC, RB, 9);
[all …]
Dserpent-avx2-asm_64.S582 K2(RA, RB, RC, RD, RE, 0);
583 S(S0, RA, RB, RC, RD, RE); LK2(RC, RB, RD, RA, RE, 1);
584 S(S1, RC, RB, RD, RA, RE); LK2(RE, RD, RA, RC, RB, 2);
585 S(S2, RE, RD, RA, RC, RB); LK2(RB, RD, RE, RC, RA, 3);
586 S(S3, RB, RD, RE, RC, RA); LK2(RC, RA, RD, RB, RE, 4);
587 S(S4, RC, RA, RD, RB, RE); LK2(RA, RD, RB, RE, RC, 5);
588 S(S5, RA, RD, RB, RE, RC); LK2(RC, RA, RD, RE, RB, 6);
589 S(S6, RC, RA, RD, RE, RB); LK2(RD, RB, RA, RE, RC, 7);
590 S(S7, RD, RB, RA, RE, RC); LK2(RC, RA, RE, RD, RB, 8);
591 S(S0, RC, RA, RE, RD, RB); LK2(RE, RA, RD, RC, RB, 9);
[all …]
Dserpent-avx-x86_64-asm_64.S586 K2(RA, RB, RC, RD, RE, 0);
587 S(S0, RA, RB, RC, RD, RE); LK2(RC, RB, RD, RA, RE, 1);
588 S(S1, RC, RB, RD, RA, RE); LK2(RE, RD, RA, RC, RB, 2);
589 S(S2, RE, RD, RA, RC, RB); LK2(RB, RD, RE, RC, RA, 3);
590 S(S3, RB, RD, RE, RC, RA); LK2(RC, RA, RD, RB, RE, 4);
591 S(S4, RC, RA, RD, RB, RE); LK2(RA, RD, RB, RE, RC, 5);
592 S(S5, RA, RD, RB, RE, RC); LK2(RC, RA, RD, RE, RB, 6);
593 S(S6, RC, RA, RD, RE, RB); LK2(RD, RB, RA, RE, RC, 7);
594 S(S7, RD, RB, RA, RE, RC); LK2(RC, RA, RE, RD, RB, 8);
595 S(S0, RC, RA, RE, RD, RB); LK2(RE, RA, RD, RC, RB, 9);
[all …]
/kernel/linux/linux-4.19/fs/btrfs/
Dreada.c94 struct reada_extent *re, struct extent_buffer *eb, in __readahead_hook() argument
103 spin_lock(&re->lock); in __readahead_hook()
108 list_replace_init(&re->extctl, &list); in __readahead_hook()
109 re->scheduled = 0; in __readahead_hook()
110 spin_unlock(&re->lock); in __readahead_hook()
142 next_key = re->top; in __readahead_hook()
191 reada_extent_put(fs_info, re); /* one ref for each entry */ in __readahead_hook()
201 struct reada_extent *re; in btree_readahead_hook() local
205 re = radix_tree_lookup(&fs_info->reada_tree, in btree_readahead_hook()
207 if (re) in btree_readahead_hook()
[all …]
Dref-verify.c60 * 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()
245 struct root_entry *re; in free_block_entry() local
251 re = rb_entry(n, struct root_entry, node); in free_block_entry()
252 rb_erase(&re->node, &be->roots); in free_block_entry()
253 kfree(re); in free_block_entry()
[all …]
/kernel/linux/linux-5.10/fs/btrfs/
Dreada.c95 struct reada_extent *re, struct extent_buffer *eb, in __readahead_hook() argument
104 spin_lock(&re->lock); in __readahead_hook()
109 list_replace_init(&re->extctl, &list); in __readahead_hook()
110 re->scheduled = 0; in __readahead_hook()
111 spin_unlock(&re->lock); in __readahead_hook()
143 next_key = re->top; in __readahead_hook()
192 reada_extent_put(fs_info, re); /* one ref for each entry */ in __readahead_hook()
202 struct reada_extent *re; in btree_readahead_hook() local
206 re = radix_tree_lookup(&fs_info->reada_tree, in btree_readahead_hook()
208 if (re) in btree_readahead_hook()
[all …]
Dref-verify.c60 * 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 …]
/kernel/linux/linux-4.19/tools/testing/selftests/tc-testing/plugin-lib/
DvalgrindPlugin.py8 import re
99 self.definitely_lost_re = re.compile(
100 … r'definitely lost:\s+([,0-9]+)\s+bytes in\s+([,0-9]+)\sblocks', re.MULTILINE | re.DOTALL)
101 self.indirectly_lost_re = re.compile(
102 … r'indirectly lost:\s+([,0-9]+)\s+bytes in\s+([,0-9]+)\s+blocks', re.MULTILINE | re.DOTALL)
103 self.possibly_lost_re = re.compile(
104 r'possibly lost:\s+([,0-9]+)bytes in\s+([,0-9]+)\s+blocks', re.MULTILINE | re.DOTALL)
105 self.non_leak_error_re = re.compile(
106 … r'ERROR SUMMARY:\s+([,0-9]+) errors from\s+([,0-9]+)\s+contexts', re.MULTILINE | re.DOTALL)
/kernel/linux/linux-4.19/scripts/
Dcheckstack.pl29 # $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
38 my (@stack, $re, $dre, $x, $xs, $funcre);
51 $re = qr/^.*stp.*sp, \#-([0-9]{1,8})\]\!/o;
54 $re = qr/.*sub.*sp, sp, #(([0-9]{2}|[3-9])[0-9]{2})/o;
59 $re = qr/^.*[as][du][db] \$(0x$x{1,8}),\%(e|r)sp$/o;
63 $re = qr/.*adds.*r12=-(([0-9]{2}|[3-9])[0-9]{2}),r12/o;
67 $re = qr/.*(?:linkw %fp,|addaw )#-([0-9]{1,4})(?:,%sp)?$/o;
70 $re = qr/.*daddiu.*sp,sp,-(([0-9]{2}|[3-9])[0-9]{2})/o;
[all …]
/kernel/linux/linux-5.10/scripts/
Dcheckstack.pl29 # $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;
73 $re = qr/.*adds.*r12=-(([0-9]{2}|[3-9])[0-9]{2}),r12/o;
77 $re = qr/.*(?:linkw %fp,|addaw )#-([0-9]{1,4})(?:,%sp)?$/o;
80 $re = qr/.*daddiu.*sp,sp,-(([0-9]{2}|[3-9])[0-9]{2})/o;
[all …]
/kernel/linux/linux-5.10/tools/testing/selftests/tc-testing/plugin-lib/
DvalgrindPlugin.py8 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)
/kernel/linux/linux-4.19/fs/f2fs/
Dextent_cache.c37 struct rb_entry *re; in __lookup_rb_tree_slow() local
40 re = rb_entry(node, struct rb_entry, rb_node); in __lookup_rb_tree_slow()
42 if (ofs < re->ofs) in __lookup_rb_tree_slow()
44 else if (ofs >= re->ofs + re->len) in __lookup_rb_tree_slow()
47 return re; in __lookup_rb_tree_slow()
55 struct rb_entry *re; in f2fs_lookup_rb_tree() local
57 re = __lookup_rb_tree_fast(cached_re, ofs); in f2fs_lookup_rb_tree()
58 if (!re) in f2fs_lookup_rb_tree()
61 return re; in f2fs_lookup_rb_tree()
69 struct rb_entry *re; in f2fs_lookup_rb_tree_for_insert() local
[all …]
/kernel/linux/linux-5.10/fs/f2fs/
Dextent_cache.c34 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 …]
/kernel/linux/linux-5.10/Documentation/sphinx/
Dautomarkup.py15 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\-_/]+)(\.\w+)*')
[all …]
/kernel/linux/linux-5.10/drivers/mtd/ubi/
Dcdev.c13 * 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 …]
/kernel/linux/linux-4.19/drivers/mtd/ubi/
Dcdev.c26 * manipulate whole volumes: create, remove, and re-size them. Volume character
664 * verify_rsvol_req - verify volume re-size request.
685 * @req: volumes re-name request
687 * This is a helper function for the volume re-name IOCTL which validates the
697 struct ubi_rename_entry *re, *re1; in rename_volumes() local
736 /* Create the re-name list */ in rename_volumes()
743 re = kzalloc(sizeof(struct ubi_rename_entry), GFP_KERNEL); in rename_volumes()
744 if (!re) { in rename_volumes()
749 re->desc = ubi_open_volume(ubi->ubi_num, vol_id, UBI_METAONLY); in rename_volumes()
750 if (IS_ERR(re->desc)) { in rename_volumes()
[all …]
/kernel/linux/linux-4.19/fs/sysfs/
Dsymlink.c56 * @kn: directory we're creating the link in.
57 * @target: object we're pointing to.
84 * @kobj: object whose directory we're creating the link in.
85 * @target: object we're pointing to.
97 * @kobj: object whose directory we're creating the link in.
98 * @target: object we're pointing to.
113 * @kobj: object we're acting for.
114 * @targ: object we're pointing to.
139 * @kobj: object we're acting for.
157 * @kobj: object we're acting for.
[all …]
/kernel/linux/linux-5.10/fs/sysfs/
Dsymlink.c57 * @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 …]
/kernel/linux/linux-5.10/Documentation/process/
Dmanagement-style.rst20 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 …]
/kernel/linux/linux-4.19/Documentation/process/
Dmanagement-style.rst19 budget of your group, you're almost certainly not a kernel manager.
43 to decide on this", you're in trouble as a manager. The people you
45 you for a technical decision, you're screwed. You're clearly not
49 you, you're also screwed, although for a totally different reason.
55 makes you look like you know what you're doing, so what a kernel manager
76 fairly easy to backtrack. Since you're not going to be able to waste
80 incompetent nincompoop, say you're sorry, and undo all the worthless
159 "you're a d*ckhead" in millions of different ways [#f2]_, sometimes without
178 frankly, "A Million Ways to Tell a Developer They're a D*ckhead" doesn't
187 knowledge that we're better than the average person (let's face it,
[all …]

12345678910>>...250