Home
last modified time | relevance | path

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

/linux-6.15/fs/jffs2/
H A Dcompr_rtime.c88 int backoffs; in jffs2_rtime_decompress() local
94 backoffs = positions[value]; in jffs2_rtime_decompress()
101 if (backoffs + repeat >= outpos) { in jffs2_rtime_decompress()
103 cpage_out[outpos++] = cpage_out[backoffs++]; in jffs2_rtime_decompress()
107 memcpy(&cpage_out[outpos],&cpage_out[backoffs],repeat); in jffs2_rtime_decompress()
/linux-6.15/include/linux/ceph/
H A Dosd_client.h365 struct rb_root backoffs; member
/linux-6.15/net/ceph/
H A Dosd_client.c1721 spg->backoffs = RB_ROOT; in alloc_spg_mapping()
1728 WARN_ON(!RB_EMPTY_ROOT(&spg->backoffs)); in free_spg_mapping()
1974 while (!RB_EMPTY_ROOT(&spg->backoffs)) { in DEFINE_RB_FUNCS()
1976 rb_entry(rb_first(&spg->backoffs), in DEFINE_RB_FUNCS()
1979 erase_backoff(&spg->backoffs, backoff); in DEFINE_RB_FUNCS()
2024 backoff = lookup_containing_backoff(&spg->backoffs, &hoid); in should_plug_request()
4423 insert_backoff(&spg->backoffs, backoff); in handle_backoff_block()
4479 erase_backoff(&spg->backoffs, backoff); in handle_backoff_unblock()
4483 if (RB_EMPTY_ROOT(&spg->backoffs)) { in handle_backoff_unblock()
/linux-6.15/Documentation/locking/
H A Dww-mutex-design.rst48 However, the Wound-Wait algorithm is typically stated to generate fewer backoffs