Home
last modified time | relevance | path

Searched refs:choose_tries (Results 1 - 6 of 6) sorted by relevance

/kernel/linux/linux-5.10/net/ceph/crush/
H A Dmapper.c629 if (map->choose_tries && ftotal <= map->choose_total_tries) in crush_choose_firstn()
630 map->choose_tries[ftotal]++; in crush_choose_firstn()
816 if (map->choose_tries && ftotal <= map->choose_total_tries) in crush_choose_indep()
817 map->choose_tries[ftotal]++; in crush_choose_indep()
919 int choose_tries = map->choose_total_tries + 1; in crush_do_rule() local
959 choose_tries = curstep->arg1; in crush_do_rule()
1029 recurse_tries = choose_tries; in crush_do_rule()
1039 choose_tries, in crush_do_rule()
1060 choose_tries, in crush_do_rule()
H A Dcrush.c130 kfree(map->choose_tries); in crush_destroy()
/kernel/linux/linux-6.6/net/ceph/crush/
H A Dmapper.c629 if (map->choose_tries && ftotal <= map->choose_total_tries) in crush_choose_firstn()
630 map->choose_tries[ftotal]++; in crush_choose_firstn()
816 if (map->choose_tries && ftotal <= map->choose_total_tries) in crush_choose_indep()
817 map->choose_tries[ftotal]++; in crush_choose_indep()
918 int choose_tries = map->choose_total_tries + 1; in crush_do_rule() local
958 choose_tries = curstep->arg1; in crush_do_rule()
1028 recurse_tries = choose_tries; in crush_do_rule()
1038 choose_tries, in crush_do_rule()
1059 choose_tries, in crush_do_rule()
H A Dcrush.c130 kfree(map->choose_tries); in crush_destroy()
/kernel/linux/linux-5.10/include/linux/crush/
H A Dcrush.h302 __u32 *choose_tries; member
/kernel/linux/linux-6.6/include/linux/crush/
H A Dcrush.h302 __u32 *choose_tries; member

Completed in 6 milliseconds