heartbeat.c 46 KB

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