/net/ceph/osd_client.c

http://github.com/mirrors/linux · C · 5594 lines · 4352 code · 848 blank · 394 comment · 581 complexity · 677125c21d0d3db4d8aba12fbc13c94e MD5 · raw file

Large files are truncated click here to view the full file

  1. // SPDX-License-Identifier: GPL-2.0
  2. #include <linux/ceph/ceph_debug.h>
  3. #include <linux/module.h>
  4. #include <linux/err.h>
  5. #include <linux/highmem.h>
  6. #include <linux/mm.h>
  7. #include <linux/pagemap.h>
  8. #include <linux/slab.h>
  9. #include <linux/uaccess.h>
  10. #ifdef CONFIG_BLOCK
  11. #include <linux/bio.h>
  12. #endif
  13. #include <linux/ceph/ceph_features.h>
  14. #include <linux/ceph/libceph.h>
  15. #include <linux/ceph/osd_client.h>
  16. #include <linux/ceph/messenger.h>
  17. #include <linux/ceph/decode.h>
  18. #include <linux/ceph/auth.h>
  19. #include <linux/ceph/pagelist.h>
  20. #include <linux/ceph/striper.h>
  21. #define OSD_OPREPLY_FRONT_LEN 512
  22. static struct kmem_cache *ceph_osd_request_cache;
  23. static const struct ceph_connection_operations osd_con_ops;
  24. /*
  25. * Implement client access to distributed object storage cluster.
  26. *
  27. * All data objects are stored within a cluster/cloud of OSDs, or
  28. * "object storage devices." (Note that Ceph OSDs have _nothing_ to
  29. * do with the T10 OSD extensions to SCSI.) Ceph OSDs are simply
  30. * remote daemons serving up and coordinating consistent and safe
  31. * access to storage.
  32. *
  33. * Cluster membership and the mapping of data objects onto storage devices
  34. * are described by the osd map.
  35. *
  36. * We keep track of pending OSD requests (read, write), resubmit
  37. * requests to different OSDs when the cluster topology/data layout
  38. * change, or retry the affected requests when the communications
  39. * channel with an OSD is reset.
  40. */
  41. static void link_request(struct ceph_osd *osd, struct ceph_osd_request *req);
  42. static void unlink_request(struct ceph_osd *osd, struct ceph_osd_request *req);
  43. static void link_linger(struct ceph_osd *osd,
  44. struct ceph_osd_linger_request *lreq);
  45. static void unlink_linger(struct ceph_osd *osd,
  46. struct ceph_osd_linger_request *lreq);
  47. static void clear_backoffs(struct ceph_osd *osd);
  48. #if 1
  49. static inline bool rwsem_is_wrlocked(struct rw_semaphore *sem)
  50. {
  51. bool wrlocked = true;
  52. if (unlikely(down_read_trylock(sem))) {
  53. wrlocked = false;
  54. up_read(sem);
  55. }
  56. return wrlocked;
  57. }
  58. static inline void verify_osdc_locked(struct ceph_osd_client *osdc)
  59. {
  60. WARN_ON(!rwsem_is_locked(&osdc->lock));
  61. }
  62. static inline void verify_osdc_wrlocked(struct ceph_osd_client *osdc)
  63. {
  64. WARN_ON(!rwsem_is_wrlocked(&osdc->lock));
  65. }
  66. static inline void verify_osd_locked(struct ceph_osd *osd)
  67. {
  68. struct ceph_osd_client *osdc = osd->o_osdc;
  69. WARN_ON(!(mutex_is_locked(&osd->lock) &&
  70. rwsem_is_locked(&osdc->lock)) &&
  71. !rwsem_is_wrlocked(&osdc->lock));
  72. }
  73. static inline void verify_lreq_locked(struct ceph_osd_linger_request *lreq)
  74. {
  75. WARN_ON(!mutex_is_locked(&lreq->lock));
  76. }
  77. #else
  78. static inline void verify_osdc_locked(struct ceph_osd_client *osdc) { }
  79. static inline void verify_osdc_wrlocked(struct ceph_osd_client *osdc) { }
  80. static inline void verify_osd_locked(struct ceph_osd *osd) { }
  81. static inline void verify_lreq_locked(struct ceph_osd_linger_request *lreq) { }
  82. #endif
  83. /*
  84. * calculate the mapping of a file extent onto an object, and fill out the
  85. * request accordingly. shorten extent as necessary if it crosses an
  86. * object boundary.
  87. *
  88. * fill osd op in request message.
  89. */
  90. static int calc_layout(struct ceph_file_layout *layout, u64 off, u64 *plen,
  91. u64 *objnum, u64 *objoff, u64 *objlen)
  92. {
  93. u64 orig_len = *plen;
  94. u32 xlen;
  95. /* object extent? */
  96. ceph_calc_file_object_mapping(layout, off, orig_len, objnum,
  97. objoff, &xlen);
  98. *objlen = xlen;
  99. if (*objlen < orig_len) {
  100. *plen = *objlen;
  101. dout(" skipping last %llu, final file extent %llu~%llu\n",
  102. orig_len - *plen, off, *plen);
  103. }
  104. dout("calc_layout objnum=%llx %llu~%llu\n", *objnum, *objoff, *objlen);
  105. return 0;
  106. }
  107. static void ceph_osd_data_init(struct ceph_osd_data *osd_data)
  108. {
  109. memset(osd_data, 0, sizeof (*osd_data));
  110. osd_data->type = CEPH_OSD_DATA_TYPE_NONE;
  111. }
  112. /*
  113. * Consumes @pages if @own_pages is true.
  114. */
  115. static void ceph_osd_data_pages_init(struct ceph_osd_data *osd_data,
  116. struct page **pages, u64 length, u32 alignment,
  117. bool pages_from_pool, bool own_pages)
  118. {
  119. osd_data->type = CEPH_OSD_DATA_TYPE_PAGES;
  120. osd_data->pages = pages;
  121. osd_data->length = length;
  122. osd_data->alignment = alignment;
  123. osd_data->pages_from_pool = pages_from_pool;
  124. osd_data->own_pages = own_pages;
  125. }
  126. /*
  127. * Consumes a ref on @pagelist.
  128. */
  129. static void ceph_osd_data_pagelist_init(struct ceph_osd_data *osd_data,
  130. struct ceph_pagelist *pagelist)
  131. {
  132. osd_data->type = CEPH_OSD_DATA_TYPE_PAGELIST;
  133. osd_data->pagelist = pagelist;
  134. }
  135. #ifdef CONFIG_BLOCK
  136. static void ceph_osd_data_bio_init(struct ceph_osd_data *osd_data,
  137. struct ceph_bio_iter *bio_pos,
  138. u32 bio_length)
  139. {
  140. osd_data->type = CEPH_OSD_DATA_TYPE_BIO;
  141. osd_data->bio_pos = *bio_pos;
  142. osd_data->bio_length = bio_length;
  143. }
  144. #endif /* CONFIG_BLOCK */
  145. static void ceph_osd_data_bvecs_init(struct ceph_osd_data *osd_data,
  146. struct ceph_bvec_iter *bvec_pos,
  147. u32 num_bvecs)
  148. {
  149. osd_data->type = CEPH_OSD_DATA_TYPE_BVECS;
  150. osd_data->bvec_pos = *bvec_pos;
  151. osd_data->num_bvecs = num_bvecs;
  152. }
  153. static struct ceph_osd_data *
  154. osd_req_op_raw_data_in(struct ceph_osd_request *osd_req, unsigned int which)
  155. {
  156. BUG_ON(which >= osd_req->r_num_ops);
  157. return &osd_req->r_ops[which].raw_data_in;
  158. }
  159. struct ceph_osd_data *
  160. osd_req_op_extent_osd_data(struct ceph_osd_request *osd_req,
  161. unsigned int which)
  162. {
  163. return osd_req_op_data(osd_req, which, extent, osd_data);
  164. }
  165. EXPORT_SYMBOL(osd_req_op_extent_osd_data);
  166. void osd_req_op_raw_data_in_pages(struct ceph_osd_request *osd_req,
  167. unsigned int which, struct page **pages,
  168. u64 length, u32 alignment,
  169. bool pages_from_pool, bool own_pages)
  170. {
  171. struct ceph_osd_data *osd_data;
  172. osd_data = osd_req_op_raw_data_in(osd_req, which);
  173. ceph_osd_data_pages_init(osd_data, pages, length, alignment,
  174. pages_from_pool, own_pages);
  175. }
  176. EXPORT_SYMBOL(osd_req_op_raw_data_in_pages);
  177. void osd_req_op_extent_osd_data_pages(struct ceph_osd_request *osd_req,
  178. unsigned int which, struct page **pages,
  179. u64 length, u32 alignment,
  180. bool pages_from_pool, bool own_pages)
  181. {
  182. struct ceph_osd_data *osd_data;
  183. osd_data = osd_req_op_data(osd_req, which, extent, osd_data);
  184. ceph_osd_data_pages_init(osd_data, pages, length, alignment,
  185. pages_from_pool, own_pages);
  186. }
  187. EXPORT_SYMBOL(osd_req_op_extent_osd_data_pages);
  188. void osd_req_op_extent_osd_data_pagelist(struct ceph_osd_request *osd_req,
  189. unsigned int which, struct ceph_pagelist *pagelist)
  190. {
  191. struct ceph_osd_data *osd_data;
  192. osd_data = osd_req_op_data(osd_req, which, extent, osd_data);
  193. ceph_osd_data_pagelist_init(osd_data, pagelist);
  194. }
  195. EXPORT_SYMBOL(osd_req_op_extent_osd_data_pagelist);
  196. #ifdef CONFIG_BLOCK
  197. void osd_req_op_extent_osd_data_bio(struct ceph_osd_request *osd_req,
  198. unsigned int which,
  199. struct ceph_bio_iter *bio_pos,
  200. u32 bio_length)
  201. {
  202. struct ceph_osd_data *osd_data;
  203. osd_data = osd_req_op_data(osd_req, which, extent, osd_data);
  204. ceph_osd_data_bio_init(osd_data, bio_pos, bio_length);
  205. }
  206. EXPORT_SYMBOL(osd_req_op_extent_osd_data_bio);
  207. #endif /* CONFIG_BLOCK */
  208. void osd_req_op_extent_osd_data_bvecs(struct ceph_osd_request *osd_req,
  209. unsigned int which,
  210. struct bio_vec *bvecs, u32 num_bvecs,
  211. u32 bytes)
  212. {
  213. struct ceph_osd_data *osd_data;
  214. struct ceph_bvec_iter it = {
  215. .bvecs = bvecs,
  216. .iter = { .bi_size = bytes },
  217. };
  218. osd_data = osd_req_op_data(osd_req, which, extent, osd_data);
  219. ceph_osd_data_bvecs_init(osd_data, &it, num_bvecs);
  220. }
  221. EXPORT_SYMBOL(osd_req_op_extent_osd_data_bvecs);
  222. void osd_req_op_extent_osd_data_bvec_pos(struct ceph_osd_request *osd_req,
  223. unsigned int which,
  224. struct ceph_bvec_iter *bvec_pos)
  225. {
  226. struct ceph_osd_data *osd_data;
  227. osd_data = osd_req_op_data(osd_req, which, extent, osd_data);
  228. ceph_osd_data_bvecs_init(osd_data, bvec_pos, 0);
  229. }
  230. EXPORT_SYMBOL(osd_req_op_extent_osd_data_bvec_pos);
  231. static void osd_req_op_cls_request_info_pagelist(
  232. struct ceph_osd_request *osd_req,
  233. unsigned int which, struct ceph_pagelist *pagelist)
  234. {
  235. struct ceph_osd_data *osd_data;
  236. osd_data = osd_req_op_data(osd_req, which, cls, request_info);
  237. ceph_osd_data_pagelist_init(osd_data, pagelist);
  238. }
  239. void osd_req_op_cls_request_data_pagelist(
  240. struct ceph_osd_request *osd_req,
  241. unsigned int which, struct ceph_pagelist *pagelist)
  242. {
  243. struct ceph_osd_data *osd_data;
  244. osd_data = osd_req_op_data(osd_req, which, cls, request_data);
  245. ceph_osd_data_pagelist_init(osd_data, pagelist);
  246. osd_req->r_ops[which].cls.indata_len += pagelist->length;
  247. osd_req->r_ops[which].indata_len += pagelist->length;
  248. }
  249. EXPORT_SYMBOL(osd_req_op_cls_request_data_pagelist);
  250. void osd_req_op_cls_request_data_pages(struct ceph_osd_request *osd_req,
  251. unsigned int which, struct page **pages, u64 length,
  252. u32 alignment, bool pages_from_pool, bool own_pages)
  253. {
  254. struct ceph_osd_data *osd_data;
  255. osd_data = osd_req_op_data(osd_req, which, cls, request_data);
  256. ceph_osd_data_pages_init(osd_data, pages, length, alignment,
  257. pages_from_pool, own_pages);
  258. osd_req->r_ops[which].cls.indata_len += length;
  259. osd_req->r_ops[which].indata_len += length;
  260. }
  261. EXPORT_SYMBOL(osd_req_op_cls_request_data_pages);
  262. void osd_req_op_cls_request_data_bvecs(struct ceph_osd_request *osd_req,
  263. unsigned int which,
  264. struct bio_vec *bvecs, u32 num_bvecs,
  265. u32 bytes)
  266. {
  267. struct ceph_osd_data *osd_data;
  268. struct ceph_bvec_iter it = {
  269. .bvecs = bvecs,
  270. .iter = { .bi_size = bytes },
  271. };
  272. osd_data = osd_req_op_data(osd_req, which, cls, request_data);
  273. ceph_osd_data_bvecs_init(osd_data, &it, num_bvecs);
  274. osd_req->r_ops[which].cls.indata_len += bytes;
  275. osd_req->r_ops[which].indata_len += bytes;
  276. }
  277. EXPORT_SYMBOL(osd_req_op_cls_request_data_bvecs);
  278. void osd_req_op_cls_response_data_pages(struct ceph_osd_request *osd_req,
  279. unsigned int which, struct page **pages, u64 length,
  280. u32 alignment, bool pages_from_pool, bool own_pages)
  281. {
  282. struct ceph_osd_data *osd_data;
  283. osd_data = osd_req_op_data(osd_req, which, cls, response_data);
  284. ceph_osd_data_pages_init(osd_data, pages, length, alignment,
  285. pages_from_pool, own_pages);
  286. }
  287. EXPORT_SYMBOL(osd_req_op_cls_response_data_pages);
  288. static u64 ceph_osd_data_length(struct ceph_osd_data *osd_data)
  289. {
  290. switch (osd_data->type) {
  291. case CEPH_OSD_DATA_TYPE_NONE:
  292. return 0;
  293. case CEPH_OSD_DATA_TYPE_PAGES:
  294. return osd_data->length;
  295. case CEPH_OSD_DATA_TYPE_PAGELIST:
  296. return (u64)osd_data->pagelist->length;
  297. #ifdef CONFIG_BLOCK
  298. case CEPH_OSD_DATA_TYPE_BIO:
  299. return (u64)osd_data->bio_length;
  300. #endif /* CONFIG_BLOCK */
  301. case CEPH_OSD_DATA_TYPE_BVECS:
  302. return osd_data->bvec_pos.iter.bi_size;
  303. default:
  304. WARN(true, "unrecognized data type %d\n", (int)osd_data->type);
  305. return 0;
  306. }
  307. }
  308. static void ceph_osd_data_release(struct ceph_osd_data *osd_data)
  309. {
  310. if (osd_data->type == CEPH_OSD_DATA_TYPE_PAGES && osd_data->own_pages) {
  311. int num_pages;
  312. num_pages = calc_pages_for((u64)osd_data->alignment,
  313. (u64)osd_data->length);
  314. ceph_release_page_vector(osd_data->pages, num_pages);
  315. } else if (osd_data->type == CEPH_OSD_DATA_TYPE_PAGELIST) {
  316. ceph_pagelist_release(osd_data->pagelist);
  317. }
  318. ceph_osd_data_init(osd_data);
  319. }
  320. static void osd_req_op_data_release(struct ceph_osd_request *osd_req,
  321. unsigned int which)
  322. {
  323. struct ceph_osd_req_op *op;
  324. BUG_ON(which >= osd_req->r_num_ops);
  325. op = &osd_req->r_ops[which];
  326. switch (op->op) {
  327. case CEPH_OSD_OP_READ:
  328. case CEPH_OSD_OP_WRITE:
  329. case CEPH_OSD_OP_WRITEFULL:
  330. ceph_osd_data_release(&op->extent.osd_data);
  331. break;
  332. case CEPH_OSD_OP_CALL:
  333. ceph_osd_data_release(&op->cls.request_info);
  334. ceph_osd_data_release(&op->cls.request_data);
  335. ceph_osd_data_release(&op->cls.response_data);
  336. break;
  337. case CEPH_OSD_OP_SETXATTR:
  338. case CEPH_OSD_OP_CMPXATTR:
  339. ceph_osd_data_release(&op->xattr.osd_data);
  340. break;
  341. case CEPH_OSD_OP_STAT:
  342. ceph_osd_data_release(&op->raw_data_in);
  343. break;
  344. case CEPH_OSD_OP_NOTIFY_ACK:
  345. ceph_osd_data_release(&op->notify_ack.request_data);
  346. break;
  347. case CEPH_OSD_OP_NOTIFY:
  348. ceph_osd_data_release(&op->notify.request_data);
  349. ceph_osd_data_release(&op->notify.response_data);
  350. break;
  351. case CEPH_OSD_OP_LIST_WATCHERS:
  352. ceph_osd_data_release(&op->list_watchers.response_data);
  353. break;
  354. case CEPH_OSD_OP_COPY_FROM2:
  355. ceph_osd_data_release(&op->copy_from.osd_data);
  356. break;
  357. default:
  358. break;
  359. }
  360. }
  361. /*
  362. * Assumes @t is zero-initialized.
  363. */
  364. static void target_init(struct ceph_osd_request_target *t)
  365. {
  366. ceph_oid_init(&t->base_oid);
  367. ceph_oloc_init(&t->base_oloc);
  368. ceph_oid_init(&t->target_oid);
  369. ceph_oloc_init(&t->target_oloc);
  370. ceph_osds_init(&t->acting);
  371. ceph_osds_init(&t->up);
  372. t->size = -1;
  373. t->min_size = -1;
  374. t->osd = CEPH_HOMELESS_OSD;
  375. }
  376. static void target_copy(struct ceph_osd_request_target *dest,
  377. const struct ceph_osd_request_target *src)
  378. {
  379. ceph_oid_copy(&dest->base_oid, &src->base_oid);
  380. ceph_oloc_copy(&dest->base_oloc, &src->base_oloc);
  381. ceph_oid_copy(&dest->target_oid, &src->target_oid);
  382. ceph_oloc_copy(&dest->target_oloc, &src->target_oloc);
  383. dest->pgid = src->pgid; /* struct */
  384. dest->spgid = src->spgid; /* struct */
  385. dest->pg_num = src->pg_num;
  386. dest->pg_num_mask = src->pg_num_mask;
  387. ceph_osds_copy(&dest->acting, &src->acting);
  388. ceph_osds_copy(&dest->up, &src->up);
  389. dest->size = src->size;
  390. dest->min_size = src->min_size;
  391. dest->sort_bitwise = src->sort_bitwise;
  392. dest->flags = src->flags;
  393. dest->paused = src->paused;
  394. dest->epoch = src->epoch;
  395. dest->last_force_resend = src->last_force_resend;
  396. dest->osd = src->osd;
  397. }
  398. static void target_destroy(struct ceph_osd_request_target *t)
  399. {
  400. ceph_oid_destroy(&t->base_oid);
  401. ceph_oloc_destroy(&t->base_oloc);
  402. ceph_oid_destroy(&t->target_oid);
  403. ceph_oloc_destroy(&t->target_oloc);
  404. }
  405. /*
  406. * requests
  407. */
  408. static void request_release_checks(struct ceph_osd_request *req)
  409. {
  410. WARN_ON(!RB_EMPTY_NODE(&req->r_node));
  411. WARN_ON(!RB_EMPTY_NODE(&req->r_mc_node));
  412. WARN_ON(!list_empty(&req->r_private_item));
  413. WARN_ON(req->r_osd);
  414. }
  415. static void ceph_osdc_release_request(struct kref *kref)
  416. {
  417. struct ceph_osd_request *req = container_of(kref,
  418. struct ceph_osd_request, r_kref);
  419. unsigned int which;
  420. dout("%s %p (r_request %p r_reply %p)\n", __func__, req,
  421. req->r_request, req->r_reply);
  422. request_release_checks(req);
  423. if (req->r_request)
  424. ceph_msg_put(req->r_request);
  425. if (req->r_reply)
  426. ceph_msg_put(req->r_reply);
  427. for (which = 0; which < req->r_num_ops; which++)
  428. osd_req_op_data_release(req, which);
  429. target_destroy(&req->r_t);
  430. ceph_put_snap_context(req->r_snapc);
  431. if (req->r_mempool)
  432. mempool_free(req, req->r_osdc->req_mempool);
  433. else if (req->r_num_ops <= CEPH_OSD_SLAB_OPS)
  434. kmem_cache_free(ceph_osd_request_cache, req);
  435. else
  436. kfree(req);
  437. }
  438. void ceph_osdc_get_request(struct ceph_osd_request *req)
  439. {
  440. dout("%s %p (was %d)\n", __func__, req,
  441. kref_read(&req->r_kref));
  442. kref_get(&req->r_kref);
  443. }
  444. EXPORT_SYMBOL(ceph_osdc_get_request);
  445. void ceph_osdc_put_request(struct ceph_osd_request *req)
  446. {
  447. if (req) {
  448. dout("%s %p (was %d)\n", __func__, req,
  449. kref_read(&req->r_kref));
  450. kref_put(&req->r_kref, ceph_osdc_release_request);
  451. }
  452. }
  453. EXPORT_SYMBOL(ceph_osdc_put_request);
  454. static void request_init(struct ceph_osd_request *req)
  455. {
  456. /* req only, each op is zeroed in _osd_req_op_init() */
  457. memset(req, 0, sizeof(*req));
  458. kref_init(&req->r_kref);
  459. init_completion(&req->r_completion);
  460. RB_CLEAR_NODE(&req->r_node);
  461. RB_CLEAR_NODE(&req->r_mc_node);
  462. INIT_LIST_HEAD(&req->r_private_item);
  463. target_init(&req->r_t);
  464. }
  465. /*
  466. * This is ugly, but it allows us to reuse linger registration and ping
  467. * requests, keeping the structure of the code around send_linger{_ping}()
  468. * reasonable. Setting up a min_nr=2 mempool for each linger request
  469. * and dealing with copying ops (this blasts req only, watch op remains
  470. * intact) isn't any better.
  471. */
  472. static void request_reinit(struct ceph_osd_request *req)
  473. {
  474. struct ceph_osd_client *osdc = req->r_osdc;
  475. bool mempool = req->r_mempool;
  476. unsigned int num_ops = req->r_num_ops;
  477. u64 snapid = req->r_snapid;
  478. struct ceph_snap_context *snapc = req->r_snapc;
  479. bool linger = req->r_linger;
  480. struct ceph_msg *request_msg = req->r_request;
  481. struct ceph_msg *reply_msg = req->r_reply;
  482. dout("%s req %p\n", __func__, req);
  483. WARN_ON(kref_read(&req->r_kref) != 1);
  484. request_release_checks(req);
  485. WARN_ON(kref_read(&request_msg->kref) != 1);
  486. WARN_ON(kref_read(&reply_msg->kref) != 1);
  487. target_destroy(&req->r_t);
  488. request_init(req);
  489. req->r_osdc = osdc;
  490. req->r_mempool = mempool;
  491. req->r_num_ops = num_ops;
  492. req->r_snapid = snapid;
  493. req->r_snapc = snapc;
  494. req->r_linger = linger;
  495. req->r_request = request_msg;
  496. req->r_reply = reply_msg;
  497. }
  498. struct ceph_osd_request *ceph_osdc_alloc_request(struct ceph_osd_client *osdc,
  499. struct ceph_snap_context *snapc,
  500. unsigned int num_ops,
  501. bool use_mempool,
  502. gfp_t gfp_flags)
  503. {
  504. struct ceph_osd_request *req;
  505. if (use_mempool) {
  506. BUG_ON(num_ops > CEPH_OSD_SLAB_OPS);
  507. req = mempool_alloc(osdc->req_mempool, gfp_flags);
  508. } else if (num_ops <= CEPH_OSD_SLAB_OPS) {
  509. req = kmem_cache_alloc(ceph_osd_request_cache, gfp_flags);
  510. } else {
  511. BUG_ON(num_ops > CEPH_OSD_MAX_OPS);
  512. req = kmalloc(struct_size(req, r_ops, num_ops), gfp_flags);
  513. }
  514. if (unlikely(!req))
  515. return NULL;
  516. request_init(req);
  517. req->r_osdc = osdc;
  518. req->r_mempool = use_mempool;
  519. req->r_num_ops = num_ops;
  520. req->r_snapid = CEPH_NOSNAP;
  521. req->r_snapc = ceph_get_snap_context(snapc);
  522. dout("%s req %p\n", __func__, req);
  523. return req;
  524. }
  525. EXPORT_SYMBOL(ceph_osdc_alloc_request);
  526. static int ceph_oloc_encoding_size(const struct ceph_object_locator *oloc)
  527. {
  528. return 8 + 4 + 4 + 4 + (oloc->pool_ns ? oloc->pool_ns->len : 0);
  529. }
  530. static int __ceph_osdc_alloc_messages(struct ceph_osd_request *req, gfp_t gfp,
  531. int num_request_data_items,
  532. int num_reply_data_items)
  533. {
  534. struct ceph_osd_client *osdc = req->r_osdc;
  535. struct ceph_msg *msg;
  536. int msg_size;
  537. WARN_ON(req->r_request || req->r_reply);
  538. WARN_ON(ceph_oid_empty(&req->r_base_oid));
  539. WARN_ON(ceph_oloc_empty(&req->r_base_oloc));
  540. /* create request message */
  541. msg_size = CEPH_ENCODING_START_BLK_LEN +
  542. CEPH_PGID_ENCODING_LEN + 1; /* spgid */
  543. msg_size += 4 + 4 + 4; /* hash, osdmap_epoch, flags */
  544. msg_size += CEPH_ENCODING_START_BLK_LEN +
  545. sizeof(struct ceph_osd_reqid); /* reqid */
  546. msg_size += sizeof(struct ceph_blkin_trace_info); /* trace */
  547. msg_size += 4 + sizeof(struct ceph_timespec); /* client_inc, mtime */
  548. msg_size += CEPH_ENCODING_START_BLK_LEN +
  549. ceph_oloc_encoding_size(&req->r_base_oloc); /* oloc */
  550. msg_size += 4 + req->r_base_oid.name_len; /* oid */
  551. msg_size += 2 + req->r_num_ops * sizeof(struct ceph_osd_op);
  552. msg_size += 8; /* snapid */
  553. msg_size += 8; /* snap_seq */
  554. msg_size += 4 + 8 * (req->r_snapc ? req->r_snapc->num_snaps : 0);
  555. msg_size += 4 + 8; /* retry_attempt, features */
  556. if (req->r_mempool)
  557. msg = ceph_msgpool_get(&osdc->msgpool_op, msg_size,
  558. num_request_data_items);
  559. else
  560. msg = ceph_msg_new2(CEPH_MSG_OSD_OP, msg_size,
  561. num_request_data_items, gfp, true);
  562. if (!msg)
  563. return -ENOMEM;
  564. memset(msg->front.iov_base, 0, msg->front.iov_len);
  565. req->r_request = msg;
  566. /* create reply message */
  567. msg_size = OSD_OPREPLY_FRONT_LEN;
  568. msg_size += req->r_base_oid.name_len;
  569. msg_size += req->r_num_ops * sizeof(struct ceph_osd_op);
  570. if (req->r_mempool)
  571. msg = ceph_msgpool_get(&osdc->msgpool_op_reply, msg_size,
  572. num_reply_data_items);
  573. else
  574. msg = ceph_msg_new2(CEPH_MSG_OSD_OPREPLY, msg_size,
  575. num_reply_data_items, gfp, true);
  576. if (!msg)
  577. return -ENOMEM;
  578. req->r_reply = msg;
  579. return 0;
  580. }
  581. static bool osd_req_opcode_valid(u16 opcode)
  582. {
  583. switch (opcode) {
  584. #define GENERATE_CASE(op, opcode, str) case CEPH_OSD_OP_##op: return true;
  585. __CEPH_FORALL_OSD_OPS(GENERATE_CASE)
  586. #undef GENERATE_CASE
  587. default:
  588. return false;
  589. }
  590. }
  591. static void get_num_data_items(struct ceph_osd_request *req,
  592. int *num_request_data_items,
  593. int *num_reply_data_items)
  594. {
  595. struct ceph_osd_req_op *op;
  596. *num_request_data_items = 0;
  597. *num_reply_data_items = 0;
  598. for (op = req->r_ops; op != &req->r_ops[req->r_num_ops]; op++) {
  599. switch (op->op) {
  600. /* request */
  601. case CEPH_OSD_OP_WRITE:
  602. case CEPH_OSD_OP_WRITEFULL:
  603. case CEPH_OSD_OP_SETXATTR:
  604. case CEPH_OSD_OP_CMPXATTR:
  605. case CEPH_OSD_OP_NOTIFY_ACK:
  606. case CEPH_OSD_OP_COPY_FROM2:
  607. *num_request_data_items += 1;
  608. break;
  609. /* reply */
  610. case CEPH_OSD_OP_STAT:
  611. case CEPH_OSD_OP_READ:
  612. case CEPH_OSD_OP_LIST_WATCHERS:
  613. *num_reply_data_items += 1;
  614. break;
  615. /* both */
  616. case CEPH_OSD_OP_NOTIFY:
  617. *num_request_data_items += 1;
  618. *num_reply_data_items += 1;
  619. break;
  620. case CEPH_OSD_OP_CALL:
  621. *num_request_data_items += 2;
  622. *num_reply_data_items += 1;
  623. break;
  624. default:
  625. WARN_ON(!osd_req_opcode_valid(op->op));
  626. break;
  627. }
  628. }
  629. }
  630. /*
  631. * oid, oloc and OSD op opcode(s) must be filled in before this function
  632. * is called.
  633. */
  634. int ceph_osdc_alloc_messages(struct ceph_osd_request *req, gfp_t gfp)
  635. {
  636. int num_request_data_items, num_reply_data_items;
  637. get_num_data_items(req, &num_request_data_items, &num_reply_data_items);
  638. return __ceph_osdc_alloc_messages(req, gfp, num_request_data_items,
  639. num_reply_data_items);
  640. }
  641. EXPORT_SYMBOL(ceph_osdc_alloc_messages);
  642. /*
  643. * This is an osd op init function for opcodes that have no data or
  644. * other information associated with them. It also serves as a
  645. * common init routine for all the other init functions, below.
  646. */
  647. static struct ceph_osd_req_op *
  648. _osd_req_op_init(struct ceph_osd_request *osd_req, unsigned int which,
  649. u16 opcode, u32 flags)
  650. {
  651. struct ceph_osd_req_op *op;
  652. BUG_ON(which >= osd_req->r_num_ops);
  653. BUG_ON(!osd_req_opcode_valid(opcode));
  654. op = &osd_req->r_ops[which];
  655. memset(op, 0, sizeof (*op));
  656. op->op = opcode;
  657. op->flags = flags;
  658. return op;
  659. }
  660. void osd_req_op_init(struct ceph_osd_request *osd_req,
  661. unsigned int which, u16 opcode, u32 flags)
  662. {
  663. (void)_osd_req_op_init(osd_req, which, opcode, flags);
  664. }
  665. EXPORT_SYMBOL(osd_req_op_init);
  666. void osd_req_op_extent_init(struct ceph_osd_request *osd_req,
  667. unsigned int which, u16 opcode,
  668. u64 offset, u64 length,
  669. u64 truncate_size, u32 truncate_seq)
  670. {
  671. struct ceph_osd_req_op *op = _osd_req_op_init(osd_req, which,
  672. opcode, 0);
  673. size_t payload_len = 0;
  674. BUG_ON(opcode != CEPH_OSD_OP_READ && opcode != CEPH_OSD_OP_WRITE &&
  675. opcode != CEPH_OSD_OP_WRITEFULL && opcode != CEPH_OSD_OP_ZERO &&
  676. opcode != CEPH_OSD_OP_TRUNCATE);
  677. op->extent.offset = offset;
  678. op->extent.length = length;
  679. op->extent.truncate_size = truncate_size;
  680. op->extent.truncate_seq = truncate_seq;
  681. if (opcode == CEPH_OSD_OP_WRITE || opcode == CEPH_OSD_OP_WRITEFULL)
  682. payload_len += length;
  683. op->indata_len = payload_len;
  684. }
  685. EXPORT_SYMBOL(osd_req_op_extent_init);
  686. void osd_req_op_extent_update(struct ceph_osd_request *osd_req,
  687. unsigned int which, u64 length)
  688. {
  689. struct ceph_osd_req_op *op;
  690. u64 previous;
  691. BUG_ON(which >= osd_req->r_num_ops);
  692. op = &osd_req->r_ops[which];
  693. previous = op->extent.length;
  694. if (length == previous)
  695. return; /* Nothing to do */
  696. BUG_ON(length > previous);
  697. op->extent.length = length;
  698. if (op->op == CEPH_OSD_OP_WRITE || op->op == CEPH_OSD_OP_WRITEFULL)
  699. op->indata_len -= previous - length;
  700. }
  701. EXPORT_SYMBOL(osd_req_op_extent_update);
  702. void osd_req_op_extent_dup_last(struct ceph_osd_request *osd_req,
  703. unsigned int which, u64 offset_inc)
  704. {
  705. struct ceph_osd_req_op *op, *prev_op;
  706. BUG_ON(which + 1 >= osd_req->r_num_ops);
  707. prev_op = &osd_req->r_ops[which];
  708. op = _osd_req_op_init(osd_req, which + 1, prev_op->op, prev_op->flags);
  709. /* dup previous one */
  710. op->indata_len = prev_op->indata_len;
  711. op->outdata_len = prev_op->outdata_len;
  712. op->extent = prev_op->extent;
  713. /* adjust offset */
  714. op->extent.offset += offset_inc;
  715. op->extent.length -= offset_inc;
  716. if (op->op == CEPH_OSD_OP_WRITE || op->op == CEPH_OSD_OP_WRITEFULL)
  717. op->indata_len -= offset_inc;
  718. }
  719. EXPORT_SYMBOL(osd_req_op_extent_dup_last);
  720. int osd_req_op_cls_init(struct ceph_osd_request *osd_req, unsigned int which,
  721. const char *class, const char *method)
  722. {
  723. struct ceph_osd_req_op *op;
  724. struct ceph_pagelist *pagelist;
  725. size_t payload_len = 0;
  726. size_t size;
  727. int ret;
  728. op = _osd_req_op_init(osd_req, which, CEPH_OSD_OP_CALL, 0);
  729. pagelist = ceph_pagelist_alloc(GFP_NOFS);
  730. if (!pagelist)
  731. return -ENOMEM;
  732. op->cls.class_name = class;
  733. size = strlen(class);
  734. BUG_ON(size > (size_t) U8_MAX);
  735. op->cls.class_len = size;
  736. ret = ceph_pagelist_append(pagelist, class, size);
  737. if (ret)
  738. goto err_pagelist_free;
  739. payload_len += size;
  740. op->cls.method_name = method;
  741. size = strlen(method);
  742. BUG_ON(size > (size_t) U8_MAX);
  743. op->cls.method_len = size;
  744. ret = ceph_pagelist_append(pagelist, method, size);
  745. if (ret)
  746. goto err_pagelist_free;
  747. payload_len += size;
  748. osd_req_op_cls_request_info_pagelist(osd_req, which, pagelist);
  749. op->indata_len = payload_len;
  750. return 0;
  751. err_pagelist_free:
  752. ceph_pagelist_release(pagelist);
  753. return ret;
  754. }
  755. EXPORT_SYMBOL(osd_req_op_cls_init);
  756. int osd_req_op_xattr_init(struct ceph_osd_request *osd_req, unsigned int which,
  757. u16 opcode, const char *name, const void *value,
  758. size_t size, u8 cmp_op, u8 cmp_mode)
  759. {
  760. struct ceph_osd_req_op *op = _osd_req_op_init(osd_req, which,
  761. opcode, 0);
  762. struct ceph_pagelist *pagelist;
  763. size_t payload_len;
  764. int ret;
  765. BUG_ON(opcode != CEPH_OSD_OP_SETXATTR && opcode != CEPH_OSD_OP_CMPXATTR);
  766. pagelist = ceph_pagelist_alloc(GFP_NOFS);
  767. if (!pagelist)
  768. return -ENOMEM;
  769. payload_len = strlen(name);
  770. op->xattr.name_len = payload_len;
  771. ret = ceph_pagelist_append(pagelist, name, payload_len);
  772. if (ret)
  773. goto err_pagelist_free;
  774. op->xattr.value_len = size;
  775. ret = ceph_pagelist_append(pagelist, value, size);
  776. if (ret)
  777. goto err_pagelist_free;
  778. payload_len += size;
  779. op->xattr.cmp_op = cmp_op;
  780. op->xattr.cmp_mode = cmp_mode;
  781. ceph_osd_data_pagelist_init(&op->xattr.osd_data, pagelist);
  782. op->indata_len = payload_len;
  783. return 0;
  784. err_pagelist_free:
  785. ceph_pagelist_release(pagelist);
  786. return ret;
  787. }
  788. EXPORT_SYMBOL(osd_req_op_xattr_init);
  789. /*
  790. * @watch_opcode: CEPH_OSD_WATCH_OP_*
  791. */
  792. static void osd_req_op_watch_init(struct ceph_osd_request *req, int which,
  793. u64 cookie, u8 watch_opcode)
  794. {
  795. struct ceph_osd_req_op *op;
  796. op = _osd_req_op_init(req, which, CEPH_OSD_OP_WATCH, 0);
  797. op->watch.cookie = cookie;
  798. op->watch.op = watch_opcode;
  799. op->watch.gen = 0;
  800. }
  801. void osd_req_op_alloc_hint_init(struct ceph_osd_request *osd_req,
  802. unsigned int which,
  803. u64 expected_object_size,
  804. u64 expected_write_size)
  805. {
  806. struct ceph_osd_req_op *op = _osd_req_op_init(osd_req, which,
  807. CEPH_OSD_OP_SETALLOCHINT,
  808. 0);
  809. op->alloc_hint.expected_object_size = expected_object_size;
  810. op->alloc_hint.expected_write_size = expected_write_size;
  811. /*
  812. * CEPH_OSD_OP_SETALLOCHINT op is advisory and therefore deemed
  813. * not worth a feature bit. Set FAILOK per-op flag to make
  814. * sure older osds don't trip over an unsupported opcode.
  815. */
  816. op->flags |= CEPH_OSD_OP_FLAG_FAILOK;
  817. }
  818. EXPORT_SYMBOL(osd_req_op_alloc_hint_init);
  819. static void ceph_osdc_msg_data_add(struct ceph_msg *msg,
  820. struct ceph_osd_data *osd_data)
  821. {
  822. u64 length = ceph_osd_data_length(osd_data);
  823. if (osd_data->type == CEPH_OSD_DATA_TYPE_PAGES) {
  824. BUG_ON(length > (u64) SIZE_MAX);
  825. if (length)
  826. ceph_msg_data_add_pages(msg, osd_data->pages,
  827. length, osd_data->alignment, false);
  828. } else if (osd_data->type == CEPH_OSD_DATA_TYPE_PAGELIST) {
  829. BUG_ON(!length);
  830. ceph_msg_data_add_pagelist(msg, osd_data->pagelist);
  831. #ifdef CONFIG_BLOCK
  832. } else if (osd_data->type == CEPH_OSD_DATA_TYPE_BIO) {
  833. ceph_msg_data_add_bio(msg, &osd_data->bio_pos, length);
  834. #endif
  835. } else if (osd_data->type == CEPH_OSD_DATA_TYPE_BVECS) {
  836. ceph_msg_data_add_bvecs(msg, &osd_data->bvec_pos);
  837. } else {
  838. BUG_ON(osd_data->type != CEPH_OSD_DATA_TYPE_NONE);
  839. }
  840. }
  841. static u32 osd_req_encode_op(struct ceph_osd_op *dst,
  842. const struct ceph_osd_req_op *src)
  843. {
  844. switch (src->op) {
  845. case CEPH_OSD_OP_STAT:
  846. break;
  847. case CEPH_OSD_OP_READ:
  848. case CEPH_OSD_OP_WRITE:
  849. case CEPH_OSD_OP_WRITEFULL:
  850. case CEPH_OSD_OP_ZERO:
  851. case CEPH_OSD_OP_TRUNCATE:
  852. dst->extent.offset = cpu_to_le64(src->extent.offset);
  853. dst->extent.length = cpu_to_le64(src->extent.length);
  854. dst->extent.truncate_size =
  855. cpu_to_le64(src->extent.truncate_size);
  856. dst->extent.truncate_seq =
  857. cpu_to_le32(src->extent.truncate_seq);
  858. break;
  859. case CEPH_OSD_OP_CALL:
  860. dst->cls.class_len = src->cls.class_len;
  861. dst->cls.method_len = src->cls.method_len;
  862. dst->cls.indata_len = cpu_to_le32(src->cls.indata_len);
  863. break;
  864. case CEPH_OSD_OP_WATCH:
  865. dst->watch.cookie = cpu_to_le64(src->watch.cookie);
  866. dst->watch.ver = cpu_to_le64(0);
  867. dst->watch.op = src->watch.op;
  868. dst->watch.gen = cpu_to_le32(src->watch.gen);
  869. break;
  870. case CEPH_OSD_OP_NOTIFY_ACK:
  871. break;
  872. case CEPH_OSD_OP_NOTIFY:
  873. dst->notify.cookie = cpu_to_le64(src->notify.cookie);
  874. break;
  875. case CEPH_OSD_OP_LIST_WATCHERS:
  876. break;
  877. case CEPH_OSD_OP_SETALLOCHINT:
  878. dst->alloc_hint.expected_object_size =
  879. cpu_to_le64(src->alloc_hint.expected_object_size);
  880. dst->alloc_hint.expected_write_size =
  881. cpu_to_le64(src->alloc_hint.expected_write_size);
  882. break;
  883. case CEPH_OSD_OP_SETXATTR:
  884. case CEPH_OSD_OP_CMPXATTR:
  885. dst->xattr.name_len = cpu_to_le32(src->xattr.name_len);
  886. dst->xattr.value_len = cpu_to_le32(src->xattr.value_len);
  887. dst->xattr.cmp_op = src->xattr.cmp_op;
  888. dst->xattr.cmp_mode = src->xattr.cmp_mode;
  889. break;
  890. case CEPH_OSD_OP_CREATE:
  891. case CEPH_OSD_OP_DELETE:
  892. break;
  893. case CEPH_OSD_OP_COPY_FROM2:
  894. dst->copy_from.snapid = cpu_to_le64(src->copy_from.snapid);
  895. dst->copy_from.src_version =
  896. cpu_to_le64(src->copy_from.src_version);
  897. dst->copy_from.flags = src->copy_from.flags;
  898. dst->copy_from.src_fadvise_flags =
  899. cpu_to_le32(src->copy_from.src_fadvise_flags);
  900. break;
  901. default:
  902. pr_err("unsupported osd opcode %s\n",
  903. ceph_osd_op_name(src->op));
  904. WARN_ON(1);
  905. return 0;
  906. }
  907. dst->op = cpu_to_le16(src->op);
  908. dst->flags = cpu_to_le32(src->flags);
  909. dst->payload_len = cpu_to_le32(src->indata_len);
  910. return src->indata_len;
  911. }
  912. /*
  913. * build new request AND message, calculate layout, and adjust file
  914. * extent as needed.
  915. *
  916. * if the file was recently truncated, we include information about its
  917. * old and new size so that the object can be updated appropriately. (we
  918. * avoid synchronously deleting truncated objects because it's slow.)
  919. */
  920. struct ceph_osd_request *ceph_osdc_new_request(struct ceph_osd_client *osdc,
  921. struct ceph_file_layout *layout,
  922. struct ceph_vino vino,
  923. u64 off, u64 *plen,
  924. unsigned int which, int num_ops,
  925. int opcode, int flags,
  926. struct ceph_snap_context *snapc,
  927. u32 truncate_seq,
  928. u64 truncate_size,
  929. bool use_mempool)
  930. {
  931. struct ceph_osd_request *req;
  932. u64 objnum = 0;
  933. u64 objoff = 0;
  934. u64 objlen = 0;
  935. int r;
  936. BUG_ON(opcode != CEPH_OSD_OP_READ && opcode != CEPH_OSD_OP_WRITE &&
  937. opcode != CEPH_OSD_OP_ZERO && opcode != CEPH_OSD_OP_TRUNCATE &&
  938. opcode != CEPH_OSD_OP_CREATE && opcode != CEPH_OSD_OP_DELETE);
  939. req = ceph_osdc_alloc_request(osdc, snapc, num_ops, use_mempool,
  940. GFP_NOFS);
  941. if (!req) {
  942. r = -ENOMEM;
  943. goto fail;
  944. }
  945. /* calculate max write size */
  946. r = calc_layout(layout, off, plen, &objnum, &objoff, &objlen);
  947. if (r)
  948. goto fail;
  949. if (opcode == CEPH_OSD_OP_CREATE || opcode == CEPH_OSD_OP_DELETE) {
  950. osd_req_op_init(req, which, opcode, 0);
  951. } else {
  952. u32 object_size = layout->object_size;
  953. u32 object_base = off - objoff;
  954. if (!(truncate_seq == 1 && truncate_size == -1ULL)) {
  955. if (truncate_size <= object_base) {
  956. truncate_size = 0;
  957. } else {
  958. truncate_size -= object_base;
  959. if (truncate_size > object_size)
  960. truncate_size = object_size;
  961. }
  962. }
  963. osd_req_op_extent_init(req, which, opcode, objoff, objlen,
  964. truncate_size, truncate_seq);
  965. }
  966. req->r_flags = flags;
  967. req->r_base_oloc.pool = layout->pool_id;
  968. req->r_base_oloc.pool_ns = ceph_try_get_string(layout->pool_ns);
  969. ceph_oid_printf(&req->r_base_oid, "%llx.%08llx", vino.ino, objnum);
  970. req->r_snapid = vino.snap;
  971. if (flags & CEPH_OSD_FLAG_WRITE)
  972. req->r_data_offset = off;
  973. if (num_ops > 1)
  974. /*
  975. * This is a special case for ceph_writepages_start(), but it
  976. * also covers ceph_uninline_data(). If more multi-op request
  977. * use cases emerge, we will need a separate helper.
  978. */
  979. r = __ceph_osdc_alloc_messages(req, GFP_NOFS, num_ops, 0);
  980. else
  981. r = ceph_osdc_alloc_messages(req, GFP_NOFS);
  982. if (r)
  983. goto fail;
  984. return req;
  985. fail:
  986. ceph_osdc_put_request(req);
  987. return ERR_PTR(r);
  988. }
  989. EXPORT_SYMBOL(ceph_osdc_new_request);
  990. /*
  991. * We keep osd requests in an rbtree, sorted by ->r_tid.
  992. */
  993. DEFINE_RB_FUNCS(request, struct ceph_osd_request, r_tid, r_node)
  994. DEFINE_RB_FUNCS(request_mc, struct ceph_osd_request, r_tid, r_mc_node)
  995. /*
  996. * Call @fn on each OSD request as long as @fn returns 0.
  997. */
  998. static void for_each_request(struct ceph_osd_client *osdc,
  999. int (*fn)(struct ceph_osd_request *req, void *arg),
  1000. void *arg)
  1001. {
  1002. struct rb_node *n, *p;
  1003. for (n = rb_first(&osdc->osds); n; n = rb_next(n)) {
  1004. struct ceph_osd *osd = rb_entry(n, struct ceph_osd, o_node);
  1005. for (p = rb_first(&osd->o_requests); p; ) {
  1006. struct ceph_osd_request *req =
  1007. rb_entry(p, struct ceph_osd_request, r_node);
  1008. p = rb_next(p);
  1009. if (fn(req, arg))
  1010. return;
  1011. }
  1012. }
  1013. for (p = rb_first(&osdc->homeless_osd.o_requests); p; ) {
  1014. struct ceph_osd_request *req =
  1015. rb_entry(p, struct ceph_osd_request, r_node);
  1016. p = rb_next(p);
  1017. if (fn(req, arg))
  1018. return;
  1019. }
  1020. }
  1021. static bool osd_homeless(struct ceph_osd *osd)
  1022. {
  1023. return osd->o_osd == CEPH_HOMELESS_OSD;
  1024. }
  1025. static bool osd_registered(struct ceph_osd *osd)
  1026. {
  1027. verify_osdc_locked(osd->o_osdc);
  1028. return !RB_EMPTY_NODE(&osd->o_node);
  1029. }
  1030. /*
  1031. * Assumes @osd is zero-initialized.
  1032. */
  1033. static void osd_init(struct ceph_osd *osd)
  1034. {
  1035. refcount_set(&osd->o_ref, 1);
  1036. RB_CLEAR_NODE(&osd->o_node);
  1037. osd->o_requests = RB_ROOT;
  1038. osd->o_linger_requests = RB_ROOT;
  1039. osd->o_backoff_mappings = RB_ROOT;
  1040. osd->o_backoffs_by_id = RB_ROOT;
  1041. INIT_LIST_HEAD(&osd->o_osd_lru);
  1042. INIT_LIST_HEAD(&osd->o_keepalive_item);
  1043. osd->o_incarnation = 1;
  1044. mutex_init(&osd->lock);
  1045. }
  1046. static void osd_cleanup(struct ceph_osd *osd)
  1047. {
  1048. WARN_ON(!RB_EMPTY_NODE(&osd->o_node));
  1049. WARN_ON(!RB_EMPTY_ROOT(&osd->o_requests));
  1050. WARN_ON(!RB_EMPTY_ROOT(&osd->o_linger_requests));
  1051. WARN_ON(!RB_EMPTY_ROOT(&osd->o_backoff_mappings));
  1052. WARN_ON(!RB_EMPTY_ROOT(&osd->o_backoffs_by_id));
  1053. WARN_ON(!list_empty(&osd->o_osd_lru));
  1054. WARN_ON(!list_empty(&osd->o_keepalive_item));
  1055. if (osd->o_auth.authorizer) {
  1056. WARN_ON(osd_homeless(osd));
  1057. ceph_auth_destroy_authorizer(osd->o_auth.authorizer);
  1058. }
  1059. }
  1060. /*
  1061. * Track open sessions with osds.
  1062. */
  1063. static struct ceph_osd *create_osd(struct ceph_osd_client *osdc, int onum)
  1064. {
  1065. struct ceph_osd *osd;
  1066. WARN_ON(onum == CEPH_HOMELESS_OSD);
  1067. osd = kzalloc(sizeof(*osd), GFP_NOIO | __GFP_NOFAIL);
  1068. osd_init(osd);
  1069. osd->o_osdc = osdc;
  1070. osd->o_osd = onum;
  1071. ceph_con_init(&osd->o_con, osd, &osd_con_ops, &osdc->client->msgr);
  1072. return osd;
  1073. }
  1074. static struct ceph_osd *get_osd(struct ceph_osd *osd)
  1075. {
  1076. if (refcount_inc_not_zero(&osd->o_ref)) {
  1077. dout("get_osd %p %d -> %d\n", osd, refcount_read(&osd->o_ref)-1,
  1078. refcount_read(&osd->o_ref));
  1079. return osd;
  1080. } else {
  1081. dout("get_osd %p FAIL\n", osd);
  1082. return NULL;
  1083. }
  1084. }
  1085. static void put_osd(struct ceph_osd *osd)
  1086. {
  1087. dout("put_osd %p %d -> %d\n", osd, refcount_read(&osd->o_ref),
  1088. refcount_read(&osd->o_ref) - 1);
  1089. if (refcount_dec_and_test(&osd->o_ref)) {
  1090. osd_cleanup(osd);
  1091. kfree(osd);
  1092. }
  1093. }
  1094. DEFINE_RB_FUNCS(osd, struct ceph_osd, o_osd, o_node)
  1095. static void __move_osd_to_lru(struct ceph_osd *osd)
  1096. {
  1097. struct ceph_osd_client *osdc = osd->o_osdc;
  1098. dout("%s osd %p osd%d\n", __func__, osd, osd->o_osd);
  1099. BUG_ON(!list_empty(&osd->o_osd_lru));
  1100. spin_lock(&osdc->osd_lru_lock);
  1101. list_add_tail(&osd->o_osd_lru, &osdc->osd_lru);
  1102. spin_unlock(&osdc->osd_lru_lock);
  1103. osd->lru_ttl = jiffies + osdc->client->options->osd_idle_ttl;
  1104. }
  1105. static void maybe_move_osd_to_lru(struct ceph_osd *osd)
  1106. {
  1107. if (RB_EMPTY_ROOT(&osd->o_requests) &&
  1108. RB_EMPTY_ROOT(&osd->o_linger_requests))
  1109. __move_osd_to_lru(osd);
  1110. }
  1111. static void __remove_osd_from_lru(struct ceph_osd *osd)
  1112. {
  1113. struct ceph_osd_client *osdc = osd->o_osdc;
  1114. dout("%s osd %p osd%d\n", __func__, osd, osd->o_osd);
  1115. spin_lock(&osdc->osd_lru_lock);
  1116. if (!list_empty(&osd->o_osd_lru))
  1117. list_del_init(&osd->o_osd_lru);
  1118. spin_unlock(&osdc->osd_lru_lock);
  1119. }
  1120. /*
  1121. * Close the connection and assign any leftover requests to the
  1122. * homeless session.
  1123. */
  1124. static void close_osd(struct ceph_osd *osd)
  1125. {
  1126. struct ceph_osd_client *osdc = osd->o_osdc;
  1127. struct rb_node *n;
  1128. verify_osdc_wrlocked(osdc);
  1129. dout("%s osd %p osd%d\n", __func__, osd, osd->o_osd);
  1130. ceph_con_close(&osd->o_con);
  1131. for (n = rb_first(&osd->o_requests); n; ) {
  1132. struct ceph_osd_request *req =
  1133. rb_entry(n, struct ceph_osd_request, r_node);
  1134. n = rb_next(n); /* unlink_request() */
  1135. dout(" reassigning req %p tid %llu\n", req, req->r_tid);
  1136. unlink_request(osd, req);
  1137. link_request(&osdc->homeless_osd, req);
  1138. }
  1139. for (n = rb_first(&osd->o_linger_requests); n; ) {
  1140. struct ceph_osd_linger_request *lreq =
  1141. rb_entry(n, struct ceph_osd_linger_request, node);
  1142. n = rb_next(n); /* unlink_linger() */
  1143. dout(" reassigning lreq %p linger_id %llu\n", lreq,
  1144. lreq->linger_id);
  1145. unlink_linger(osd, lreq);
  1146. link_linger(&osdc->homeless_osd, lreq);
  1147. }
  1148. clear_backoffs(osd);
  1149. __remove_osd_from_lru(osd);
  1150. erase_osd(&osdc->osds, osd);
  1151. put_osd(osd);
  1152. }
  1153. /*
  1154. * reset osd connect
  1155. */
  1156. static int reopen_osd(struct ceph_osd *osd)
  1157. {
  1158. struct ceph_entity_addr *peer_addr;
  1159. dout("%s osd %p osd%d\n", __func__, osd, osd->o_osd);
  1160. if (RB_EMPTY_ROOT(&osd->o_requests) &&
  1161. RB_EMPTY_ROOT(&osd->o_linger_requests)) {
  1162. close_osd(osd);
  1163. return -ENODEV;
  1164. }
  1165. peer_addr = &osd->o_osdc->osdmap->osd_addr[osd->o_osd];
  1166. if (!memcmp(peer_addr, &osd->o_con.peer_addr, sizeof (*peer_addr)) &&
  1167. !ceph_con_opened(&osd->o_con)) {
  1168. struct rb_node *n;
  1169. dout("osd addr hasn't changed and connection never opened, "
  1170. "letting msgr retry\n");
  1171. /* touch each r_stamp for handle_timeout()'s benfit */
  1172. for (n = rb_first(&osd->o_requests); n; n = rb_next(n)) {
  1173. struct ceph_osd_request *req =
  1174. rb_entry(n, struct ceph_osd_request, r_node);
  1175. req->r_stamp = jiffies;
  1176. }
  1177. return -EAGAIN;
  1178. }
  1179. ceph_con_close(&osd->o_con);
  1180. ceph_con_open(&osd->o_con, CEPH_ENTITY_TYPE_OSD, osd->o_osd, peer_addr);
  1181. osd->o_incarnation++;
  1182. return 0;
  1183. }
  1184. static struct ceph_osd *lookup_create_osd(struct ceph_osd_client *osdc, int o,
  1185. bool wrlocked)
  1186. {
  1187. struct ceph_osd *osd;
  1188. if (wrlocked)
  1189. verify_osdc_wrlocked(osdc);
  1190. else
  1191. verify_osdc_locked(osdc);
  1192. if (o != CEPH_HOMELESS_OSD)
  1193. osd = lookup_osd(&osdc->osds, o);
  1194. else
  1195. osd = &osdc->homeless_osd;
  1196. if (!osd) {
  1197. if (!wrlocked)
  1198. return ERR_PTR(-EAGAIN);
  1199. osd = create_osd(osdc, o);
  1200. insert_osd(&osdc->osds, osd);
  1201. ceph_con_open(&osd->o_con, CEPH_ENTITY_TYPE_OSD, osd->o_osd,
  1202. &osdc->osdmap->osd_addr[osd->o_osd]);
  1203. }
  1204. dout("%s osdc %p osd%d -> osd %p\n", __func__, osdc, o, osd);
  1205. return osd;
  1206. }
  1207. /*
  1208. * Create request <-> OSD session relation.
  1209. *
  1210. * @req has to be assigned a tid, @osd may be homeless.
  1211. */
  1212. static void link_request(struct ceph_osd *osd, struct ceph_osd_request *req)
  1213. {
  1214. verify_osd_locked(osd);
  1215. WARN_ON(!req->r_tid || req->r_osd);
  1216. dout("%s osd %p osd%d req %p tid %llu\n", __func__, osd, osd->o_osd,
  1217. req, req->r_tid);
  1218. if (!osd_homeless(osd))
  1219. __remove_osd_from_lru(osd);
  1220. else
  1221. atomic_inc(&osd->o_osdc->num_homeless);
  1222. get_osd(osd);
  1223. insert_request(&osd->o_requests, req);
  1224. req->r_osd = osd;
  1225. }
  1226. static void unlink_request(struct ceph_osd *osd, struct ceph_osd_request *req)
  1227. {
  1228. verify_osd_locked(osd);
  1229. WARN_ON(req->r_osd != osd);
  1230. dout("%s osd %p osd%d req %p tid %llu\n", __func__, osd, osd->o_osd,
  1231. req, req->r_tid);
  1232. req->r_osd = NULL;
  1233. erase_request(&osd->o_requests, req);
  1234. put_osd(osd);
  1235. if (!osd_homeless(osd))
  1236. maybe_move_osd_to_lru(osd);
  1237. else
  1238. atomic_dec(&osd->o_osdc->num_homeless);
  1239. }
  1240. static bool __pool_full(struct ceph_pg_pool_info *pi)
  1241. {
  1242. return pi->flags & CEPH_POOL_FLAG_FULL;
  1243. }
  1244. static bool have_pool_full(struct ceph_osd_client *osdc)
  1245. {
  1246. struct rb_node *n;
  1247. for (n = rb_first(&osdc->osdmap->pg_pools); n; n = rb_next(n)) {
  1248. struct ceph_pg_pool_info *pi =
  1249. rb_entry(n, struct ceph_pg_pool_info, node);
  1250. if (__pool_full(pi))
  1251. return true;
  1252. }
  1253. return false;
  1254. }
  1255. static bool pool_full(struct ceph_osd_client *osdc, s64 pool_id)
  1256. {
  1257. struct ceph_pg_pool_info *pi;
  1258. pi = ceph_pg_pool_by_id(osdc->osdmap, pool_id);
  1259. if (!pi)
  1260. return false;
  1261. return __pool_full(pi);
  1262. }
  1263. /*
  1264. * Returns whether a request should be blocked from being sent
  1265. * based on the current osdmap and osd_client settings.
  1266. */
  1267. static bool target_should_be_paused(struct ceph_osd_client *osdc,
  1268. const struct ceph_osd_request_target *t,
  1269. struct ceph_pg_pool_info *pi)
  1270. {
  1271. bool pauserd = ceph_osdmap_flag(osdc, CEPH_OSDMAP_PAUSERD);
  1272. bool pausewr = ceph_osdmap_flag(osdc, CEPH_OSDMAP_PAUSEWR) ||
  1273. ceph_osdmap_flag(osdc, CEPH_OSDMAP_FULL) ||
  1274. __pool_full(pi);
  1275. WARN_ON(pi->id != t->target_oloc.pool);
  1276. return ((t->flags & CEPH_OSD_FLAG_READ) && pauserd) ||
  1277. ((t->flags & CEPH_OSD_FLAG_WRITE) && pausewr) ||
  1278. (osdc->osdmap->epoch < osdc->epoch_barrier);
  1279. }
  1280. enum calc_target_result {
  1281. CALC_TARGET_NO_ACTION = 0,
  1282. CALC_TARGET_NEED_RESEND,
  1283. CALC_TARGET_POOL_DNE,
  1284. };
  1285. static enum calc_target_result calc_target(struct ceph_osd_client *osdc,
  1286. struct ceph_osd_request_target *t,
  1287. bool any_change)
  1288. {
  1289. struct ceph_pg_pool_info *pi;
  1290. struct ceph_pg pgid, last_pgid;
  1291. struct ceph_osds up, acting;
  1292. bool force_resend = false;
  1293. bool unpaused = false;
  1294. bool legacy_change = false;
  1295. bool split = false;
  1296. bool sort_bitwise = ceph_osdmap_flag(osdc, CEPH_OSDMAP_SORTBITWISE);
  1297. bool recovery_deletes = ceph_osdmap_flag(osdc,
  1298. CEPH_OSDMAP_RECOVERY_DELETES);
  1299. enum calc_target_result ct_res;
  1300. t->epoch = osdc->osdmap->epoch;
  1301. pi = ceph_pg_pool_by_id(osdc->osdmap, t->base_oloc.pool);
  1302. if (!pi) {
  1303. t->osd = CEPH_HOMELESS_OSD;
  1304. ct_res = CALC_TARGET_POOL_DNE;
  1305. goto out;
  1306. }
  1307. if (osdc->osdmap->epoch == pi->last_force_request_resend) {
  1308. if (t->last_force_resend < pi->last_force_request_resend) {
  1309. t->last_force_resend = pi->last_force_request_resend;
  1310. force_resend = true;
  1311. } else if (t->last_force_resend == 0) {
  1312. force_resend = true;
  1313. }
  1314. }
  1315. /* apply tiering */
  1316. ceph_oid_copy(&t->target_oid, &t->base_oid);
  1317. ceph_oloc_copy(&t->target_oloc, &t->base_oloc);
  1318. if ((t->flags & CEPH_OSD_FLAG_IGNORE_OVERLAY) == 0) {
  1319. if (t->flags & CEPH_OSD_FLAG_READ && pi->read_tier >= 0)
  1320. t->target_oloc.pool = pi->read_tier;
  1321. if (t->flags & CEPH_OSD_FLAG_WRITE && pi->write_tier >= 0)
  1322. t->target_oloc.pool = pi->write_tier;
  1323. pi = ceph_pg_pool_by_id(osdc->osdmap, t->target_oloc.pool);
  1324. if (!pi) {
  1325. t->osd = CEPH_HOMELESS_OSD;
  1326. ct_res = CALC_TARGET_POOL_DNE;
  1327. goto out;
  1328. }
  1329. }
  1330. __ceph_object_locator_to_pg(pi, &t->target_oid, &t->target_oloc, &pgid);
  1331. last_pgid.pool = pgid.pool;
  1332. last_pgid.seed = ceph_stable_mod(pgid.seed, t->pg_num, t->pg_num_mask);
  1333. ceph_pg_to_up_acting_osds(osdc->osdmap, pi, &pgid, &up, &acting);
  1334. if (any_change &&
  1335. ceph_is_new_interval(&t->acting,
  1336. &acting,
  1337. &t->up,
  1338. &up,
  1339. t->size,
  1340. pi->size,
  1341. t->min_size,
  1342. pi->min_size,
  1343. t->pg_num,
  1344. pi->pg_num,
  1345. t->sort_bitwise,
  1346. sort_bitwise,
  1347. t->recovery_deletes,
  1348. recovery_deletes,
  1349. &last_pgid))
  1350. force_resend = true;
  1351. if (t->paused && !target_should_be_paused(osdc, t, pi)) {
  1352. t->paused = false;
  1353. unpaused = true;
  1354. }
  1355. legacy_change = ceph_pg_compare(&t->pgid, &pgid) ||
  1356. ceph_osds_changed(&t->acting, &acting, any_change);
  1357. if (t->pg_num)
  1358. split = ceph_pg_is_split(&last_pgid, t->pg_num, pi->pg_num);
  1359. if (legacy_change || force_resend || split) {
  1360. t->pgid = pgid; /* struct */
  1361. ceph_pg_to_primary_shard(osdc->osdmap, pi, &pgid, &t->spgid);
  1362. ceph_osds_copy(&t->acting, &acting);
  1363. ceph_osds_copy(&t->up, &up);
  1364. t->size = pi->size;
  1365. t->min_size = pi->min_size;
  1366. t->pg_num = pi->pg_num;
  1367. t->pg_num_mask = pi->pg_num_mask;
  1368. t->sort_bitwise = sort_bitwise;
  1369. t->recovery_deletes = recovery_deletes;
  1370. t->osd = acting.primary;
  1371. }
  1372. if (unpaused || legacy_change || force_resend || split)
  1373. ct_res = CALC_TARGET_NEED_RESEND;
  1374. else
  1375. ct_res = CALC_TARGET_NO_ACTION;
  1376. out:
  1377. dout("%s t %p -> %d%d%d%d ct_res %d osd%d\n", __func__, t, unpaused,
  1378. legacy_change, force_resend, split, ct_res, t->osd);
  1379. return ct_res;
  1380. }
  1381. static struct ceph_spg_mapping *alloc_spg_mapping(void)
  1382. {
  1383. struct ceph_spg_mapping *spg;
  1384. spg = kmalloc(sizeof(*spg), GFP_NOIO);
  1385. if (!spg)
  1386. return NULL;
  1387. RB_CLEAR_NODE(&spg->node);
  1388. spg->backoffs = RB_ROOT;
  1389. return spg;
  1390. }
  1391. static void free_spg_mapping(struct ceph_spg_mapping *spg)
  1392. {
  1393. WARN_ON(!RB_EMPTY_NODE(&spg->node));
  1394. WARN_ON(!RB_EMPTY_ROOT(&spg->backoffs));
  1395. kfree(spg);
  1396. }
  1397. /*
  1398. * rbtree of ceph_spg_mapping for handling map<spg_t, ...>, similar to
  1399. * ceph_pg_mapping. Used to track OSD backoffs -- a backoff [range] is
  1400. * defined only within a specific spgid; it does not pass anything to
  1401. * children on split, or to another primary.
  1402. */
  1403. DEFINE_RB_FUNCS2(spg_mapping, struct ceph_spg_mapping, spgid, ceph_spg_compare,
  1404. RB_BYPTR, const struct ceph_spg *, node)
  1405. static u64 hoid_get_bitwise_key(const struct ceph_hobject_id *hoid)
  1406. {
  1407. return hoid->is_max ? 0x100000000ull : hoid->hash_reverse_bits;
  1408. }
  1409. static void hoid_get_effective_key(const struct ceph_hobject_id *hoid,
  1410. void **pkey, size_t *pkey_len)
  1411. {
  1412. if (hoid->key_len) {
  1413. *pkey = hoid->key;
  1414. *pkey_len = hoid->key_len;
  1415. } else {
  1416. *pkey = hoid->oid;
  1417. *pkey_len = hoid->oid_len;
  1418. }
  1419. }
  1420. static int compare_names(const void *name1, size_t name1_len,
  1421. const void *name2, size_t name2_len)
  1422. {
  1423. int ret;
  1424. ret = memcmp(name1, name2, min(name1_len, name2_len));
  1425. if (!ret) {
  1426. if (name1_len < name2_len)
  1427. ret = -1;
  1428. else if (name1_len > name2_len)
  1429. ret = 1;
  1430. }
  1431. return ret;
  1432. }
  1433. static int hoid_compare(const struct ceph_hobject_id *lhs,
  1434. const struct ceph_hobject_id *rhs)
  1435. {
  1436. void *effective_key1, *effective_key2;
  1437. size_t effective_key1_len, effective_key2_len;
  1438. int ret;
  1439. if (lhs->is_max < rhs->is_max)
  1440. return -1;
  1441. if (lhs->is_max > rhs->is_max)
  1442. return 1;
  1443. if (lhs->pool < rhs->pool)
  1444. return -1;
  1445. if (lhs->pool > rhs->pool)
  1446. return 1;
  1447. if (hoid_get_bitwise_key(lhs) < hoid_get_bitwise_key(rhs))
  1448. return -1;
  1449. if (hoid_get_bitwise_key(lhs) > hoid_get_bitwise_key(rhs))
  1450. return 1;
  1451. ret = compare_names(lhs->nspace, lhs->nspace_len,
  1452. rhs->nspace, rhs->nspace_len);
  1453. if (ret)
  1454. return ret;
  1455. hoid_get_effective_key(lhs, &effective_key1, &effective_key1_len);
  1456. hoid_get_effective_key(rhs, &effective_key2, &effective_key2_len);
  1457. ret = compare_names(effective_key1, effective_key1_len,
  1458. effective_key2, effective_key2_len);
  1459. if (ret)
  1460. return ret;
  1461. ret = compare_names(lhs->oid, lhs->oid_len, rhs->oid, rhs->oid_len);
  1462. if (ret)
  1463. return ret;
  1464. if (lhs->snapid < rhs->snapid)
  1465. return -1;
  1466. if (lhs->snapid > rhs->snapid)
  1467. return 1;
  1468. return 0;
  1469. }
  1470. /*
  1471. * For decoding ->begin and ->end of MOSDBackoff only -- no MIN/MAX
  1472. * compat stuff here.
  1473. *
  1474. * Assumes @hoid is zero-initialized.
  1475. */
  1476. static int decode_hoid(void **p, void *end, struct ceph_hobject_id *hoid)
  1477. {
  1478. u8 struct_v;
  1479. u32 struct_len;
  1480. int ret;
  1481. ret = ceph_start_decoding(p, end, 4, "hobject_t", &struct_v,
  1482. &struct_len);
  1483. if (ret)
  1484. return ret;
  1485. if (struct_v < 4) {
  1486. pr_err("got struct_v %d < 4 of hobject_t\n", struct_v);
  1487. goto e_inval;
  1488. }
  1489. hoid->key = ceph_extract_encoded_string(p, end, &hoid->key_len,
  1490. GFP_NOIO);
  1491. if (IS_ERR(hoid->key)) {
  1492. ret = PTR_ERR(hoid->key);
  1493. hoid->key = NULL;
  1494. return ret;
  1495. }
  1496. hoid->oid = ceph_extract_encoded_string(p, end, &hoid->oid_len,
  1497. GFP_NOIO);
  1498. if (IS_ERR(hoid->oid)) {
  1499. ret = PTR_ERR(hoid->oid);
  1500. hoid->oid = NULL;
  1501. return ret;
  1502. }
  1503. ceph_decode_64_safe(p, end, hoid->snapid, e_inval);
  1504. ceph_decode_32_safe(p, end, hoid->hash, e_inval);
  1505. ceph_decode_8_safe(p, end, hoid->is_max, e_inval);
  1506. hoid->nspace = ceph_extract_encoded_string(p, end, &hoid->nspace_len,
  1507. GFP_NOIO);
  1508. if (IS_ERR(hoid->nspace)) {
  1509. ret = PTR_ERR(hoid->nspace);
  1510. hoid->nspace = NULL;
  1511. return ret;
  1512. }
  1513. ceph_decode_64_safe(p, end, hoid->pool, e_inval);
  1514. ceph_hoid_build_hash_cache(hoid);
  1515. return 0;
  1516. e_inval:
  1517. return -EINVAL;
  1518. }
  1519. static int hoid_encoding_size(const struct ceph_hobject_id *hoid)
  1520. {
  1521. return 8 + 4 + 1 + 8 + /* snapid, hash, is_max, pool */
  1522. 4 + hoid->key_len + 4 + hoid->oid_len + 4 + hoid->nspace_len;
  1523. }
  1524. static void encode_hoid(void **p, void *end, const struct ceph_hobject_id *hoid)
  1525. {
  1526. ceph_start_encoding(p, 4, 3, hoid_encoding_size(hoid));
  1527. ceph_encode_string(p, end, hoid->key, hoid->key_len);
  1528. ceph_encode_string(p, end, hoid->oid, hoid->oid_len);
  1529. ceph_encode_64(p, hoid->snapid);
  1530. ceph_encode_32(p, hoid->hash);
  1531. ceph_encode_8(p, hoid->is_max);
  1532. ceph_encode_string(p, end, hoid->nspace, hoid->nspace_len);
  1533. ceph_encode_64(p, hoid->pool);
  1534. }
  1535. static void free_hoid(struct ceph_hobject_id *hoid)
  1536. {
  1537. if (hoid) {
  1538. kfree(hoid->key);
  1539. kfree(hoid->oid);
  1540. kfree(hoid->nspace);
  1541. kfree(hoid);
  1542. }
  1543. }
  1544. static struct ceph_osd_backoff *alloc_backoff(void)
  1545. {
  1546. struct ceph_osd_backoff *backoff;
  1547. backoff = kzalloc(sizeof(*backoff), GFP_NOIO);
  1548. if (!backoff)
  1549. return NULL;
  1550. RB_CLEAR_NODE(&backoff->spg_node);
  1551. RB_CLEAR_NODE(&backoff->id_node);
  1552. return backoff;
  1553. }
  1554. static void free_backoff(struct ceph_osd_backoff *backoff)
  1555. {
  1556. WARN_ON(!RB_EMPTY_NODE(&backoff->spg_node));
  1557. WARN_ON(!RB_EMPTY_NODE(&backoff->id_node));
  1558. free_hoid(backoff->begin);
  1559. free_hoid(backoff->end);
  1560. kfree(backoff);
  1561. }
  1562. /*
  1563. * Within a specific spgid, backoffs are managed by ->begin hoid.
  1564. */
  1565. DEFINE_RB_INSDEL_FUNCS2(backoff, struct ceph_osd_backoff, begin, hoid_compare,
  1566. RB_BYVAL, spg_node);
  1567. static struct ceph_osd_backoff *lookup_containing_backoff(struct rb_root *root,
  1568. const struct ceph_hobject_id *hoid)
  1569. {
  1570. struct rb_node *n = root->rb_node;
  1571. while (n) {
  1572. struct ceph_osd_backoff *cur =
  1573. rb_entry(n, struct ceph_osd_backoff, spg_node);