/Linux-v6.1/scripts/ |
D | checkstack.pl | 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; 84 $re = qr/.*addiu.*sp,sp,-(([0-9]{2}|[3-9])[0-9]{2})/o; 87 $re = qr/.*addi.*sp,sp,-(([0-9]{2}|[3-9])[0-9]{2})/o; 90 $re = qr/.*l\.addi.*r1,r1,-(([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 …]
|
D | bpf_doc.py | 11 import re 62 arg_re = re.compile('((\w+ )*?(\w+|...))( (\**)(\w+))?$') 64 proto_re = re.compile('(.+) (\**)(\w+)\(((([^,]+)(, )?){1,5})\)$') 116 p = re.compile(' \* ?(BPF\w+)$') 120 end_re = re.compile(' \* ?NOTES$') 135 … p = re.compile(' \* ?((.+) \**\w+\((((const )?(struct )?(\w+|\.\.\.)( \**\w+)?)(, )?){1,5}\))$') 143 p = re.compile(' \* ?(?:\t| {5,8})Description$') 156 p = re.compile(' \* ?(?:\t| {5,8})(?:\t| {8})(.*)') 169 p = re.compile(' \* ?(?:\t| {5,8})Return$') 182 p = re.compile(' \* ?(?:\t| {5,8})(?:\t| {8})(.*)') [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/btrfs/ |
D | ref-verify.c | 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() 265 struct root_entry *re = NULL; in add_block_entry() local [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/Documentation/sphinx/ |
D | automarkup.py | 15 import re 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)') 56 RE_namespace = re.compile(r'^\s*..\s*c:namespace::\s*(\S+)\s*$') [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)
|
D | cdomain.py | 44 import re 58 RE_namespace = re.compile(r'^\s*..\s*c:namespace::\s*(\S+)\s*$') 70 RE_macro = re.compile(r'^\s*..\s*c:macro::\s*(\S+)\s+(\S.*)\s*$') 78 RE_ctype = re.compile(r'^\s*..\s*c:(struct|union|enum|enumerator|alias)::\s*(.*)$') 87 RE_ctype_refs = re.compile(r':c:(var|struct|union|enum|enumerator)::`([^\`]+)`') 94 RE_expr = re.compile(r':c:(expr|texpr):`([^\`]+)`') 116 n = n[:m.start()] + markup_func[m.re](m) + n[m.end():]
|
/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/arch/mips/math-emu/ |
D | sp_maddf.c | 18 int re; in _sp_maddf() local 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() 197 s = re - ze; in _sp_maddf() 201 assert(ze == re); in _sp_maddf()
|
D | dp_maddf.c | 43 int re; in _dp_maddf() local 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() 258 assert(ze == re); in _dp_maddf()
|
D | sp_div.c | 15 int re; in ieee754sp_div() local 116 re = xe - ye; in ieee754sp_div() 138 re--; in ieee754sp_div() 141 return ieee754sp_format(xs == ys ? 0 : 1, re, rm); in ieee754sp_div()
|
D | dp_div.c | 15 int re; in ieee754dp_div() local 116 re = xe - ye; in ieee754dp_div() 139 re--; in ieee754dp_div() 142 return ieee754dp_format(xs == ys ? 0 : 1, re, rm); in ieee754dp_div()
|
/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])
|
D | flattree.c | 297 struct reserve_info *re; in flatten_reserve_list() local 301 for (re = reservelist; re; re = re->next) { in flatten_reserve_list() 302 d = data_append_re(d, re->address, re->size); in flatten_reserve_list() 452 struct reserve_info *re; in dt_to_asm() local 517 for (re = dti->reservelist; re; re = re->next) { in dt_to_asm() 520 for_each_label(re->labels, l) { in dt_to_asm() 524 ASM_EMIT_BELONG(f, "0x%08x", (unsigned int)(re->address >> 32)); in dt_to_asm() 526 (unsigned int)(re->address & 0xffffffff)); in dt_to_asm() 527 ASM_EMIT_BELONG(f, "0x%08x", (unsigned int)(re->size >> 32)); in dt_to_asm() 528 ASM_EMIT_BELONG(f, "0x%08x", (unsigned int)(re->size & 0xffffffff)); in dt_to_asm() [all …]
|
D | treesource.c | 322 struct reserve_info *re; in dt_to_source() local 326 for (re = dti->reservelist; re; re = re->next) { in dt_to_source() 329 for_each_label(re->labels, l) in dt_to_source() 332 (unsigned long long)re->address, in dt_to_source() 333 (unsigned long long)re->size); in dt_to_source()
|
/Linux-v6.1/Documentation/target/ |
D | tcm_mod_builder.py | 12 import re 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.search('sess_get_index\)\(', fo): [all …]
|
/Linux-v6.1/drivers/mtd/ubi/ |
D | cdev.c | 684 struct ubi_rename_entry *re, *re1; in rename_volumes() local 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() 738 err = PTR_ERR(re->desc); in rename_volumes() 741 kfree(re); in rename_volumes() 746 if (re->desc->vol->name_len == name_len && in rename_volumes() 747 !memcmp(re->desc->vol->name, name, name_len)) { in rename_volumes() 748 ubi_close_volume(re->desc); in rename_volumes() [all …]
|
/Linux-v6.1/tools/perf/arch/x86/util/ |
D | header.c | 97 regex_t re; in strcmp_cpuid_str() local 113 if (regcomp(&re, mapcpuid, REG_EXTENDED) != 0) { in strcmp_cpuid_str() 119 match = !regexec(&re, id, 1, pmatch, 0); in strcmp_cpuid_str() 120 regfree(&re); in strcmp_cpuid_str()
|
/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/trace/postprocess/ |
D | decode_msr.py | 5 import re 11 m = re.match(r'#define (MSR_\w+)\s+(0x[0-9a-fA-F]+)', j) 22 m = re.search(r'(read|write)_msr:\s+([0-9a-f]+)', j)
|
/Linux-v6.1/drivers/net/ethernet/cavium/octeon/ |
D | octeon_mgmt.c | 217 union mgmt_port_ring_entry re; in octeon_mgmt_rx_fill_ring() local 229 re.d64 = 0; in octeon_mgmt_rx_fill_ring() 230 re.s.len = size; in octeon_mgmt_rx_fill_ring() 231 re.s.addr = dma_map_single(p->dev, skb->data, in octeon_mgmt_rx_fill_ring() 236 p->rx_ring[p->rx_next_fill] = re.d64; in octeon_mgmt_rx_fill_ring() 256 union mgmt_port_ring_entry re; in octeon_mgmt_clean_tx_buffers() local 276 re.d64 = p->tx_ring[p->tx_next_clean]; in octeon_mgmt_clean_tx_buffers() 290 dma_unmap_single(p->dev, re.s.addr, re.s.len, in octeon_mgmt_clean_tx_buffers() 294 if (unlikely(re.s.tstamp)) { in octeon_mgmt_clean_tx_buffers() 372 union mgmt_port_ring_entry re; in octeon_mgmt_dequeue_rx_buffer() local [all …]
|
/Linux-v6.1/arch/ia64/scripts/ |
D | unwcheck.py | 15 import re 24 start_pattern = re.compile("<([^>]*)>: \[0x([0-9a-f]+)-0x([0-9a-f]+)\]") 25 rlen_pattern = re.compile(".*rlen=([0-9]+)")
|
/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.
|