Home
last modified time | relevance | path

Searched refs:fast (Results 1 – 10 of 10) sorted by relevance

/fs/afs/
Dfs_probe.c22 struct afs_server *server, bool fast) in afs_schedule_fs_probe() argument
30 atj += fast ? afs_fs_probe_fast_poll_interval : afs_fs_probe_slow_poll_interval; in afs_schedule_fs_probe()
359 struct afs_server *fast, *slow, *server; in afs_fs_probe_dispatcher() local
379 fast = slow = server = NULL; in afs_fs_probe_dispatcher()
384 fast = list_first_entry(&net->fs_probe_fast, struct afs_server, probe_link); in afs_fs_probe_dispatcher()
385 poll_at = fast->probed_at + afs_fs_probe_fast_poll_interval; in afs_fs_probe_dispatcher()
389 fast = NULL; in afs_fs_probe_dispatcher()
404 server = fast ?: slow; in afs_fs_probe_dispatcher()
409 afs_dispatch_fs_probe(net, server, server == fast); in afs_fs_probe_dispatcher()
/fs/hpfs/
Dhpfs.h122 u8 fast: 1; /* partition was fast formatted */ member
128 u8 fast: 1; /* partition was fast formatted */ member
/fs/cachefiles/
DKconfig8 filesystems - primarily networking filesystems - thus allowing fast
/fs/jffs2/
DTODO11 - checkpointing (do we need this? scan is quite fast)
/fs/reiserfs/
DKconfig12 In general, ReiserFS is as fast as ext2, but is very efficient with
/fs/proc/
DKconfig97 Provides a fast way to retrieve first level children pids of a task. See
/fs/ubifs/
Dbudget.c477 if (req->fast) { in ubifs_budget_space()
Dfile.c328 struct ubifs_budget_req req = { .fast = 1 }; in allocate_budget()
Dubifs.h885 unsigned int fast:1; member
/fs/befs/
DChangeLog231 to be about as fast (even though it has to look up each file block