Home
last modified time | relevance | path

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

/openbmc/linux/include/linux/ceph/
H A Dmdsmap.h37 u32 possible_max_rank; /* possible max rank index */ member
53 if (w >= m->possible_max_rank) in ceph_mdsmap_get_addr()
61 if (w >= m->possible_max_rank) in ceph_mdsmap_get_state()
68 if (w >= 0 && w < m->possible_max_rank) in ceph_mdsmap_is_laggy()
/openbmc/linux/fs/ceph/
H A Dmdsmap.c25 for (i = 0; i < m->possible_max_rank; i++) in __mdsmap_get_random_mds()
33 for (j = 0, i = 0; i < m->possible_max_rank; i++) { in __mdsmap_get_random_mds()
51 if (mds == m->possible_max_rank || mds == -1) in ceph_mdsmap_get_random_mds()
54 return mds == m->possible_max_rank ? -1 : mds; in ceph_mdsmap_get_random_mds()
168 m->possible_max_rank = max(m->m_num_active_mds, m->m_max_mds); in ceph_mdsmap_decode()
243 if (mds < 0 || mds >= m->possible_max_rank) { in ceph_mdsmap_decode()
314 if (mds >= 0 && mds < m->possible_max_rank) { in ceph_mdsmap_decode()
321 if (n > m->possible_max_rank) { in ceph_mdsmap_decode()
329 m->possible_max_rank = n; in ceph_mdsmap_decode()
416 for (i = 0; i < m->possible_max_rank; i++) in ceph_mdsmap_destroy()
[all …]
H A Ddebugfs.c39 for (i = 0; i < mdsmap->possible_max_rank; i++) { in mdsmap_show()
H A Dmds_client.c965 if (mds >= mdsc->mdsmap->possible_max_rank) in register_session()
1706 if (mds >= mdsc->mdsmap->possible_max_rank) in __open_export_target_sessions()
4737 for (i = 0; i < newmap->possible_max_rank; i++) { in check_new_map()
4743 for (i = 0; i < oldmap->possible_max_rank && i < mdsc->max_sessions; i++) { in check_new_map()
4757 if (i >= newmap->possible_max_rank) { in check_new_map()
4822 for (i = 0; i < newmap->possible_max_rank; i++) { in check_new_map()
4864 for (i = 0; i < newmap->possible_max_rank && i < mdsc->max_sessions; i++) { in check_new_map()