mdsmap.c 4.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183
  1. #include <linux/ceph/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 <linux/ceph/mdsmap.h>
  8. #include <linux/ceph/messenger.h>
  9. #include <linux/ceph/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. const void *start = *p;
  44. int i, j, n;
  45. int err = -EINVAL;
  46. u16 version;
  47. m = kzalloc(sizeof(*m), GFP_NOFS);
  48. if (m == NULL)
  49. return ERR_PTR(-ENOMEM);
  50. ceph_decode_16_safe(p, end, version, bad);
  51. if (version > 3) {
  52. pr_warning("got mdsmap version %d > 3, failing", version);
  53. goto bad;
  54. }
  55. ceph_decode_need(p, end, 8*sizeof(u32) + sizeof(u64), bad);
  56. m->m_epoch = ceph_decode_32(p);
  57. m->m_client_epoch = ceph_decode_32(p);
  58. m->m_last_failure = ceph_decode_32(p);
  59. m->m_root = ceph_decode_32(p);
  60. m->m_session_timeout = ceph_decode_32(p);
  61. m->m_session_autoclose = ceph_decode_32(p);
  62. m->m_max_file_size = ceph_decode_64(p);
  63. m->m_max_mds = ceph_decode_32(p);
  64. m->m_info = kcalloc(m->m_max_mds, sizeof(*m->m_info), GFP_NOFS);
  65. if (m->m_info == NULL)
  66. goto badmem;
  67. /* pick out active nodes from mds_info (state > 0) */
  68. n = ceph_decode_32(p);
  69. for (i = 0; i < n; i++) {
  70. u64 global_id;
  71. u32 namelen;
  72. s32 mds, inc, state;
  73. u64 state_seq;
  74. u8 infoversion;
  75. struct ceph_entity_addr addr;
  76. u32 num_export_targets;
  77. void *pexport_targets = NULL;
  78. struct ceph_timespec laggy_since;
  79. ceph_decode_need(p, end, sizeof(u64)*2 + 1 + sizeof(u32), bad);
  80. global_id = ceph_decode_64(p);
  81. infoversion = ceph_decode_8(p);
  82. *p += sizeof(u64);
  83. namelen = ceph_decode_32(p); /* skip mds name */
  84. *p += namelen;
  85. ceph_decode_need(p, end,
  86. 4*sizeof(u32) + sizeof(u64) +
  87. sizeof(addr) + sizeof(struct ceph_timespec),
  88. bad);
  89. mds = ceph_decode_32(p);
  90. inc = ceph_decode_32(p);
  91. state = ceph_decode_32(p);
  92. state_seq = ceph_decode_64(p);
  93. ceph_decode_copy(p, &addr, sizeof(addr));
  94. ceph_decode_addr(&addr);
  95. ceph_decode_copy(p, &laggy_since, sizeof(laggy_since));
  96. *p += sizeof(u32);
  97. ceph_decode_32_safe(p, end, namelen, bad);
  98. *p += namelen;
  99. if (infoversion >= 2) {
  100. ceph_decode_32_safe(p, end, num_export_targets, bad);
  101. pexport_targets = *p;
  102. *p += num_export_targets * sizeof(u32);
  103. } else {
  104. num_export_targets = 0;
  105. }
  106. dout("mdsmap_decode %d/%d %lld mds%d.%d %s %s\n",
  107. i+1, n, global_id, mds, inc,
  108. ceph_pr_addr(&addr.in_addr),
  109. ceph_mds_state_name(state));
  110. if (mds >= 0 && mds < m->m_max_mds && state > 0) {
  111. m->m_info[mds].global_id = global_id;
  112. m->m_info[mds].state = state;
  113. m->m_info[mds].addr = addr;
  114. m->m_info[mds].laggy =
  115. (laggy_since.tv_sec != 0 ||
  116. laggy_since.tv_nsec != 0);
  117. m->m_info[mds].num_export_targets = num_export_targets;
  118. if (num_export_targets) {
  119. m->m_info[mds].export_targets =
  120. kcalloc(num_export_targets, sizeof(u32),
  121. GFP_NOFS);
  122. for (j = 0; j < num_export_targets; j++)
  123. m->m_info[mds].export_targets[j] =
  124. ceph_decode_32(&pexport_targets);
  125. } else {
  126. m->m_info[mds].export_targets = NULL;
  127. }
  128. }
  129. }
  130. /* pg_pools */
  131. ceph_decode_32_safe(p, end, n, bad);
  132. m->m_num_data_pg_pools = n;
  133. m->m_data_pg_pools = kcalloc(n, sizeof(u64), GFP_NOFS);
  134. if (!m->m_data_pg_pools)
  135. goto badmem;
  136. ceph_decode_need(p, end, sizeof(u64)*(n+1), bad);
  137. for (i = 0; i < n; i++)
  138. m->m_data_pg_pools[i] = ceph_decode_64(p);
  139. m->m_cas_pg_pool = ceph_decode_64(p);
  140. /* ok, we don't care about the rest. */
  141. dout("mdsmap_decode success epoch %u\n", m->m_epoch);
  142. return m;
  143. badmem:
  144. err = -ENOMEM;
  145. bad:
  146. pr_err("corrupt mdsmap\n");
  147. print_hex_dump(KERN_DEBUG, "mdsmap: ",
  148. DUMP_PREFIX_OFFSET, 16, 1,
  149. start, end - start, true);
  150. ceph_mdsmap_destroy(m);
  151. return ERR_PTR(-EINVAL);
  152. }
  153. void ceph_mdsmap_destroy(struct ceph_mdsmap *m)
  154. {
  155. int i;
  156. for (i = 0; i < m->m_max_mds; i++)
  157. kfree(m->m_info[i].export_targets);
  158. kfree(m->m_info);
  159. kfree(m->m_data_pg_pools);
  160. kfree(m);
  161. }