Home
last modified time | relevance | path

Searched refs:re (Results 1 - 25 of 262) sorted by relevance

1234567891011

/kernel/linux/linux-5.10/fs/btrfs/
H A Dreada.c95 struct reada_extent *re, struct extent_buffer *eb, in __readahead_hook()
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()
94 __readahead_hook(struct btrfs_fs_info *fs_info, struct reada_extent *re, struct extent_buffer *eb, int err) __readahead_hook() argument
304 struct reada_extent *re = NULL; reada_find_extent() local
488 reada_extent_put(struct btrfs_fs_info *fs_info, struct reada_extent *re) reada_extent_put() argument
552 struct reada_extent *re; reada_add_block() local
679 struct reada_extent *re = NULL; reada_start_machine_dev() local
880 struct reada_extent *re = NULL; dump_devs() local
909 struct reada_extent *re = NULL; dump_devs() local
[all...]
H A 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()
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()
116 insert_root_entry(struct rb_root *root, struct root_entry *re) insert_root_entry() argument
265 struct root_entry *re = NULL; add_block_entry() local
313 struct root_entry *re; add_tree_block() local
390 struct root_entry *re; add_extent_data_ref() local
636 struct root_entry *re; dump_block_entry() local
677 struct root_entry *re = NULL; btrfs_ref_tree_mod() local
[all...]
/kernel/linux/linux-5.10/scripts/
H A 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
[all...]
H A Dcheckkconfigsymbols.py14 import re namespace
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_KCONFIG_HELP = re.compile(r"^\s+help\s*$")
38 REGEX_FILTER_SYMBOLS = re.compile(r"[A-Za-z0-9]$")
39 REGEX_NUMERIC = re
[all...]
H A Dbpf_helpers_doc.py10 import re namespace
42 arg_re = re.compile('((\w+ )*?(\w+|...))( (\**)(\w+))?$')
44 proto_re = re.compile('(.+) (\**)(\w+)\(((([^,]+)(, )?){1,5})\)$')
90 p = re.compile(' \* ?((.+) \**\w+\((((const )?(struct )?(\w+|\.\.\.)( \**\w+)?)(, )?){1,5}\))$')
98 p = re.compile(' \* ?(?:\t| {5,8})Description$')
112 p = re.compile(' \* ?(?:\t| {5,8})(?:\t| {8})(.*)')
121 p = re.compile(' \* ?(?:\t| {5,8})Return$')
135 p = re.compile(' \* ?(?:\t| {5,8})(?:\t| {8})(.*)')
388 for line in re.sub('\n$', '', helper.desc, count=1).split('\n'):
543 for line in re
[all...]
/kernel/linux/linux-6.6/scripts/
H A 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
[all...]
H A Dbpf_doc.py11 import re namespace
62 arg_re = re.compile(r'((\w+ )*?(\w+|...))( (\**)(\w+))?$')
64 proto_re = re.compile(r'(.+) (\**)(\w+)\(((([^,]+)(, )?){1,5})\)$')
117 p = re.compile(r' \* ?(BPF\w+)$')
121 end_re = re.compile(r' \* ?NOTES$')
136 p = re.compile(r' \* ?((.+) \**\w+\((((const )?(struct )?(\w+|\.\.\.)( \**\w+)?)(, )?){1,5}\))$')
144 p = re.compile(r' \* ?(?:\t| {5,8})Description$')
157 p = re.compile(r' \* ?(?:\t| {5,8})(?:\t| {8})(.*)')
170 p = re.compile(r' \* ?(?:\t| {5,8})Return$')
183 p = re
[all...]
H A Dcheckkconfigsymbols.py14 import re namespace
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...]
/kernel/linux/linux-6.6/arch/arm64/crypto/
H A Dsm3-neon-core.S45 #define re w7 define
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...]
/kernel/linux/linux-6.6/fs/btrfs/
H A Dref-verify.c63 * free it until we unmount the file system in order to make sure re-allocations
120 struct root_entry *re) in insert_root_entry()
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()
119 insert_root_entry(struct rb_root *root, struct root_entry *re) insert_root_entry() argument
268 struct root_entry *re = NULL; add_block_entry() local
316 struct root_entry *re; add_tree_block() local
393 struct root_entry *re; add_extent_data_ref() local
627 struct root_entry *re; dump_block_entry() local
668 struct root_entry *re = NULL; btrfs_ref_tree_mod() local
[all...]
/kernel/linux/linux-6.6/tools/testing/selftests/bpf/
H A Dtest_bpftool_synctypes.py7 import re namespace
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
[all...]
/kernel/linux/linux-5.10/tools/testing/selftests/tc-testing/plugin-lib/
H A DvalgrindPlugin.py8 import re namespace
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
[all...]
/kernel/linux/linux-6.6/tools/testing/selftests/tc-testing/plugin-lib/
H A DvalgrindPlugin.py8 import re namespace
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
[all...]
/kernel/linux/linux-6.6/Documentation/sphinx/
H A Dautomarkup.py15 import re namespace
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
[all...]
H A Dmaintainers_include.py21 import re namespace
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(r"\s(\S):\s", line)
97 m = re.search(r"\*([^\*]+)\*", line)
115 heading = re.sub(r"\s+", " ", line)
/kernel/linux/linux-5.10/Documentation/sphinx/
H A Dautomarkup.py15 import re namespace
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
[all...]
H A Dmaintainers_include.py21 import re namespace
75 if re.search('^[A-Z0-9]', line):
83 m = re.search(pat, line)
86 line = re.sub(pat, ':doc:`%s <../%s>`' % (m.group(2), m.group(2)), line)
95 m = re.search("\s(\S):\s", line)
99 m = re.search("\*([^\*]+)\*", line)
117 heading = re.sub("\s+", " ", line)
/kernel/linux/linux-5.10/fs/f2fs/
H A 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; f2fs_lookup_rb_tree_ext() local
90 struct rb_entry *re; f2fs_lookup_rb_tree_for_insert() local
129 struct rb_entry *re = cached_re; f2fs_lookup_rb_tree_ret() local
[all...]
/kernel/linux/linux-5.10/arch/mips/math-emu/
H A Dsp_maddf.c18 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 Ddp_maddf.c43 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...]
/kernel/linux/linux-6.6/arch/mips/math-emu/
H A Dsp_maddf.c18 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 Ddp_maddf.c43 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...]
/kernel/linux/linux-5.10/Documentation/target/
H A Dtcm_mod_builder.py12 import re namespace
349 if process_fo == 0 and re.search('struct target_core_fabric_ops {', line):
357 if not re.search('\(\*', line):
365 if not re.search('\(\*', line):
426 if re.search('get_fabric_name', fo):
434 if re.search('get_wwn', fo):
444 if re.search('get_tag', fo):
453 if re.search('tpg_get_inst_index\)\(', fo):
460 if re.search('\*release_cmd\)\(', fo):
467 if re
[all...]
/kernel/linux/linux-5.10/drivers/mtd/ubi/
H A 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 in rename_volumes()
[all...]
/kernel/linux/linux-6.6/drivers/mtd/ubi/
H A 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 in rename_volumes()
[all...]

Completed in 14 milliseconds

1234567891011