Lines Matching refs:m_num_mds
26 if (1 == m->m_num_mds && m->m_info[0].state > 0) in ceph_mdsmap_get_random_mds()
30 for (i = 0; i < m->m_num_mds; i++) in ceph_mdsmap_get_random_mds()
139 m->m_num_mds = m->m_max_mds; in ceph_mdsmap_decode()
141 m->m_info = kcalloc(m->m_num_mds, sizeof(*m->m_info), GFP_NOFS); in ceph_mdsmap_decode()
215 if (mds >= m->m_num_mds) { in ceph_mdsmap_decode()
216 int new_num = max(mds + 1, m->m_num_mds * 2); in ceph_mdsmap_decode()
223 m->m_num_mds = new_num; in ceph_mdsmap_decode()
245 if (m->m_num_mds > m->m_max_mds) { in ceph_mdsmap_decode()
247 for (i = m->m_num_mds; i >= m->m_max_mds; i--) { in ceph_mdsmap_decode()
251 m->m_num_mds = i; in ceph_mdsmap_decode()
294 if (mds >= 0 && mds < m->m_num_mds) { in ceph_mdsmap_decode()
301 if (n > m->m_num_mds) { in ceph_mdsmap_decode()
309 m->m_num_mds = n; in ceph_mdsmap_decode()
375 for (i = 0; i < m->m_num_mds; i++) in ceph_mdsmap_destroy()
391 for (i = 0; i < m->m_num_mds; i++) { in ceph_mdsmap_is_cluster_available()