mdsmap.c 3.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166
  1. #include "ceph_debug.h"
  2. #include <linux/bug.h>
  3. #include <linux/err.h>
  4. #include <linux/random.h>
  5. #include <linux/slab.h>
  6. #include <linux/types.h>
  7. #include "mdsmap.h"
  8. #include "messenger.h"
  9. #include "decode.h"
  10. #include "super.h"
  11. /*
  12. * choose a random mds that is "up" (i.e. has a state > 0), or -1.
  13. */
  14. int ceph_mdsmap_get_random_mds(struct ceph_mdsmap *m)
  15. {
  16. int n = 0;
  17. int i;
  18. char r;
  19. /* count */
  20. for (i = 0; i < m->m_max_mds; i++)
  21. if (m->m_info[i].state > 0)
  22. n++;
  23. if (n == 0)
  24. return -1;
  25. /* pick */
  26. get_random_bytes(&r, 1);
  27. n = r % n;
  28. i = 0;
  29. for (i = 0; n > 0; i++, n--)
  30. while (m->m_info[i].state <= 0)
  31. i++;
  32. return i;
  33. }
  34. /*
  35. * Decode an MDS map
  36. *
  37. * Ignore any fields we don't care about (there are quite a few of
  38. * them).
  39. */
  40. struct ceph_mdsmap *ceph_mdsmap_decode(void **p, void *end)
  41. {
  42. struct ceph_mdsmap *m;
  43. int i, j, n;
  44. int err = -EINVAL;
  45. u16 version;
  46. m = kzalloc(sizeof(*m), GFP_NOFS);
  47. if (m == NULL)
  48. return ERR_PTR(-ENOMEM);
  49. ceph_decode_16_safe(p, end, version, bad);
  50. ceph_decode_need(p, end, 8*sizeof(u32) + sizeof(u64), bad);
  51. ceph_decode_32(p, m->m_epoch);
  52. ceph_decode_32(p, m->m_client_epoch);
  53. ceph_decode_32(p, m->m_last_failure);
  54. ceph_decode_32(p, m->m_root);
  55. ceph_decode_32(p, m->m_session_timeout);
  56. ceph_decode_32(p, m->m_session_autoclose);
  57. ceph_decode_64(p, m->m_max_file_size);
  58. ceph_decode_32(p, m->m_max_mds);
  59. m->m_info = kcalloc(m->m_max_mds, sizeof(*m->m_info), GFP_NOFS);
  60. if (m->m_info == NULL)
  61. goto badmem;
  62. /* pick out active nodes from mds_info (state > 0) */
  63. ceph_decode_32(p, n);
  64. for (i = 0; i < n; i++) {
  65. u32 namelen;
  66. s32 mds, inc, state;
  67. u64 state_seq;
  68. u8 infoversion;
  69. struct ceph_entity_addr addr;
  70. u32 num_export_targets;
  71. void *pexport_targets = NULL;
  72. ceph_decode_need(p, end, sizeof(addr) + 1 + sizeof(u32), bad);
  73. ceph_decode_copy(p, &addr, sizeof(addr));
  74. ceph_decode_8(p, infoversion);
  75. ceph_decode_32(p, namelen); /* skip mds name */
  76. *p += namelen;
  77. ceph_decode_need(p, end,
  78. 4*sizeof(u32) + sizeof(u64) +
  79. sizeof(addr) + sizeof(struct ceph_timespec),
  80. bad);
  81. ceph_decode_32(p, mds);
  82. ceph_decode_32(p, inc);
  83. ceph_decode_32(p, state);
  84. ceph_decode_64(p, state_seq);
  85. *p += sizeof(addr);
  86. *p += sizeof(struct ceph_timespec);
  87. *p += sizeof(u32);
  88. ceph_decode_32_safe(p, end, namelen, bad);
  89. *p += namelen;
  90. if (infoversion >= 2) {
  91. ceph_decode_32_safe(p, end, num_export_targets, bad);
  92. pexport_targets = *p;
  93. *p += num_export_targets * sizeof(u32);
  94. } else {
  95. num_export_targets = 0;
  96. }
  97. dout("mdsmap_decode %d/%d mds%d.%d %s %s\n",
  98. i+1, n, mds, inc, pr_addr(&addr.in_addr),
  99. ceph_mds_state_name(state));
  100. if (mds >= 0 && mds < m->m_max_mds && state > 0) {
  101. m->m_info[mds].state = state;
  102. m->m_info[mds].addr = addr;
  103. m->m_info[mds].num_export_targets = num_export_targets;
  104. if (num_export_targets) {
  105. m->m_info[mds].export_targets =
  106. kcalloc(num_export_targets, sizeof(u32),
  107. GFP_NOFS);
  108. for (j = 0; j < num_export_targets; j++)
  109. ceph_decode_32(&pexport_targets,
  110. m->m_info[mds].export_targets[j]);
  111. } else {
  112. m->m_info[mds].export_targets = NULL;
  113. }
  114. }
  115. }
  116. /* pg_pools */
  117. ceph_decode_32_safe(p, end, n, bad);
  118. m->m_num_data_pg_pools = n;
  119. m->m_data_pg_pools = kcalloc(n, sizeof(u32), GFP_NOFS);
  120. if (!m->m_data_pg_pools)
  121. goto badmem;
  122. ceph_decode_need(p, end, sizeof(u32)*(n+1), bad);
  123. for (i = 0; i < n; i++)
  124. ceph_decode_32(p, m->m_data_pg_pools[i]);
  125. ceph_decode_32(p, m->m_cas_pg_pool);
  126. /* ok, we don't care about the rest. */
  127. dout("mdsmap_decode success epoch %u\n", m->m_epoch);
  128. return m;
  129. badmem:
  130. err = -ENOMEM;
  131. bad:
  132. pr_err("corrupt mdsmap\n");
  133. ceph_mdsmap_destroy(m);
  134. return ERR_PTR(-EINVAL);
  135. }
  136. void ceph_mdsmap_destroy(struct ceph_mdsmap *m)
  137. {
  138. int i;
  139. for (i = 0; i < m->m_max_mds; i++)
  140. kfree(m->m_info[i].export_targets);
  141. kfree(m->m_info);
  142. kfree(m->m_data_pg_pools);
  143. kfree(m);
  144. }