Home
last modified time | relevance | path

Searched refs:s (Results 1 – 4 of 4) sorted by relevance

/init/
Ddo_mounts.c189 char s[32]; in devt_from_devname() local
194 strcpy(s, name); in devt_from_devname()
195 for (p = s; *p; p++) { in devt_from_devname()
200 devt = blk_lookup_devt(s, 0); in devt_from_devname()
208 while (p > s && isdigit(p[-1])) in devt_from_devname()
210 if (p == s || !*p || *p == '0') in devt_from_devname()
216 devt = blk_lookup_devt(s, part); in devt_from_devname()
221 if (p < s + 2 || !isdigit(p[-2]) || p[-1] != 'p') in devt_from_devname()
224 return blk_lookup_devt(s, part); in devt_from_devname()
361 struct super_block *s; in do_mount_root() local
[all …]
Dinitramfs.c170 static void __init parse_header(char *s) in parse_header() argument
177 for (i = 0, s += 6; i < 12; i++, s += 8) { in parse_header()
178 memcpy(buf, s, 8); in parse_header()
Dinit_task.c147 .rcu_read_unlock_special.s = 0,
158 .trc_reader_special.s = 0,
DKconfig211 build is unique between builds. It's safe to leave the default.
280 This compression algorithm's ratio is best. Decompression speed
389 section 6.4 of the Linux Programmer's Guide, available from
611 in pages. Such statistics can help in setting a task's priorities
869 it's always possible to reduce the margin by increasing the number of
1065 since the PIDs limit only affects a process's ability to fork, not to
1076 hierarchy is allowed even if can cross the hierarchy's limit.
2030 This is taken advantage of by uClibc's malloc(), and also by
2031 ELF-FDPIC binfmt's brk and stack allocator.
2286 For modules inside an initrd or initramfs, it's more efficient to
[all …]