heartbeat.c 46 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800
  1. /* -*- mode: c; c-basic-offset: 8; -*-
  2. * vim: noexpandtab sw=8 ts=8 sts=0:
  3. *
  4. * Copyright (C) 2004, 2005 Oracle. All rights reserved.
  5. *
  6. * This program is free software; you can redistribute it and/or
  7. * modify it under the terms of the GNU General Public
  8. * License as published by the Free Software Foundation; either
  9. * version 2 of the License, or (at your option) any later version.
  10. *
  11. * This program is distributed in the hope that it will be useful,
  12. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  13. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  14. * General Public License for more details.
  15. *
  16. * You should have received a copy of the GNU General Public
  17. * License along with this program; if not, write to the
  18. * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
  19. * Boston, MA 021110-1307, USA.
  20. */
  21. #include <linux/kernel.h>
  22. #include <linux/sched.h>
  23. #include <linux/jiffies.h>
  24. #include <linux/module.h>
  25. #include <linux/fs.h>
  26. #include <linux/bio.h>
  27. #include <linux/blkdev.h>
  28. #include <linux/delay.h>
  29. #include <linux/file.h>
  30. #include <linux/kthread.h>
  31. #include <linux/configfs.h>
  32. #include <linux/random.h>
  33. #include <linux/crc32.h>
  34. #include <linux/time.h>
  35. #include "heartbeat.h"
  36. #include "tcp.h"
  37. #include "nodemanager.h"
  38. #include "quorum.h"
  39. #include "masklog.h"
  40. /*
  41. * The first heartbeat pass had one global thread that would serialize all hb
  42. * callback calls. This global serializing sem should only be removed once
  43. * we've made sure that all callees can deal with being called concurrently
  44. * from multiple hb region threads.
  45. */
  46. static DECLARE_RWSEM(o2hb_callback_sem);
  47. /*
  48. * multiple hb threads are watching multiple regions. A node is live
  49. * whenever any of the threads sees activity from the node in its region.
  50. */
  51. static spinlock_t o2hb_live_lock = SPIN_LOCK_UNLOCKED;
  52. static struct list_head o2hb_live_slots[O2NM_MAX_NODES];
  53. static unsigned long o2hb_live_node_bitmap[BITS_TO_LONGS(O2NM_MAX_NODES)];
  54. static LIST_HEAD(o2hb_node_events);
  55. static DECLARE_WAIT_QUEUE_HEAD(o2hb_steady_queue);
  56. static LIST_HEAD(o2hb_all_regions);
  57. static struct o2hb_callback {
  58. struct list_head list;
  59. } o2hb_callbacks[O2HB_NUM_CB];
  60. static struct o2hb_callback *hbcall_from_type(enum o2hb_callback_type type);
  61. #define O2HB_DEFAULT_BLOCK_BITS 9
  62. unsigned int o2hb_dead_threshold = O2HB_DEFAULT_DEAD_THRESHOLD;
  63. /* Only sets a new threshold if there are no active regions.
  64. *
  65. * No locking or otherwise interesting code is required for reading
  66. * o2hb_dead_threshold as it can't change once regions are active and
  67. * it's not interesting to anyone until then anyway. */
  68. static void o2hb_dead_threshold_set(unsigned int threshold)
  69. {
  70. if (threshold > O2HB_MIN_DEAD_THRESHOLD) {
  71. spin_lock(&o2hb_live_lock);
  72. if (list_empty(&o2hb_all_regions))
  73. o2hb_dead_threshold = threshold;
  74. spin_unlock(&o2hb_live_lock);
  75. }
  76. }
  77. struct o2hb_node_event {
  78. struct list_head hn_item;
  79. enum o2hb_callback_type hn_event_type;
  80. struct o2nm_node *hn_node;
  81. int hn_node_num;
  82. };
  83. struct o2hb_disk_slot {
  84. struct o2hb_disk_heartbeat_block *ds_raw_block;
  85. u8 ds_node_num;
  86. u64 ds_last_time;
  87. u64 ds_last_generation;
  88. u16 ds_equal_samples;
  89. u16 ds_changed_samples;
  90. struct list_head ds_live_item;
  91. };
  92. /* each thread owns a region.. when we're asked to tear down the region
  93. * we ask the thread to stop, who cleans up the region */
  94. struct o2hb_region {
  95. struct config_item hr_item;
  96. struct list_head hr_all_item;
  97. unsigned hr_unclean_stop:1;
  98. /* protected by the hr_callback_sem */
  99. struct task_struct *hr_task;
  100. unsigned int hr_blocks;
  101. unsigned long long hr_start_block;
  102. unsigned int hr_block_bits;
  103. unsigned int hr_block_bytes;
  104. unsigned int hr_slots_per_page;
  105. unsigned int hr_num_pages;
  106. struct page **hr_slot_data;
  107. struct block_device *hr_bdev;
  108. struct o2hb_disk_slot *hr_slots;
  109. /* let the person setting up hb wait for it to return until it
  110. * has reached a 'steady' state. This will be fixed when we have
  111. * a more complete api that doesn't lead to this sort of fragility. */
  112. atomic_t hr_steady_iterations;
  113. char hr_dev_name[BDEVNAME_SIZE];
  114. unsigned int hr_timeout_ms;
  115. /* randomized as the region goes up and down so that a node
  116. * recognizes a node going up and down in one iteration */
  117. u64 hr_generation;
  118. struct work_struct hr_write_timeout_work;
  119. unsigned long hr_last_timeout_start;
  120. /* Used during o2hb_check_slot to hold a copy of the block
  121. * being checked because we temporarily have to zero out the
  122. * crc field. */
  123. struct o2hb_disk_heartbeat_block *hr_tmp_block;
  124. };
  125. struct o2hb_bio_wait_ctxt {
  126. atomic_t wc_num_reqs;
  127. struct completion wc_io_complete;
  128. };
  129. static void o2hb_write_timeout(void *arg)
  130. {
  131. struct o2hb_region *reg = arg;
  132. mlog(ML_ERROR, "Heartbeat write timeout to device %s after %u "
  133. "milliseconds\n", reg->hr_dev_name,
  134. jiffies_to_msecs(jiffies - reg->hr_last_timeout_start));
  135. o2quo_disk_timeout();
  136. }
  137. static void o2hb_arm_write_timeout(struct o2hb_region *reg)
  138. {
  139. mlog(0, "Queue write timeout for %u ms\n", O2HB_MAX_WRITE_TIMEOUT_MS);
  140. cancel_delayed_work(&reg->hr_write_timeout_work);
  141. reg->hr_last_timeout_start = jiffies;
  142. schedule_delayed_work(&reg->hr_write_timeout_work,
  143. msecs_to_jiffies(O2HB_MAX_WRITE_TIMEOUT_MS));
  144. }
  145. static void o2hb_disarm_write_timeout(struct o2hb_region *reg)
  146. {
  147. cancel_delayed_work(&reg->hr_write_timeout_work);
  148. flush_scheduled_work();
  149. }
  150. static inline void o2hb_bio_wait_init(struct o2hb_bio_wait_ctxt *wc,
  151. unsigned int num_ios)
  152. {
  153. atomic_set(&wc->wc_num_reqs, num_ios);
  154. init_completion(&wc->wc_io_complete);
  155. }
  156. /* Used in error paths too */
  157. static inline void o2hb_bio_wait_dec(struct o2hb_bio_wait_ctxt *wc,
  158. unsigned int num)
  159. {
  160. /* sadly atomic_sub_and_test() isn't available on all platforms. The
  161. * good news is that the fast path only completes one at a time */
  162. while(num--) {
  163. if (atomic_dec_and_test(&wc->wc_num_reqs)) {
  164. BUG_ON(num > 0);
  165. complete(&wc->wc_io_complete);
  166. }
  167. }
  168. }
  169. static void o2hb_wait_on_io(struct o2hb_region *reg,
  170. struct o2hb_bio_wait_ctxt *wc)
  171. {
  172. struct address_space *mapping = reg->hr_bdev->bd_inode->i_mapping;
  173. blk_run_address_space(mapping);
  174. wait_for_completion(&wc->wc_io_complete);
  175. }
  176. static int o2hb_bio_end_io(struct bio *bio,
  177. unsigned int bytes_done,
  178. int error)
  179. {
  180. struct o2hb_bio_wait_ctxt *wc = bio->bi_private;
  181. if (error)
  182. mlog(ML_ERROR, "IO Error %d\n", error);
  183. if (bio->bi_size)
  184. return 1;
  185. o2hb_bio_wait_dec(wc, 1);
  186. return 0;
  187. }
  188. /* Setup a Bio to cover I/O against num_slots slots starting at
  189. * start_slot. */
  190. static struct bio *o2hb_setup_one_bio(struct o2hb_region *reg,
  191. struct o2hb_bio_wait_ctxt *wc,
  192. unsigned int start_slot,
  193. unsigned int num_slots)
  194. {
  195. int i, nr_vecs, len, first_page, last_page;
  196. unsigned int vec_len, vec_start;
  197. unsigned int bits = reg->hr_block_bits;
  198. unsigned int spp = reg->hr_slots_per_page;
  199. struct bio *bio;
  200. struct page *page;
  201. nr_vecs = (num_slots + spp - 1) / spp;
  202. /* Testing has shown this allocation to take long enough under
  203. * GFP_KERNEL that the local node can get fenced. It would be
  204. * nicest if we could pre-allocate these bios and avoid this
  205. * all together. */
  206. bio = bio_alloc(GFP_ATOMIC, nr_vecs);
  207. if (!bio) {
  208. mlog(ML_ERROR, "Could not alloc slots BIO!\n");
  209. bio = ERR_PTR(-ENOMEM);
  210. goto bail;
  211. }
  212. /* Must put everything in 512 byte sectors for the bio... */
  213. bio->bi_sector = (reg->hr_start_block + start_slot) << (bits - 9);
  214. bio->bi_bdev = reg->hr_bdev;
  215. bio->bi_private = wc;
  216. bio->bi_end_io = o2hb_bio_end_io;
  217. first_page = start_slot / spp;
  218. last_page = first_page + nr_vecs;
  219. vec_start = (start_slot << bits) % PAGE_CACHE_SIZE;
  220. for(i = first_page; i < last_page; i++) {
  221. page = reg->hr_slot_data[i];
  222. vec_len = PAGE_CACHE_SIZE;
  223. /* last page might be short */
  224. if (((i + 1) * spp) > (start_slot + num_slots))
  225. vec_len = ((num_slots + start_slot) % spp) << bits;
  226. vec_len -= vec_start;
  227. mlog(ML_HB_BIO, "page %d, vec_len = %u, vec_start = %u\n",
  228. i, vec_len, vec_start);
  229. len = bio_add_page(bio, page, vec_len, vec_start);
  230. if (len != vec_len) {
  231. bio_put(bio);
  232. bio = ERR_PTR(-EIO);
  233. mlog(ML_ERROR, "Error adding page to bio i = %d, "
  234. "vec_len = %u, len = %d\n, start = %u\n",
  235. i, vec_len, len, vec_start);
  236. goto bail;
  237. }
  238. vec_start = 0;
  239. }
  240. bail:
  241. return bio;
  242. }
  243. /*
  244. * Compute the maximum number of sectors the bdev can handle in one bio,
  245. * as a power of two.
  246. *
  247. * Stolen from oracleasm, thanks Joel!
  248. */
  249. static int compute_max_sectors(struct block_device *bdev)
  250. {
  251. int max_pages, max_sectors, pow_two_sectors;
  252. struct request_queue *q;
  253. q = bdev_get_queue(bdev);
  254. max_pages = q->max_sectors >> (PAGE_SHIFT - 9);
  255. if (max_pages > BIO_MAX_PAGES)
  256. max_pages = BIO_MAX_PAGES;
  257. if (max_pages > q->max_phys_segments)
  258. max_pages = q->max_phys_segments;
  259. if (max_pages > q->max_hw_segments)
  260. max_pages = q->max_hw_segments;
  261. max_pages--; /* Handle I/Os that straddle a page */
  262. max_sectors = max_pages << (PAGE_SHIFT - 9);
  263. /* Why is fls() 1-based???? */
  264. pow_two_sectors = 1 << (fls(max_sectors) - 1);
  265. return pow_two_sectors;
  266. }
  267. static inline void o2hb_compute_request_limits(struct o2hb_region *reg,
  268. unsigned int num_slots,
  269. unsigned int *num_bios,
  270. unsigned int *slots_per_bio)
  271. {
  272. unsigned int max_sectors, io_sectors;
  273. max_sectors = compute_max_sectors(reg->hr_bdev);
  274. io_sectors = num_slots << (reg->hr_block_bits - 9);
  275. *num_bios = (io_sectors + max_sectors - 1) / max_sectors;
  276. *slots_per_bio = max_sectors >> (reg->hr_block_bits - 9);
  277. mlog(ML_HB_BIO, "My io size is %u sectors for %u slots. This "
  278. "device can handle %u sectors of I/O\n", io_sectors, num_slots,
  279. max_sectors);
  280. mlog(ML_HB_BIO, "Will need %u bios holding %u slots each\n",
  281. *num_bios, *slots_per_bio);
  282. }
  283. static int o2hb_read_slots(struct o2hb_region *reg,
  284. unsigned int max_slots)
  285. {
  286. unsigned int num_bios, slots_per_bio, start_slot, num_slots;
  287. int i, status;
  288. struct o2hb_bio_wait_ctxt wc;
  289. struct bio **bios;
  290. struct bio *bio;
  291. o2hb_compute_request_limits(reg, max_slots, &num_bios, &slots_per_bio);
  292. bios = kcalloc(num_bios, sizeof(struct bio *), GFP_KERNEL);
  293. if (!bios) {
  294. status = -ENOMEM;
  295. mlog_errno(status);
  296. return status;
  297. }
  298. o2hb_bio_wait_init(&wc, num_bios);
  299. num_slots = slots_per_bio;
  300. for(i = 0; i < num_bios; i++) {
  301. start_slot = i * slots_per_bio;
  302. /* adjust num_slots at last bio */
  303. if (max_slots < (start_slot + num_slots))
  304. num_slots = max_slots - start_slot;
  305. bio = o2hb_setup_one_bio(reg, &wc, start_slot, num_slots);
  306. if (IS_ERR(bio)) {
  307. o2hb_bio_wait_dec(&wc, num_bios - i);
  308. status = PTR_ERR(bio);
  309. mlog_errno(status);
  310. goto bail_and_wait;
  311. }
  312. bios[i] = bio;
  313. submit_bio(READ, bio);
  314. }
  315. status = 0;
  316. bail_and_wait:
  317. o2hb_wait_on_io(reg, &wc);
  318. if (bios) {
  319. for(i = 0; i < num_bios; i++)
  320. if (bios[i])
  321. bio_put(bios[i]);
  322. kfree(bios);
  323. }
  324. return status;
  325. }
  326. static int o2hb_issue_node_write(struct o2hb_region *reg,
  327. struct bio **write_bio,
  328. struct o2hb_bio_wait_ctxt *write_wc)
  329. {
  330. int status;
  331. unsigned int slot;
  332. struct bio *bio;
  333. o2hb_bio_wait_init(write_wc, 1);
  334. slot = o2nm_this_node();
  335. bio = o2hb_setup_one_bio(reg, write_wc, slot, 1);
  336. if (IS_ERR(bio)) {
  337. status = PTR_ERR(bio);
  338. mlog_errno(status);
  339. goto bail;
  340. }
  341. submit_bio(WRITE, bio);
  342. *write_bio = bio;
  343. status = 0;
  344. bail:
  345. return status;
  346. }
  347. static u32 o2hb_compute_block_crc_le(struct o2hb_region *reg,
  348. struct o2hb_disk_heartbeat_block *hb_block)
  349. {
  350. __le32 old_cksum;
  351. u32 ret;
  352. /* We want to compute the block crc with a 0 value in the
  353. * hb_cksum field. Save it off here and replace after the
  354. * crc. */
  355. old_cksum = hb_block->hb_cksum;
  356. hb_block->hb_cksum = 0;
  357. ret = crc32_le(0, (unsigned char *) hb_block, reg->hr_block_bytes);
  358. hb_block->hb_cksum = old_cksum;
  359. return ret;
  360. }
  361. static void o2hb_dump_slot(struct o2hb_disk_heartbeat_block *hb_block)
  362. {
  363. mlog(ML_ERROR, "Dump slot information: seq = 0x%llx, node = %u, "
  364. "cksum = 0x%x, generation 0x%llx\n",
  365. (long long)le64_to_cpu(hb_block->hb_seq),
  366. hb_block->hb_node, le32_to_cpu(hb_block->hb_cksum),
  367. (long long)le64_to_cpu(hb_block->hb_generation));
  368. }
  369. static int o2hb_verify_crc(struct o2hb_region *reg,
  370. struct o2hb_disk_heartbeat_block *hb_block)
  371. {
  372. u32 read, computed;
  373. read = le32_to_cpu(hb_block->hb_cksum);
  374. computed = o2hb_compute_block_crc_le(reg, hb_block);
  375. return read == computed;
  376. }
  377. /* We want to make sure that nobody is heartbeating on top of us --
  378. * this will help detect an invalid configuration. */
  379. static int o2hb_check_last_timestamp(struct o2hb_region *reg)
  380. {
  381. int node_num, ret;
  382. struct o2hb_disk_slot *slot;
  383. struct o2hb_disk_heartbeat_block *hb_block;
  384. node_num = o2nm_this_node();
  385. ret = 1;
  386. slot = &reg->hr_slots[node_num];
  387. /* Don't check on our 1st timestamp */
  388. if (slot->ds_last_time) {
  389. hb_block = slot->ds_raw_block;
  390. if (le64_to_cpu(hb_block->hb_seq) != slot->ds_last_time)
  391. ret = 0;
  392. }
  393. return ret;
  394. }
  395. static inline void o2hb_prepare_block(struct o2hb_region *reg,
  396. u64 generation)
  397. {
  398. int node_num;
  399. u64 cputime;
  400. struct o2hb_disk_slot *slot;
  401. struct o2hb_disk_heartbeat_block *hb_block;
  402. node_num = o2nm_this_node();
  403. slot = &reg->hr_slots[node_num];
  404. hb_block = (struct o2hb_disk_heartbeat_block *)slot->ds_raw_block;
  405. memset(hb_block, 0, reg->hr_block_bytes);
  406. /* TODO: time stuff */
  407. cputime = CURRENT_TIME.tv_sec;
  408. if (!cputime)
  409. cputime = 1;
  410. hb_block->hb_seq = cpu_to_le64(cputime);
  411. hb_block->hb_node = node_num;
  412. hb_block->hb_generation = cpu_to_le64(generation);
  413. /* This step must always happen last! */
  414. hb_block->hb_cksum = cpu_to_le32(o2hb_compute_block_crc_le(reg,
  415. hb_block));
  416. mlog(ML_HB_BIO, "our node generation = 0x%llx, cksum = 0x%x\n",
  417. (long long)cpu_to_le64(generation),
  418. le32_to_cpu(hb_block->hb_cksum));
  419. }
  420. static void o2hb_fire_callbacks(struct o2hb_callback *hbcall,
  421. struct o2nm_node *node,
  422. int idx)
  423. {
  424. struct list_head *iter;
  425. struct o2hb_callback_func *f;
  426. list_for_each(iter, &hbcall->list) {
  427. f = list_entry(iter, struct o2hb_callback_func, hc_item);
  428. mlog(ML_HEARTBEAT, "calling funcs %p\n", f);
  429. (f->hc_func)(node, idx, f->hc_data);
  430. }
  431. }
  432. /* Will run the list in order until we process the passed event */
  433. static void o2hb_run_event_list(struct o2hb_node_event *queued_event)
  434. {
  435. int empty;
  436. struct o2hb_callback *hbcall;
  437. struct o2hb_node_event *event;
  438. spin_lock(&o2hb_live_lock);
  439. empty = list_empty(&queued_event->hn_item);
  440. spin_unlock(&o2hb_live_lock);
  441. if (empty)
  442. return;
  443. /* Holding callback sem assures we don't alter the callback
  444. * lists when doing this, and serializes ourselves with other
  445. * processes wanting callbacks. */
  446. down_write(&o2hb_callback_sem);
  447. spin_lock(&o2hb_live_lock);
  448. while (!list_empty(&o2hb_node_events)
  449. && !list_empty(&queued_event->hn_item)) {
  450. event = list_entry(o2hb_node_events.next,
  451. struct o2hb_node_event,
  452. hn_item);
  453. list_del_init(&event->hn_item);
  454. spin_unlock(&o2hb_live_lock);
  455. mlog(ML_HEARTBEAT, "Node %s event for %d\n",
  456. event->hn_event_type == O2HB_NODE_UP_CB ? "UP" : "DOWN",
  457. event->hn_node_num);
  458. hbcall = hbcall_from_type(event->hn_event_type);
  459. /* We should *never* have gotten on to the list with a
  460. * bad type... This isn't something that we should try
  461. * to recover from. */
  462. BUG_ON(IS_ERR(hbcall));
  463. o2hb_fire_callbacks(hbcall, event->hn_node, event->hn_node_num);
  464. spin_lock(&o2hb_live_lock);
  465. }
  466. spin_unlock(&o2hb_live_lock);
  467. up_write(&o2hb_callback_sem);
  468. }
  469. static void o2hb_queue_node_event(struct o2hb_node_event *event,
  470. enum o2hb_callback_type type,
  471. struct o2nm_node *node,
  472. int node_num)
  473. {
  474. assert_spin_locked(&o2hb_live_lock);
  475. event->hn_event_type = type;
  476. event->hn_node = node;
  477. event->hn_node_num = node_num;
  478. mlog(ML_HEARTBEAT, "Queue node %s event for node %d\n",
  479. type == O2HB_NODE_UP_CB ? "UP" : "DOWN", node_num);
  480. list_add_tail(&event->hn_item, &o2hb_node_events);
  481. }
  482. static void o2hb_shutdown_slot(struct o2hb_disk_slot *slot)
  483. {
  484. struct o2hb_node_event event =
  485. { .hn_item = LIST_HEAD_INIT(event.hn_item), };
  486. struct o2nm_node *node;
  487. node = o2nm_get_node_by_num(slot->ds_node_num);
  488. if (!node)
  489. return;
  490. spin_lock(&o2hb_live_lock);
  491. if (!list_empty(&slot->ds_live_item)) {
  492. mlog(ML_HEARTBEAT, "Shutdown, node %d leaves region\n",
  493. slot->ds_node_num);
  494. list_del_init(&slot->ds_live_item);
  495. if (list_empty(&o2hb_live_slots[slot->ds_node_num])) {
  496. clear_bit(slot->ds_node_num, o2hb_live_node_bitmap);
  497. o2hb_queue_node_event(&event, O2HB_NODE_DOWN_CB, node,
  498. slot->ds_node_num);
  499. }
  500. }
  501. spin_unlock(&o2hb_live_lock);
  502. o2hb_run_event_list(&event);
  503. o2nm_node_put(node);
  504. }
  505. static int o2hb_check_slot(struct o2hb_region *reg,
  506. struct o2hb_disk_slot *slot)
  507. {
  508. int changed = 0, gen_changed = 0;
  509. struct o2hb_node_event event =
  510. { .hn_item = LIST_HEAD_INIT(event.hn_item), };
  511. struct o2nm_node *node;
  512. struct o2hb_disk_heartbeat_block *hb_block = reg->hr_tmp_block;
  513. u64 cputime;
  514. memcpy(hb_block, slot->ds_raw_block, reg->hr_block_bytes);
  515. /* Is this correct? Do we assume that the node doesn't exist
  516. * if we're not configured for him? */
  517. node = o2nm_get_node_by_num(slot->ds_node_num);
  518. if (!node)
  519. return 0;
  520. if (!o2hb_verify_crc(reg, hb_block)) {
  521. /* all paths from here will drop o2hb_live_lock for
  522. * us. */
  523. spin_lock(&o2hb_live_lock);
  524. /* Don't print an error on the console in this case -
  525. * a freshly formatted heartbeat area will not have a
  526. * crc set on it. */
  527. if (list_empty(&slot->ds_live_item))
  528. goto out;
  529. /* The node is live but pushed out a bad crc. We
  530. * consider it a transient miss but don't populate any
  531. * other values as they may be junk. */
  532. mlog(ML_ERROR, "Node %d has written a bad crc to %s\n",
  533. slot->ds_node_num, reg->hr_dev_name);
  534. o2hb_dump_slot(hb_block);
  535. slot->ds_equal_samples++;
  536. goto fire_callbacks;
  537. }
  538. /* we don't care if these wrap.. the state transitions below
  539. * clear at the right places */
  540. cputime = le64_to_cpu(hb_block->hb_seq);
  541. if (slot->ds_last_time != cputime)
  542. slot->ds_changed_samples++;
  543. else
  544. slot->ds_equal_samples++;
  545. slot->ds_last_time = cputime;
  546. /* The node changed heartbeat generations. We assume this to
  547. * mean it dropped off but came back before we timed out. We
  548. * want to consider it down for the time being but don't want
  549. * to lose any changed_samples state we might build up to
  550. * considering it live again. */
  551. if (slot->ds_last_generation != le64_to_cpu(hb_block->hb_generation)) {
  552. gen_changed = 1;
  553. slot->ds_equal_samples = 0;
  554. mlog(ML_HEARTBEAT, "Node %d changed generation (0x%llx "
  555. "to 0x%llx)\n", slot->ds_node_num,
  556. (long long)slot->ds_last_generation,
  557. (long long)le64_to_cpu(hb_block->hb_generation));
  558. }
  559. slot->ds_last_generation = le64_to_cpu(hb_block->hb_generation);
  560. mlog(ML_HEARTBEAT, "Slot %d gen 0x%llx cksum 0x%x "
  561. "seq %llu last %llu changed %u equal %u\n",
  562. slot->ds_node_num, (long long)slot->ds_last_generation,
  563. le32_to_cpu(hb_block->hb_cksum),
  564. (unsigned long long)le64_to_cpu(hb_block->hb_seq),
  565. (unsigned long long)slot->ds_last_time, slot->ds_changed_samples,
  566. slot->ds_equal_samples);
  567. spin_lock(&o2hb_live_lock);
  568. fire_callbacks:
  569. /* dead nodes only come to life after some number of
  570. * changes at any time during their dead time */
  571. if (list_empty(&slot->ds_live_item) &&
  572. slot->ds_changed_samples >= O2HB_LIVE_THRESHOLD) {
  573. mlog(ML_HEARTBEAT, "Node %d (id 0x%llx) joined my region\n",
  574. slot->ds_node_num, (long long)slot->ds_last_generation);
  575. /* first on the list generates a callback */
  576. if (list_empty(&o2hb_live_slots[slot->ds_node_num])) {
  577. set_bit(slot->ds_node_num, o2hb_live_node_bitmap);
  578. o2hb_queue_node_event(&event, O2HB_NODE_UP_CB, node,
  579. slot->ds_node_num);
  580. changed = 1;
  581. }
  582. list_add_tail(&slot->ds_live_item,
  583. &o2hb_live_slots[slot->ds_node_num]);
  584. slot->ds_equal_samples = 0;
  585. goto out;
  586. }
  587. /* if the list is dead, we're done.. */
  588. if (list_empty(&slot->ds_live_item))
  589. goto out;
  590. /* live nodes only go dead after enough consequtive missed
  591. * samples.. reset the missed counter whenever we see
  592. * activity */
  593. if (slot->ds_equal_samples >= o2hb_dead_threshold || gen_changed) {
  594. mlog(ML_HEARTBEAT, "Node %d left my region\n",
  595. slot->ds_node_num);
  596. /* last off the live_slot generates a callback */
  597. list_del_init(&slot->ds_live_item);
  598. if (list_empty(&o2hb_live_slots[slot->ds_node_num])) {
  599. clear_bit(slot->ds_node_num, o2hb_live_node_bitmap);
  600. o2hb_queue_node_event(&event, O2HB_NODE_DOWN_CB, node,
  601. slot->ds_node_num);
  602. changed = 1;
  603. }
  604. /* We don't clear this because the node is still
  605. * actually writing new blocks. */
  606. if (!gen_changed)
  607. slot->ds_changed_samples = 0;
  608. goto out;
  609. }
  610. if (slot->ds_changed_samples) {
  611. slot->ds_changed_samples = 0;
  612. slot->ds_equal_samples = 0;
  613. }
  614. out:
  615. spin_unlock(&o2hb_live_lock);
  616. o2hb_run_event_list(&event);
  617. o2nm_node_put(node);
  618. return changed;
  619. }
  620. /* This could be faster if we just implmented a find_last_bit, but I
  621. * don't think the circumstances warrant it. */
  622. static int o2hb_highest_node(unsigned long *nodes,
  623. int numbits)
  624. {
  625. int highest, node;
  626. highest = numbits;
  627. node = -1;
  628. while ((node = find_next_bit(nodes, numbits, node + 1)) != -1) {
  629. if (node >= numbits)
  630. break;
  631. highest = node;
  632. }
  633. return highest;
  634. }
  635. static void o2hb_do_disk_heartbeat(struct o2hb_region *reg)
  636. {
  637. int i, ret, highest_node, change = 0;
  638. unsigned long configured_nodes[BITS_TO_LONGS(O2NM_MAX_NODES)];
  639. struct bio *write_bio;
  640. struct o2hb_bio_wait_ctxt write_wc;
  641. if (o2nm_configured_node_map(configured_nodes, sizeof(configured_nodes)))
  642. return;
  643. highest_node = o2hb_highest_node(configured_nodes, O2NM_MAX_NODES);
  644. if (highest_node >= O2NM_MAX_NODES) {
  645. mlog(ML_NOTICE, "ocfs2_heartbeat: no configured nodes found!\n");
  646. return;
  647. }
  648. /* No sense in reading the slots of nodes that don't exist
  649. * yet. Of course, if the node definitions have holes in them
  650. * then we're reading an empty slot anyway... Consider this
  651. * best-effort. */
  652. ret = o2hb_read_slots(reg, highest_node + 1);
  653. if (ret < 0) {
  654. mlog_errno(ret);
  655. return;
  656. }
  657. /* With an up to date view of the slots, we can check that no
  658. * other node has been improperly configured to heartbeat in
  659. * our slot. */
  660. if (!o2hb_check_last_timestamp(reg))
  661. mlog(ML_ERROR, "Device \"%s\": another node is heartbeating "
  662. "in our slot!\n", reg->hr_dev_name);
  663. /* fill in the proper info for our next heartbeat */
  664. o2hb_prepare_block(reg, reg->hr_generation);
  665. /* And fire off the write. Note that we don't wait on this I/O
  666. * until later. */
  667. ret = o2hb_issue_node_write(reg, &write_bio, &write_wc);
  668. if (ret < 0) {
  669. mlog_errno(ret);
  670. return;
  671. }
  672. i = -1;
  673. while((i = find_next_bit(configured_nodes, O2NM_MAX_NODES, i + 1)) < O2NM_MAX_NODES) {
  674. change |= o2hb_check_slot(reg, &reg->hr_slots[i]);
  675. }
  676. /*
  677. * We have to be sure we've advertised ourselves on disk
  678. * before we can go to steady state. This ensures that
  679. * people we find in our steady state have seen us.
  680. */
  681. o2hb_wait_on_io(reg, &write_wc);
  682. bio_put(write_bio);
  683. o2hb_arm_write_timeout(reg);
  684. /* let the person who launched us know when things are steady */
  685. if (!change && (atomic_read(&reg->hr_steady_iterations) != 0)) {
  686. if (atomic_dec_and_test(&reg->hr_steady_iterations))
  687. wake_up(&o2hb_steady_queue);
  688. }
  689. }
  690. /* Subtract b from a, storing the result in a. a *must* have a larger
  691. * value than b. */
  692. static void o2hb_tv_subtract(struct timeval *a,
  693. struct timeval *b)
  694. {
  695. /* just return 0 when a is after b */
  696. if (a->tv_sec < b->tv_sec ||
  697. (a->tv_sec == b->tv_sec && a->tv_usec < b->tv_usec)) {
  698. a->tv_sec = 0;
  699. a->tv_usec = 0;
  700. return;
  701. }
  702. a->tv_sec -= b->tv_sec;
  703. a->tv_usec -= b->tv_usec;
  704. while ( a->tv_usec < 0 ) {
  705. a->tv_sec--;
  706. a->tv_usec += 1000000;
  707. }
  708. }
  709. static unsigned int o2hb_elapsed_msecs(struct timeval *start,
  710. struct timeval *end)
  711. {
  712. struct timeval res = *end;
  713. o2hb_tv_subtract(&res, start);
  714. return res.tv_sec * 1000 + res.tv_usec / 1000;
  715. }
  716. /*
  717. * we ride the region ref that the region dir holds. before the region
  718. * dir is removed and drops it ref it will wait to tear down this
  719. * thread.
  720. */
  721. static int o2hb_thread(void *data)
  722. {
  723. int i, ret;
  724. struct o2hb_region *reg = data;
  725. struct bio *write_bio;
  726. struct o2hb_bio_wait_ctxt write_wc;
  727. struct timeval before_hb, after_hb;
  728. unsigned int elapsed_msec;
  729. mlog(ML_HEARTBEAT|ML_KTHREAD, "hb thread running\n");
  730. set_user_nice(current, -20);
  731. while (!kthread_should_stop() && !reg->hr_unclean_stop) {
  732. /* We track the time spent inside
  733. * o2hb_do_disk_heartbeat so that we avoid more then
  734. * hr_timeout_ms between disk writes. On busy systems
  735. * this should result in a heartbeat which is less
  736. * likely to time itself out. */
  737. do_gettimeofday(&before_hb);
  738. o2hb_do_disk_heartbeat(reg);
  739. do_gettimeofday(&after_hb);
  740. elapsed_msec = o2hb_elapsed_msecs(&before_hb, &after_hb);
  741. mlog(0, "start = %lu.%lu, end = %lu.%lu, msec = %u\n",
  742. before_hb.tv_sec, (unsigned long) before_hb.tv_usec,
  743. after_hb.tv_sec, (unsigned long) after_hb.tv_usec,
  744. elapsed_msec);
  745. if (elapsed_msec < reg->hr_timeout_ms) {
  746. /* the kthread api has blocked signals for us so no
  747. * need to record the return value. */
  748. msleep_interruptible(reg->hr_timeout_ms - elapsed_msec);
  749. }
  750. }
  751. o2hb_disarm_write_timeout(reg);
  752. /* unclean stop is only used in very bad situation */
  753. for(i = 0; !reg->hr_unclean_stop && i < reg->hr_blocks; i++)
  754. o2hb_shutdown_slot(&reg->hr_slots[i]);
  755. /* Explicit down notification - avoid forcing the other nodes
  756. * to timeout on this region when we could just as easily
  757. * write a clear generation - thus indicating to them that
  758. * this node has left this region.
  759. *
  760. * XXX: Should we skip this on unclean_stop? */
  761. o2hb_prepare_block(reg, 0);
  762. ret = o2hb_issue_node_write(reg, &write_bio, &write_wc);
  763. if (ret == 0) {
  764. o2hb_wait_on_io(reg, &write_wc);
  765. bio_put(write_bio);
  766. } else {
  767. mlog_errno(ret);
  768. }
  769. mlog(ML_HEARTBEAT|ML_KTHREAD, "hb thread exiting\n");
  770. return 0;
  771. }
  772. void o2hb_init(void)
  773. {
  774. int i;
  775. for (i = 0; i < ARRAY_SIZE(o2hb_callbacks); i++)
  776. INIT_LIST_HEAD(&o2hb_callbacks[i].list);
  777. for (i = 0; i < ARRAY_SIZE(o2hb_live_slots); i++)
  778. INIT_LIST_HEAD(&o2hb_live_slots[i]);
  779. INIT_LIST_HEAD(&o2hb_node_events);
  780. memset(o2hb_live_node_bitmap, 0, sizeof(o2hb_live_node_bitmap));
  781. }
  782. /* if we're already in a callback then we're already serialized by the sem */
  783. static void o2hb_fill_node_map_from_callback(unsigned long *map,
  784. unsigned bytes)
  785. {
  786. BUG_ON(bytes < (BITS_TO_LONGS(O2NM_MAX_NODES) * sizeof(unsigned long)));
  787. memcpy(map, &o2hb_live_node_bitmap, bytes);
  788. }
  789. /*
  790. * get a map of all nodes that are heartbeating in any regions
  791. */
  792. void o2hb_fill_node_map(unsigned long *map, unsigned bytes)
  793. {
  794. /* callers want to serialize this map and callbacks so that they
  795. * can trust that they don't miss nodes coming to the party */
  796. down_read(&o2hb_callback_sem);
  797. spin_lock(&o2hb_live_lock);
  798. o2hb_fill_node_map_from_callback(map, bytes);
  799. spin_unlock(&o2hb_live_lock);
  800. up_read(&o2hb_callback_sem);
  801. }
  802. EXPORT_SYMBOL_GPL(o2hb_fill_node_map);
  803. /*
  804. * heartbeat configfs bits. The heartbeat set is a default set under
  805. * the cluster set in nodemanager.c.
  806. */
  807. static struct o2hb_region *to_o2hb_region(struct config_item *item)
  808. {
  809. return item ? container_of(item, struct o2hb_region, hr_item) : NULL;
  810. }
  811. /* drop_item only drops its ref after killing the thread, nothing should
  812. * be using the region anymore. this has to clean up any state that
  813. * attributes might have built up. */
  814. static void o2hb_region_release(struct config_item *item)
  815. {
  816. int i;
  817. struct page *page;
  818. struct o2hb_region *reg = to_o2hb_region(item);
  819. if (reg->hr_tmp_block)
  820. kfree(reg->hr_tmp_block);
  821. if (reg->hr_slot_data) {
  822. for (i = 0; i < reg->hr_num_pages; i++) {
  823. page = reg->hr_slot_data[i];
  824. if (page)
  825. __free_page(page);
  826. }
  827. kfree(reg->hr_slot_data);
  828. }
  829. if (reg->hr_bdev)
  830. blkdev_put(reg->hr_bdev);
  831. if (reg->hr_slots)
  832. kfree(reg->hr_slots);
  833. spin_lock(&o2hb_live_lock);
  834. list_del(&reg->hr_all_item);
  835. spin_unlock(&o2hb_live_lock);
  836. kfree(reg);
  837. }
  838. static int o2hb_read_block_input(struct o2hb_region *reg,
  839. const char *page,
  840. size_t count,
  841. unsigned long *ret_bytes,
  842. unsigned int *ret_bits)
  843. {
  844. unsigned long bytes;
  845. char *p = (char *)page;
  846. bytes = simple_strtoul(p, &p, 0);
  847. if (!p || (*p && (*p != '\n')))
  848. return -EINVAL;
  849. /* Heartbeat and fs min / max block sizes are the same. */
  850. if (bytes > 4096 || bytes < 512)
  851. return -ERANGE;
  852. if (hweight16(bytes) != 1)
  853. return -EINVAL;
  854. if (ret_bytes)
  855. *ret_bytes = bytes;
  856. if (ret_bits)
  857. *ret_bits = ffs(bytes) - 1;
  858. return 0;
  859. }
  860. static ssize_t o2hb_region_block_bytes_read(struct o2hb_region *reg,
  861. char *page)
  862. {
  863. return sprintf(page, "%u\n", reg->hr_block_bytes);
  864. }
  865. static ssize_t o2hb_region_block_bytes_write(struct o2hb_region *reg,
  866. const char *page,
  867. size_t count)
  868. {
  869. int status;
  870. unsigned long block_bytes;
  871. unsigned int block_bits;
  872. if (reg->hr_bdev)
  873. return -EINVAL;
  874. status = o2hb_read_block_input(reg, page, count,
  875. &block_bytes, &block_bits);
  876. if (status)
  877. return status;
  878. reg->hr_block_bytes = (unsigned int)block_bytes;
  879. reg->hr_block_bits = block_bits;
  880. return count;
  881. }
  882. static ssize_t o2hb_region_start_block_read(struct o2hb_region *reg,
  883. char *page)
  884. {
  885. return sprintf(page, "%llu\n", reg->hr_start_block);
  886. }
  887. static ssize_t o2hb_region_start_block_write(struct o2hb_region *reg,
  888. const char *page,
  889. size_t count)
  890. {
  891. unsigned long long tmp;
  892. char *p = (char *)page;
  893. if (reg->hr_bdev)
  894. return -EINVAL;
  895. tmp = simple_strtoull(p, &p, 0);
  896. if (!p || (*p && (*p != '\n')))
  897. return -EINVAL;
  898. reg->hr_start_block = tmp;
  899. return count;
  900. }
  901. static ssize_t o2hb_region_blocks_read(struct o2hb_region *reg,
  902. char *page)
  903. {
  904. return sprintf(page, "%d\n", reg->hr_blocks);
  905. }
  906. static ssize_t o2hb_region_blocks_write(struct o2hb_region *reg,
  907. const char *page,
  908. size_t count)
  909. {
  910. unsigned long tmp;
  911. char *p = (char *)page;
  912. if (reg->hr_bdev)
  913. return -EINVAL;
  914. tmp = simple_strtoul(p, &p, 0);
  915. if (!p || (*p && (*p != '\n')))
  916. return -EINVAL;
  917. if (tmp > O2NM_MAX_NODES || tmp == 0)
  918. return -ERANGE;
  919. reg->hr_blocks = (unsigned int)tmp;
  920. return count;
  921. }
  922. static ssize_t o2hb_region_dev_read(struct o2hb_region *reg,
  923. char *page)
  924. {
  925. unsigned int ret = 0;
  926. if (reg->hr_bdev)
  927. ret = sprintf(page, "%s\n", reg->hr_dev_name);
  928. return ret;
  929. }
  930. static void o2hb_init_region_params(struct o2hb_region *reg)
  931. {
  932. reg->hr_slots_per_page = PAGE_CACHE_SIZE >> reg->hr_block_bits;
  933. reg->hr_timeout_ms = O2HB_REGION_TIMEOUT_MS;
  934. mlog(ML_HEARTBEAT, "hr_start_block = %llu, hr_blocks = %u\n",
  935. reg->hr_start_block, reg->hr_blocks);
  936. mlog(ML_HEARTBEAT, "hr_block_bytes = %u, hr_block_bits = %u\n",
  937. reg->hr_block_bytes, reg->hr_block_bits);
  938. mlog(ML_HEARTBEAT, "hr_timeout_ms = %u\n", reg->hr_timeout_ms);
  939. mlog(ML_HEARTBEAT, "dead threshold = %u\n", o2hb_dead_threshold);
  940. }
  941. static int o2hb_map_slot_data(struct o2hb_region *reg)
  942. {
  943. int i, j;
  944. unsigned int last_slot;
  945. unsigned int spp = reg->hr_slots_per_page;
  946. struct page *page;
  947. char *raw;
  948. struct o2hb_disk_slot *slot;
  949. reg->hr_tmp_block = kmalloc(reg->hr_block_bytes, GFP_KERNEL);
  950. if (reg->hr_tmp_block == NULL) {
  951. mlog_errno(-ENOMEM);
  952. return -ENOMEM;
  953. }
  954. reg->hr_slots = kcalloc(reg->hr_blocks,
  955. sizeof(struct o2hb_disk_slot), GFP_KERNEL);
  956. if (reg->hr_slots == NULL) {
  957. mlog_errno(-ENOMEM);
  958. return -ENOMEM;
  959. }
  960. for(i = 0; i < reg->hr_blocks; i++) {
  961. slot = &reg->hr_slots[i];
  962. slot->ds_node_num = i;
  963. INIT_LIST_HEAD(&slot->ds_live_item);
  964. slot->ds_raw_block = NULL;
  965. }
  966. reg->hr_num_pages = (reg->hr_blocks + spp - 1) / spp;
  967. mlog(ML_HEARTBEAT, "Going to require %u pages to cover %u blocks "
  968. "at %u blocks per page\n",
  969. reg->hr_num_pages, reg->hr_blocks, spp);
  970. reg->hr_slot_data = kcalloc(reg->hr_num_pages, sizeof(struct page *),
  971. GFP_KERNEL);
  972. if (!reg->hr_slot_data) {
  973. mlog_errno(-ENOMEM);
  974. return -ENOMEM;
  975. }
  976. for(i = 0; i < reg->hr_num_pages; i++) {
  977. page = alloc_page(GFP_KERNEL);
  978. if (!page) {
  979. mlog_errno(-ENOMEM);
  980. return -ENOMEM;
  981. }
  982. reg->hr_slot_data[i] = page;
  983. last_slot = i * spp;
  984. raw = page_address(page);
  985. for (j = 0;
  986. (j < spp) && ((j + last_slot) < reg->hr_blocks);
  987. j++) {
  988. BUG_ON((j + last_slot) >= reg->hr_blocks);
  989. slot = &reg->hr_slots[j + last_slot];
  990. slot->ds_raw_block =
  991. (struct o2hb_disk_heartbeat_block *) raw;
  992. raw += reg->hr_block_bytes;
  993. }
  994. }
  995. return 0;
  996. }
  997. /* Read in all the slots available and populate the tracking
  998. * structures so that we can start with a baseline idea of what's
  999. * there. */
  1000. static int o2hb_populate_slot_data(struct o2hb_region *reg)
  1001. {
  1002. int ret, i;
  1003. struct o2hb_disk_slot *slot;
  1004. struct o2hb_disk_heartbeat_block *hb_block;
  1005. mlog_entry_void();
  1006. ret = o2hb_read_slots(reg, reg->hr_blocks);
  1007. if (ret) {
  1008. mlog_errno(ret);
  1009. goto out;
  1010. }
  1011. /* We only want to get an idea of the values initially in each
  1012. * slot, so we do no verification - o2hb_check_slot will
  1013. * actually determine if each configured slot is valid and
  1014. * whether any values have changed. */
  1015. for(i = 0; i < reg->hr_blocks; i++) {
  1016. slot = &reg->hr_slots[i];
  1017. hb_block = (struct o2hb_disk_heartbeat_block *) slot->ds_raw_block;
  1018. /* Only fill the values that o2hb_check_slot uses to
  1019. * determine changing slots */
  1020. slot->ds_last_time = le64_to_cpu(hb_block->hb_seq);
  1021. slot->ds_last_generation = le64_to_cpu(hb_block->hb_generation);
  1022. }
  1023. out:
  1024. mlog_exit(ret);
  1025. return ret;
  1026. }
  1027. /* this is acting as commit; we set up all of hr_bdev and hr_task or nothing */
  1028. static ssize_t o2hb_region_dev_write(struct o2hb_region *reg,
  1029. const char *page,
  1030. size_t count)
  1031. {
  1032. long fd;
  1033. int sectsize;
  1034. char *p = (char *)page;
  1035. struct file *filp = NULL;
  1036. struct inode *inode = NULL;
  1037. ssize_t ret = -EINVAL;
  1038. if (reg->hr_bdev)
  1039. goto out;
  1040. /* We can't heartbeat without having had our node number
  1041. * configured yet. */
  1042. if (o2nm_this_node() == O2NM_MAX_NODES)
  1043. goto out;
  1044. fd = simple_strtol(p, &p, 0);
  1045. if (!p || (*p && (*p != '\n')))
  1046. goto out;
  1047. if (fd < 0 || fd >= INT_MAX)
  1048. goto out;
  1049. filp = fget(fd);
  1050. if (filp == NULL)
  1051. goto out;
  1052. if (reg->hr_blocks == 0 || reg->hr_start_block == 0 ||
  1053. reg->hr_block_bytes == 0)
  1054. goto out;
  1055. inode = igrab(filp->f_mapping->host);
  1056. if (inode == NULL)
  1057. goto out;
  1058. if (!S_ISBLK(inode->i_mode))
  1059. goto out;
  1060. reg->hr_bdev = I_BDEV(filp->f_mapping->host);
  1061. ret = blkdev_get(reg->hr_bdev, FMODE_WRITE | FMODE_READ, 0);
  1062. if (ret) {
  1063. reg->hr_bdev = NULL;
  1064. goto out;
  1065. }
  1066. inode = NULL;
  1067. bdevname(reg->hr_bdev, reg->hr_dev_name);
  1068. sectsize = bdev_hardsect_size(reg->hr_bdev);
  1069. if (sectsize != reg->hr_block_bytes) {
  1070. mlog(ML_ERROR,
  1071. "blocksize %u incorrect for device, expected %d",
  1072. reg->hr_block_bytes, sectsize);
  1073. ret = -EINVAL;
  1074. goto out;
  1075. }
  1076. o2hb_init_region_params(reg);
  1077. /* Generation of zero is invalid */
  1078. do {
  1079. get_random_bytes(&reg->hr_generation,
  1080. sizeof(reg->hr_generation));
  1081. } while (reg->hr_generation == 0);
  1082. ret = o2hb_map_slot_data(reg);
  1083. if (ret) {
  1084. mlog_errno(ret);
  1085. goto out;
  1086. }
  1087. ret = o2hb_populate_slot_data(reg);
  1088. if (ret) {
  1089. mlog_errno(ret);
  1090. goto out;
  1091. }
  1092. INIT_WORK(&reg->hr_write_timeout_work, o2hb_write_timeout, reg);
  1093. /*
  1094. * A node is considered live after it has beat LIVE_THRESHOLD
  1095. * times. We're not steady until we've given them a chance
  1096. * _after_ our first read.
  1097. */
  1098. atomic_set(&reg->hr_steady_iterations, O2HB_LIVE_THRESHOLD + 1);
  1099. reg->hr_task = kthread_run(o2hb_thread, reg, "o2hb-%s",
  1100. reg->hr_item.ci_name);
  1101. if (IS_ERR(reg->hr_task)) {
  1102. ret = PTR_ERR(reg->hr_task);
  1103. mlog_errno(ret);
  1104. reg->hr_task = NULL;
  1105. goto out;
  1106. }
  1107. ret = wait_event_interruptible(o2hb_steady_queue,
  1108. atomic_read(&reg->hr_steady_iterations) == 0);
  1109. if (ret) {
  1110. kthread_stop(reg->hr_task);
  1111. reg->hr_task = NULL;
  1112. goto out;
  1113. }
  1114. ret = count;
  1115. out:
  1116. if (filp)
  1117. fput(filp);
  1118. if (inode)
  1119. iput(inode);
  1120. if (ret < 0) {
  1121. if (reg->hr_bdev) {
  1122. blkdev_put(reg->hr_bdev);
  1123. reg->hr_bdev = NULL;
  1124. }
  1125. }
  1126. return ret;
  1127. }
  1128. struct o2hb_region_attribute {
  1129. struct configfs_attribute attr;
  1130. ssize_t (*show)(struct o2hb_region *, char *);
  1131. ssize_t (*store)(struct o2hb_region *, const char *, size_t);
  1132. };
  1133. static struct o2hb_region_attribute o2hb_region_attr_block_bytes = {
  1134. .attr = { .ca_owner = THIS_MODULE,
  1135. .ca_name = "block_bytes",
  1136. .ca_mode = S_IRUGO | S_IWUSR },
  1137. .show = o2hb_region_block_bytes_read,
  1138. .store = o2hb_region_block_bytes_write,
  1139. };
  1140. static struct o2hb_region_attribute o2hb_region_attr_start_block = {
  1141. .attr = { .ca_owner = THIS_MODULE,
  1142. .ca_name = "start_block",
  1143. .ca_mode = S_IRUGO | S_IWUSR },
  1144. .show = o2hb_region_start_block_read,
  1145. .store = o2hb_region_start_block_write,
  1146. };
  1147. static struct o2hb_region_attribute o2hb_region_attr_blocks = {
  1148. .attr = { .ca_owner = THIS_MODULE,
  1149. .ca_name = "blocks",
  1150. .ca_mode = S_IRUGO | S_IWUSR },
  1151. .show = o2hb_region_blocks_read,
  1152. .store = o2hb_region_blocks_write,
  1153. };
  1154. static struct o2hb_region_attribute o2hb_region_attr_dev = {
  1155. .attr = { .ca_owner = THIS_MODULE,
  1156. .ca_name = "dev",
  1157. .ca_mode = S_IRUGO | S_IWUSR },
  1158. .show = o2hb_region_dev_read,
  1159. .store = o2hb_region_dev_write,
  1160. };
  1161. static struct configfs_attribute *o2hb_region_attrs[] = {
  1162. &o2hb_region_attr_block_bytes.attr,
  1163. &o2hb_region_attr_start_block.attr,
  1164. &o2hb_region_attr_blocks.attr,
  1165. &o2hb_region_attr_dev.attr,
  1166. NULL,
  1167. };
  1168. static ssize_t o2hb_region_show(struct config_item *item,
  1169. struct configfs_attribute *attr,
  1170. char *page)
  1171. {
  1172. struct o2hb_region *reg = to_o2hb_region(item);
  1173. struct o2hb_region_attribute *o2hb_region_attr =
  1174. container_of(attr, struct o2hb_region_attribute, attr);
  1175. ssize_t ret = 0;
  1176. if (o2hb_region_attr->show)
  1177. ret = o2hb_region_attr->show(reg, page);
  1178. return ret;
  1179. }
  1180. static ssize_t o2hb_region_store(struct config_item *item,
  1181. struct configfs_attribute *attr,
  1182. const char *page, size_t count)
  1183. {
  1184. struct o2hb_region *reg = to_o2hb_region(item);
  1185. struct o2hb_region_attribute *o2hb_region_attr =
  1186. container_of(attr, struct o2hb_region_attribute, attr);
  1187. ssize_t ret = -EINVAL;
  1188. if (o2hb_region_attr->store)
  1189. ret = o2hb_region_attr->store(reg, page, count);
  1190. return ret;
  1191. }
  1192. static struct configfs_item_operations o2hb_region_item_ops = {
  1193. .release = o2hb_region_release,
  1194. .show_attribute = o2hb_region_show,
  1195. .store_attribute = o2hb_region_store,
  1196. };
  1197. static struct config_item_type o2hb_region_type = {
  1198. .ct_item_ops = &o2hb_region_item_ops,
  1199. .ct_attrs = o2hb_region_attrs,
  1200. .ct_owner = THIS_MODULE,
  1201. };
  1202. /* heartbeat set */
  1203. struct o2hb_heartbeat_group {
  1204. struct config_group hs_group;
  1205. /* some stuff? */
  1206. };
  1207. static struct o2hb_heartbeat_group *to_o2hb_heartbeat_group(struct config_group *group)
  1208. {
  1209. return group ?
  1210. container_of(group, struct o2hb_heartbeat_group, hs_group)
  1211. : NULL;
  1212. }
  1213. static struct config_item *o2hb_heartbeat_group_make_item(struct config_group *group,
  1214. const char *name)
  1215. {
  1216. struct o2hb_region *reg = NULL;
  1217. struct config_item *ret = NULL;
  1218. reg = kcalloc(1, sizeof(struct o2hb_region), GFP_KERNEL);
  1219. if (reg == NULL)
  1220. goto out; /* ENOMEM */
  1221. config_item_init_type_name(&reg->hr_item, name, &o2hb_region_type);
  1222. ret = &reg->hr_item;
  1223. spin_lock(&o2hb_live_lock);
  1224. list_add_tail(&reg->hr_all_item, &o2hb_all_regions);
  1225. spin_unlock(&o2hb_live_lock);
  1226. out:
  1227. if (ret == NULL)
  1228. kfree(reg);
  1229. return ret;
  1230. }
  1231. static void o2hb_heartbeat_group_drop_item(struct config_group *group,
  1232. struct config_item *item)
  1233. {
  1234. struct o2hb_region *reg = to_o2hb_region(item);
  1235. /* stop the thread when the user removes the region dir */
  1236. if (reg->hr_task) {
  1237. kthread_stop(reg->hr_task);
  1238. reg->hr_task = NULL;
  1239. }
  1240. config_item_put(item);
  1241. }
  1242. struct o2hb_heartbeat_group_attribute {
  1243. struct configfs_attribute attr;
  1244. ssize_t (*show)(struct o2hb_heartbeat_group *, char *);
  1245. ssize_t (*store)(struct o2hb_heartbeat_group *, const char *, size_t);
  1246. };
  1247. static ssize_t o2hb_heartbeat_group_show(struct config_item *item,
  1248. struct configfs_attribute *attr,
  1249. char *page)
  1250. {
  1251. struct o2hb_heartbeat_group *reg = to_o2hb_heartbeat_group(to_config_group(item));
  1252. struct o2hb_heartbeat_group_attribute *o2hb_heartbeat_group_attr =
  1253. container_of(attr, struct o2hb_heartbeat_group_attribute, attr);
  1254. ssize_t ret = 0;
  1255. if (o2hb_heartbeat_group_attr->show)
  1256. ret = o2hb_heartbeat_group_attr->show(reg, page);
  1257. return ret;
  1258. }
  1259. static ssize_t o2hb_heartbeat_group_store(struct config_item *item,
  1260. struct configfs_attribute *attr,
  1261. const char *page, size_t count)
  1262. {
  1263. struct o2hb_heartbeat_group *reg = to_o2hb_heartbeat_group(to_config_group(item));
  1264. struct o2hb_heartbeat_group_attribute *o2hb_heartbeat_group_attr =
  1265. container_of(attr, struct o2hb_heartbeat_group_attribute, attr);
  1266. ssize_t ret = -EINVAL;
  1267. if (o2hb_heartbeat_group_attr->store)
  1268. ret = o2hb_heartbeat_group_attr->store(reg, page, count);
  1269. return ret;
  1270. }
  1271. static ssize_t o2hb_heartbeat_group_threshold_show(struct o2hb_heartbeat_group *group,
  1272. char *page)
  1273. {
  1274. return sprintf(page, "%u\n", o2hb_dead_threshold);
  1275. }
  1276. static ssize_t o2hb_heartbeat_group_threshold_store(struct o2hb_heartbeat_group *group,
  1277. const char *page,
  1278. size_t count)
  1279. {
  1280. unsigned long tmp;
  1281. char *p = (char *)page;
  1282. tmp = simple_strtoul(p, &p, 10);
  1283. if (!p || (*p && (*p != '\n')))
  1284. return -EINVAL;
  1285. /* this will validate ranges for us. */
  1286. o2hb_dead_threshold_set((unsigned int) tmp);
  1287. return count;
  1288. }
  1289. static struct o2hb_heartbeat_group_attribute o2hb_heartbeat_group_attr_threshold = {
  1290. .attr = { .ca_owner = THIS_MODULE,
  1291. .ca_name = "dead_threshold",
  1292. .ca_mode = S_IRUGO | S_IWUSR },
  1293. .show = o2hb_heartbeat_group_threshold_show,
  1294. .store = o2hb_heartbeat_group_threshold_store,
  1295. };
  1296. static struct configfs_attribute *o2hb_heartbeat_group_attrs[] = {
  1297. &o2hb_heartbeat_group_attr_threshold.attr,
  1298. NULL,
  1299. };
  1300. static struct configfs_item_operations o2hb_hearbeat_group_item_ops = {
  1301. .show_attribute = o2hb_heartbeat_group_show,
  1302. .store_attribute = o2hb_heartbeat_group_store,
  1303. };
  1304. static struct configfs_group_operations o2hb_heartbeat_group_group_ops = {
  1305. .make_item = o2hb_heartbeat_group_make_item,
  1306. .drop_item = o2hb_heartbeat_group_drop_item,
  1307. };
  1308. static struct config_item_type o2hb_heartbeat_group_type = {
  1309. .ct_group_ops = &o2hb_heartbeat_group_group_ops,
  1310. .ct_item_ops = &o2hb_hearbeat_group_item_ops,
  1311. .ct_attrs = o2hb_heartbeat_group_attrs,
  1312. .ct_owner = THIS_MODULE,
  1313. };
  1314. /* this is just here to avoid touching group in heartbeat.h which the
  1315. * entire damn world #includes */
  1316. struct config_group *o2hb_alloc_hb_set(void)
  1317. {
  1318. struct o2hb_heartbeat_group *hs = NULL;
  1319. struct config_group *ret = NULL;
  1320. hs = kcalloc(1, sizeof(struct o2hb_heartbeat_group), GFP_KERNEL);
  1321. if (hs == NULL)
  1322. goto out;
  1323. config_group_init_type_name(&hs->hs_group, "heartbeat",
  1324. &o2hb_heartbeat_group_type);
  1325. ret = &hs->hs_group;
  1326. out:
  1327. if (ret == NULL)
  1328. kfree(hs);
  1329. return ret;
  1330. }
  1331. void o2hb_free_hb_set(struct config_group *group)
  1332. {
  1333. struct o2hb_heartbeat_group *hs = to_o2hb_heartbeat_group(group);
  1334. kfree(hs);
  1335. }
  1336. /* hb callback registration and issueing */
  1337. static struct o2hb_callback *hbcall_from_type(enum o2hb_callback_type type)
  1338. {
  1339. if (type == O2HB_NUM_CB)
  1340. return ERR_PTR(-EINVAL);
  1341. return &o2hb_callbacks[type];
  1342. }
  1343. void o2hb_setup_callback(struct o2hb_callback_func *hc,
  1344. enum o2hb_callback_type type,
  1345. o2hb_cb_func *func,
  1346. void *data,
  1347. int priority)
  1348. {
  1349. INIT_LIST_HEAD(&hc->hc_item);
  1350. hc->hc_func = func;
  1351. hc->hc_data = data;
  1352. hc->hc_priority = priority;
  1353. hc->hc_type = type;
  1354. hc->hc_magic = O2HB_CB_MAGIC;
  1355. }
  1356. EXPORT_SYMBOL_GPL(o2hb_setup_callback);
  1357. int o2hb_register_callback(struct o2hb_callback_func *hc)
  1358. {
  1359. struct o2hb_callback_func *tmp;
  1360. struct list_head *iter;
  1361. struct o2hb_callback *hbcall;
  1362. int ret;
  1363. BUG_ON(hc->hc_magic != O2HB_CB_MAGIC);
  1364. BUG_ON(!list_empty(&hc->hc_item));
  1365. hbcall = hbcall_from_type(hc->hc_type);
  1366. if (IS_ERR(hbcall)) {
  1367. ret = PTR_ERR(hbcall);
  1368. goto out;
  1369. }
  1370. down_write(&o2hb_callback_sem);
  1371. list_for_each(iter, &hbcall->list) {
  1372. tmp = list_entry(iter, struct o2hb_callback_func, hc_item);
  1373. if (hc->hc_priority < tmp->hc_priority) {
  1374. list_add_tail(&hc->hc_item, iter);
  1375. break;
  1376. }
  1377. }
  1378. if (list_empty(&hc->hc_item))
  1379. list_add_tail(&hc->hc_item, &hbcall->list);
  1380. up_write(&o2hb_callback_sem);
  1381. ret = 0;
  1382. out:
  1383. mlog(ML_HEARTBEAT, "returning %d on behalf of %p for funcs %p\n",
  1384. ret, __builtin_return_address(0), hc);
  1385. return ret;
  1386. }
  1387. EXPORT_SYMBOL_GPL(o2hb_register_callback);
  1388. int o2hb_unregister_callback(struct o2hb_callback_func *hc)
  1389. {
  1390. BUG_ON(hc->hc_magic != O2HB_CB_MAGIC);
  1391. mlog(ML_HEARTBEAT, "on behalf of %p for funcs %p\n",
  1392. __builtin_return_address(0), hc);
  1393. if (list_empty(&hc->hc_item))
  1394. return 0;
  1395. down_write(&o2hb_callback_sem);
  1396. list_del_init(&hc->hc_item);
  1397. up_write(&o2hb_callback_sem);
  1398. return 0;
  1399. }
  1400. EXPORT_SYMBOL_GPL(o2hb_unregister_callback);
  1401. int o2hb_check_node_heartbeating(u8 node_num)
  1402. {
  1403. unsigned long testing_map[BITS_TO_LONGS(O2NM_MAX_NODES)];
  1404. o2hb_fill_node_map(testing_map, sizeof(testing_map));
  1405. if (!test_bit(node_num, testing_map)) {
  1406. mlog(ML_HEARTBEAT,
  1407. "node (%u) does not have heartbeating enabled.\n",
  1408. node_num);
  1409. return 0;
  1410. }
  1411. return 1;
  1412. }
  1413. EXPORT_SYMBOL_GPL(o2hb_check_node_heartbeating);
  1414. int o2hb_check_node_heartbeating_from_callback(u8 node_num)
  1415. {
  1416. unsigned long testing_map[BITS_TO_LONGS(O2NM_MAX_NODES)];
  1417. o2hb_fill_node_map_from_callback(testing_map, sizeof(testing_map));
  1418. if (!test_bit(node_num, testing_map)) {
  1419. mlog(ML_HEARTBEAT,
  1420. "node (%u) does not have heartbeating enabled.\n",
  1421. node_num);
  1422. return 0;
  1423. }
  1424. return 1;
  1425. }
  1426. EXPORT_SYMBOL_GPL(o2hb_check_node_heartbeating_from_callback);
  1427. /* Makes sure our local node is configured with a node number, and is
  1428. * heartbeating. */
  1429. int o2hb_check_local_node_heartbeating(void)
  1430. {
  1431. u8 node_num;
  1432. /* if this node was set then we have networking */
  1433. node_num = o2nm_this_node();
  1434. if (node_num == O2NM_MAX_NODES) {
  1435. mlog(ML_HEARTBEAT, "this node has not been configured.\n");
  1436. return 0;
  1437. }
  1438. return o2hb_check_node_heartbeating(node_num);
  1439. }
  1440. EXPORT_SYMBOL_GPL(o2hb_check_local_node_heartbeating);
  1441. /*
  1442. * this is just a hack until we get the plumbing which flips file systems
  1443. * read only and drops the hb ref instead of killing the node dead.
  1444. */
  1445. void o2hb_stop_all_regions(void)
  1446. {
  1447. struct o2hb_region *reg;
  1448. mlog(ML_ERROR, "stopping heartbeat on all active regions.\n");
  1449. spin_lock(&o2hb_live_lock);
  1450. list_for_each_entry(reg, &o2hb_all_regions, hr_all_item)
  1451. reg->hr_unclean_stop = 1;
  1452. spin_unlock(&o2hb_live_lock);
  1453. }
  1454. EXPORT_SYMBOL_GPL(o2hb_stop_all_regions);