dlmcommon.h 29 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139
  1. /* -*- mode: c; c-basic-offset: 8; -*-
  2. * vim: noexpandtab sw=8 ts=8 sts=0:
  3. *
  4. * dlmcommon.h
  5. *
  6. * Copyright (C) 2004 Oracle. All rights reserved.
  7. *
  8. * This program is free software; you can redistribute it and/or
  9. * modify it under the terms of the GNU General Public
  10. * License as published by the Free Software Foundation; either
  11. * version 2 of the License, or (at your option) any later version.
  12. *
  13. * This program is distributed in the hope that it will be useful,
  14. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  15. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  16. * General Public License for more details.
  17. *
  18. * You should have received a copy of the GNU General Public
  19. * License along with this program; if not, write to the
  20. * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
  21. * Boston, MA 021110-1307, USA.
  22. *
  23. */
  24. #ifndef DLMCOMMON_H
  25. #define DLMCOMMON_H
  26. #include <linux/kref.h>
  27. #define DLM_HB_NODE_DOWN_PRI (0xf000000)
  28. #define DLM_HB_NODE_UP_PRI (0x8000000)
  29. #define DLM_LOCKID_NAME_MAX 32
  30. #define DLM_DOMAIN_NAME_MAX_LEN 255
  31. #define DLM_LOCK_RES_OWNER_UNKNOWN O2NM_MAX_NODES
  32. #define DLM_THREAD_SHUFFLE_INTERVAL 5 // flush everything every 5 passes
  33. #define DLM_THREAD_MS 200 // flush at least every 200 ms
  34. #define DLM_HASH_SIZE_DEFAULT (1 << 17)
  35. #if DLM_HASH_SIZE_DEFAULT < PAGE_SIZE
  36. # define DLM_HASH_PAGES 1
  37. #else
  38. # define DLM_HASH_PAGES (DLM_HASH_SIZE_DEFAULT / PAGE_SIZE)
  39. #endif
  40. #define DLM_BUCKETS_PER_PAGE (PAGE_SIZE / sizeof(struct hlist_head))
  41. #define DLM_HASH_BUCKETS (DLM_HASH_PAGES * DLM_BUCKETS_PER_PAGE)
  42. /* Intended to make it easier for us to switch out hash functions */
  43. #define dlm_lockid_hash(_n, _l) full_name_hash(_n, _l)
  44. enum dlm_mle_type {
  45. DLM_MLE_BLOCK,
  46. DLM_MLE_MASTER,
  47. DLM_MLE_MIGRATION,
  48. DLM_MLE_NUM_TYPES
  49. };
  50. struct dlm_master_list_entry {
  51. struct hlist_node master_hash_node;
  52. struct list_head hb_events;
  53. struct dlm_ctxt *dlm;
  54. spinlock_t spinlock;
  55. wait_queue_head_t wq;
  56. atomic_t woken;
  57. struct kref mle_refs;
  58. int inuse;
  59. unsigned long maybe_map[BITS_TO_LONGS(O2NM_MAX_NODES)];
  60. unsigned long vote_map[BITS_TO_LONGS(O2NM_MAX_NODES)];
  61. unsigned long response_map[BITS_TO_LONGS(O2NM_MAX_NODES)];
  62. unsigned long node_map[BITS_TO_LONGS(O2NM_MAX_NODES)];
  63. u8 master;
  64. u8 new_master;
  65. enum dlm_mle_type type;
  66. struct o2hb_callback_func mle_hb_up;
  67. struct o2hb_callback_func mle_hb_down;
  68. struct dlm_lock_resource *mleres;
  69. unsigned char mname[DLM_LOCKID_NAME_MAX];
  70. unsigned int mnamelen;
  71. unsigned int mnamehash;
  72. };
  73. enum dlm_ast_type {
  74. DLM_AST = 0,
  75. DLM_BAST,
  76. DLM_ASTUNLOCK
  77. };
  78. #define LKM_VALID_FLAGS (LKM_VALBLK | LKM_CONVERT | LKM_UNLOCK | \
  79. LKM_CANCEL | LKM_INVVALBLK | LKM_FORCE | \
  80. LKM_RECOVERY | LKM_LOCAL | LKM_NOQUEUE)
  81. #define DLM_RECOVERY_LOCK_NAME "$RECOVERY"
  82. #define DLM_RECOVERY_LOCK_NAME_LEN 9
  83. static inline int dlm_is_recovery_lock(const char *lock_name, int name_len)
  84. {
  85. if (name_len == DLM_RECOVERY_LOCK_NAME_LEN &&
  86. memcmp(lock_name, DLM_RECOVERY_LOCK_NAME, name_len)==0)
  87. return 1;
  88. return 0;
  89. }
  90. #define DLM_RECO_STATE_ACTIVE 0x0001
  91. #define DLM_RECO_STATE_FINALIZE 0x0002
  92. struct dlm_recovery_ctxt
  93. {
  94. struct list_head resources;
  95. struct list_head received;
  96. struct list_head node_data;
  97. u8 new_master;
  98. u8 dead_node;
  99. u16 state;
  100. unsigned long node_map[BITS_TO_LONGS(O2NM_MAX_NODES)];
  101. wait_queue_head_t event;
  102. };
  103. enum dlm_ctxt_state {
  104. DLM_CTXT_NEW = 0,
  105. DLM_CTXT_JOINED,
  106. DLM_CTXT_IN_SHUTDOWN,
  107. DLM_CTXT_LEAVING,
  108. };
  109. struct dlm_ctxt
  110. {
  111. struct list_head list;
  112. struct hlist_head **lockres_hash;
  113. struct list_head dirty_list;
  114. struct list_head purge_list;
  115. struct list_head pending_asts;
  116. struct list_head pending_basts;
  117. struct list_head tracking_list;
  118. unsigned int purge_count;
  119. spinlock_t spinlock;
  120. spinlock_t ast_lock;
  121. spinlock_t track_lock;
  122. char *name;
  123. u8 node_num;
  124. u32 key;
  125. u8 joining_node;
  126. wait_queue_head_t dlm_join_events;
  127. unsigned long live_nodes_map[BITS_TO_LONGS(O2NM_MAX_NODES)];
  128. unsigned long domain_map[BITS_TO_LONGS(O2NM_MAX_NODES)];
  129. unsigned long recovery_map[BITS_TO_LONGS(O2NM_MAX_NODES)];
  130. struct dlm_recovery_ctxt reco;
  131. spinlock_t master_lock;
  132. struct hlist_head **master_hash;
  133. struct list_head mle_hb_events;
  134. /* these give a really vague idea of the system load */
  135. atomic_t mle_tot_count[DLM_MLE_NUM_TYPES];
  136. atomic_t mle_cur_count[DLM_MLE_NUM_TYPES];
  137. atomic_t res_tot_count;
  138. atomic_t res_cur_count;
  139. struct dlm_debug_ctxt *dlm_debug_ctxt;
  140. struct dentry *dlm_debugfs_subroot;
  141. /* NOTE: Next three are protected by dlm_domain_lock */
  142. struct kref dlm_refs;
  143. enum dlm_ctxt_state dlm_state;
  144. unsigned int num_joins;
  145. struct o2hb_callback_func dlm_hb_up;
  146. struct o2hb_callback_func dlm_hb_down;
  147. struct task_struct *dlm_thread_task;
  148. struct task_struct *dlm_reco_thread_task;
  149. struct workqueue_struct *dlm_worker;
  150. wait_queue_head_t dlm_thread_wq;
  151. wait_queue_head_t dlm_reco_thread_wq;
  152. wait_queue_head_t ast_wq;
  153. wait_queue_head_t migration_wq;
  154. struct work_struct dispatched_work;
  155. struct list_head work_list;
  156. spinlock_t work_lock;
  157. struct list_head dlm_domain_handlers;
  158. struct list_head dlm_eviction_callbacks;
  159. /* The filesystem specifies this at domain registration. We
  160. * cache it here to know what to tell other nodes. */
  161. struct dlm_protocol_version fs_locking_proto;
  162. /* This is the inter-dlm communication version */
  163. struct dlm_protocol_version dlm_locking_proto;
  164. };
  165. static inline struct hlist_head *dlm_lockres_hash(struct dlm_ctxt *dlm, unsigned i)
  166. {
  167. return dlm->lockres_hash[(i / DLM_BUCKETS_PER_PAGE) % DLM_HASH_PAGES] + (i % DLM_BUCKETS_PER_PAGE);
  168. }
  169. static inline struct hlist_head *dlm_master_hash(struct dlm_ctxt *dlm,
  170. unsigned i)
  171. {
  172. return dlm->master_hash[(i / DLM_BUCKETS_PER_PAGE) % DLM_HASH_PAGES] +
  173. (i % DLM_BUCKETS_PER_PAGE);
  174. }
  175. /* these keventd work queue items are for less-frequently
  176. * called functions that cannot be directly called from the
  177. * net message handlers for some reason, usually because
  178. * they need to send net messages of their own. */
  179. void dlm_dispatch_work(struct work_struct *work);
  180. struct dlm_lock_resource;
  181. struct dlm_work_item;
  182. typedef void (dlm_workfunc_t)(struct dlm_work_item *, void *);
  183. struct dlm_request_all_locks_priv
  184. {
  185. u8 reco_master;
  186. u8 dead_node;
  187. };
  188. struct dlm_mig_lockres_priv
  189. {
  190. struct dlm_lock_resource *lockres;
  191. u8 real_master;
  192. u8 extra_ref;
  193. };
  194. struct dlm_assert_master_priv
  195. {
  196. struct dlm_lock_resource *lockres;
  197. u8 request_from;
  198. u32 flags;
  199. unsigned ignore_higher:1;
  200. };
  201. struct dlm_deref_lockres_priv
  202. {
  203. struct dlm_lock_resource *deref_res;
  204. u8 deref_node;
  205. };
  206. struct dlm_work_item
  207. {
  208. struct list_head list;
  209. dlm_workfunc_t *func;
  210. struct dlm_ctxt *dlm;
  211. void *data;
  212. union {
  213. struct dlm_request_all_locks_priv ral;
  214. struct dlm_mig_lockres_priv ml;
  215. struct dlm_assert_master_priv am;
  216. struct dlm_deref_lockres_priv dl;
  217. } u;
  218. };
  219. static inline void dlm_init_work_item(struct dlm_ctxt *dlm,
  220. struct dlm_work_item *i,
  221. dlm_workfunc_t *f, void *data)
  222. {
  223. memset(i, 0, sizeof(*i));
  224. i->func = f;
  225. INIT_LIST_HEAD(&i->list);
  226. i->data = data;
  227. i->dlm = dlm; /* must have already done a dlm_grab on this! */
  228. }
  229. static inline void __dlm_set_joining_node(struct dlm_ctxt *dlm,
  230. u8 node)
  231. {
  232. assert_spin_locked(&dlm->spinlock);
  233. dlm->joining_node = node;
  234. wake_up(&dlm->dlm_join_events);
  235. }
  236. #define DLM_LOCK_RES_UNINITED 0x00000001
  237. #define DLM_LOCK_RES_RECOVERING 0x00000002
  238. #define DLM_LOCK_RES_READY 0x00000004
  239. #define DLM_LOCK_RES_DIRTY 0x00000008
  240. #define DLM_LOCK_RES_IN_PROGRESS 0x00000010
  241. #define DLM_LOCK_RES_MIGRATING 0x00000020
  242. #define DLM_LOCK_RES_DROPPING_REF 0x00000040
  243. #define DLM_LOCK_RES_BLOCK_DIRTY 0x00001000
  244. #define DLM_LOCK_RES_SETREF_INPROG 0x00002000
  245. /* max milliseconds to wait to sync up a network failure with a node death */
  246. #define DLM_NODE_DEATH_WAIT_MAX (5 * 1000)
  247. #define DLM_PURGE_INTERVAL_MS (8 * 1000)
  248. struct dlm_lock_resource
  249. {
  250. /* WARNING: Please see the comment in dlm_init_lockres before
  251. * adding fields here. */
  252. struct hlist_node hash_node;
  253. struct qstr lockname;
  254. struct kref refs;
  255. /*
  256. * Please keep granted, converting, and blocked in this order,
  257. * as some funcs want to iterate over all lists.
  258. *
  259. * All four lists are protected by the hash's reference.
  260. */
  261. struct list_head granted;
  262. struct list_head converting;
  263. struct list_head blocked;
  264. struct list_head purge;
  265. /*
  266. * These two lists require you to hold an additional reference
  267. * while they are on the list.
  268. */
  269. struct list_head dirty;
  270. struct list_head recovering; // dlm_recovery_ctxt.resources list
  271. /* Added during init and removed during release */
  272. struct list_head tracking; /* dlm->tracking_list */
  273. /* unused lock resources have their last_used stamped and are
  274. * put on a list for the dlm thread to run. */
  275. unsigned long last_used;
  276. struct dlm_ctxt *dlm;
  277. unsigned migration_pending:1;
  278. atomic_t asts_reserved;
  279. spinlock_t spinlock;
  280. wait_queue_head_t wq;
  281. u8 owner; //node which owns the lock resource, or unknown
  282. u16 state;
  283. char lvb[DLM_LVB_LEN];
  284. unsigned int inflight_locks;
  285. unsigned long refmap[BITS_TO_LONGS(O2NM_MAX_NODES)];
  286. };
  287. struct dlm_migratable_lock
  288. {
  289. __be64 cookie;
  290. /* these 3 are just padding for the in-memory structure, but
  291. * list and flags are actually used when sent over the wire */
  292. __be16 pad1;
  293. u8 list; // 0=granted, 1=converting, 2=blocked
  294. u8 flags;
  295. s8 type;
  296. s8 convert_type;
  297. s8 highest_blocked;
  298. u8 node;
  299. }; // 16 bytes
  300. struct dlm_lock
  301. {
  302. struct dlm_migratable_lock ml;
  303. struct list_head list;
  304. struct list_head ast_list;
  305. struct list_head bast_list;
  306. struct dlm_lock_resource *lockres;
  307. spinlock_t spinlock;
  308. struct kref lock_refs;
  309. // ast and bast must be callable while holding a spinlock!
  310. dlm_astlockfunc_t *ast;
  311. dlm_bastlockfunc_t *bast;
  312. void *astdata;
  313. struct dlm_lockstatus *lksb;
  314. unsigned ast_pending:1,
  315. bast_pending:1,
  316. convert_pending:1,
  317. lock_pending:1,
  318. cancel_pending:1,
  319. unlock_pending:1,
  320. lksb_kernel_allocated:1;
  321. };
  322. #define DLM_LKSB_UNUSED1 0x01
  323. #define DLM_LKSB_PUT_LVB 0x02
  324. #define DLM_LKSB_GET_LVB 0x04
  325. #define DLM_LKSB_UNUSED2 0x08
  326. #define DLM_LKSB_UNUSED3 0x10
  327. #define DLM_LKSB_UNUSED4 0x20
  328. #define DLM_LKSB_UNUSED5 0x40
  329. #define DLM_LKSB_UNUSED6 0x80
  330. enum dlm_lockres_list {
  331. DLM_GRANTED_LIST = 0,
  332. DLM_CONVERTING_LIST,
  333. DLM_BLOCKED_LIST
  334. };
  335. static inline int dlm_lvb_is_empty(char *lvb)
  336. {
  337. int i;
  338. for (i=0; i<DLM_LVB_LEN; i++)
  339. if (lvb[i])
  340. return 0;
  341. return 1;
  342. }
  343. static inline struct list_head *
  344. dlm_list_idx_to_ptr(struct dlm_lock_resource *res, enum dlm_lockres_list idx)
  345. {
  346. struct list_head *ret = NULL;
  347. if (idx == DLM_GRANTED_LIST)
  348. ret = &res->granted;
  349. else if (idx == DLM_CONVERTING_LIST)
  350. ret = &res->converting;
  351. else if (idx == DLM_BLOCKED_LIST)
  352. ret = &res->blocked;
  353. else
  354. BUG();
  355. return ret;
  356. }
  357. struct dlm_node_iter
  358. {
  359. unsigned long node_map[BITS_TO_LONGS(O2NM_MAX_NODES)];
  360. int curnode;
  361. };
  362. enum {
  363. DLM_MASTER_REQUEST_MSG = 500,
  364. DLM_UNUSED_MSG1, /* 501 */
  365. DLM_ASSERT_MASTER_MSG, /* 502 */
  366. DLM_CREATE_LOCK_MSG, /* 503 */
  367. DLM_CONVERT_LOCK_MSG, /* 504 */
  368. DLM_PROXY_AST_MSG, /* 505 */
  369. DLM_UNLOCK_LOCK_MSG, /* 506 */
  370. DLM_DEREF_LOCKRES_MSG, /* 507 */
  371. DLM_MIGRATE_REQUEST_MSG, /* 508 */
  372. DLM_MIG_LOCKRES_MSG, /* 509 */
  373. DLM_QUERY_JOIN_MSG, /* 510 */
  374. DLM_ASSERT_JOINED_MSG, /* 511 */
  375. DLM_CANCEL_JOIN_MSG, /* 512 */
  376. DLM_EXIT_DOMAIN_MSG, /* 513 */
  377. DLM_MASTER_REQUERY_MSG, /* 514 */
  378. DLM_LOCK_REQUEST_MSG, /* 515 */
  379. DLM_RECO_DATA_DONE_MSG, /* 516 */
  380. DLM_BEGIN_RECO_MSG, /* 517 */
  381. DLM_FINALIZE_RECO_MSG /* 518 */
  382. };
  383. struct dlm_reco_node_data
  384. {
  385. int state;
  386. u8 node_num;
  387. struct list_head list;
  388. };
  389. enum {
  390. DLM_RECO_NODE_DATA_DEAD = -1,
  391. DLM_RECO_NODE_DATA_INIT = 0,
  392. DLM_RECO_NODE_DATA_REQUESTING,
  393. DLM_RECO_NODE_DATA_REQUESTED,
  394. DLM_RECO_NODE_DATA_RECEIVING,
  395. DLM_RECO_NODE_DATA_DONE,
  396. DLM_RECO_NODE_DATA_FINALIZE_SENT,
  397. };
  398. enum {
  399. DLM_MASTER_RESP_NO = 0,
  400. DLM_MASTER_RESP_YES,
  401. DLM_MASTER_RESP_MAYBE,
  402. DLM_MASTER_RESP_ERROR
  403. };
  404. struct dlm_master_request
  405. {
  406. u8 node_idx;
  407. u8 namelen;
  408. __be16 pad1;
  409. __be32 flags;
  410. u8 name[O2NM_MAX_NAME_LEN];
  411. };
  412. #define DLM_ASSERT_RESPONSE_REASSERT 0x00000001
  413. #define DLM_ASSERT_RESPONSE_MASTERY_REF 0x00000002
  414. #define DLM_ASSERT_MASTER_MLE_CLEANUP 0x00000001
  415. #define DLM_ASSERT_MASTER_REQUERY 0x00000002
  416. #define DLM_ASSERT_MASTER_FINISH_MIGRATION 0x00000004
  417. struct dlm_assert_master
  418. {
  419. u8 node_idx;
  420. u8 namelen;
  421. __be16 pad1;
  422. __be32 flags;
  423. u8 name[O2NM_MAX_NAME_LEN];
  424. };
  425. #define DLM_MIGRATE_RESPONSE_MASTERY_REF 0x00000001
  426. struct dlm_migrate_request
  427. {
  428. u8 master;
  429. u8 new_master;
  430. u8 namelen;
  431. u8 pad1;
  432. __be32 pad2;
  433. u8 name[O2NM_MAX_NAME_LEN];
  434. };
  435. struct dlm_master_requery
  436. {
  437. u8 pad1;
  438. u8 pad2;
  439. u8 node_idx;
  440. u8 namelen;
  441. __be32 pad3;
  442. u8 name[O2NM_MAX_NAME_LEN];
  443. };
  444. #define DLM_MRES_RECOVERY 0x01
  445. #define DLM_MRES_MIGRATION 0x02
  446. #define DLM_MRES_ALL_DONE 0x04
  447. /*
  448. * We would like to get one whole lockres into a single network
  449. * message whenever possible. Generally speaking, there will be
  450. * at most one dlm_lock on a lockres for each node in the cluster,
  451. * plus (infrequently) any additional locks coming in from userdlm.
  452. *
  453. * struct _dlm_lockres_page
  454. * {
  455. * dlm_migratable_lockres mres;
  456. * dlm_migratable_lock ml[DLM_MAX_MIGRATABLE_LOCKS];
  457. * u8 pad[DLM_MIG_LOCKRES_RESERVED];
  458. * };
  459. *
  460. * from ../cluster/tcp.h
  461. * NET_MAX_PAYLOAD_BYTES (4096 - sizeof(net_msg))
  462. * (roughly 4080 bytes)
  463. * and sizeof(dlm_migratable_lockres) = 112 bytes
  464. * and sizeof(dlm_migratable_lock) = 16 bytes
  465. *
  466. * Choosing DLM_MAX_MIGRATABLE_LOCKS=240 and
  467. * DLM_MIG_LOCKRES_RESERVED=128 means we have this:
  468. *
  469. * (DLM_MAX_MIGRATABLE_LOCKS * sizeof(dlm_migratable_lock)) +
  470. * sizeof(dlm_migratable_lockres) + DLM_MIG_LOCKRES_RESERVED =
  471. * NET_MAX_PAYLOAD_BYTES
  472. * (240 * 16) + 112 + 128 = 4080
  473. *
  474. * So a lockres would need more than 240 locks before it would
  475. * use more than one network packet to recover. Not too bad.
  476. */
  477. #define DLM_MAX_MIGRATABLE_LOCKS 240
  478. struct dlm_migratable_lockres
  479. {
  480. u8 master;
  481. u8 lockname_len;
  482. u8 num_locks; // locks sent in this structure
  483. u8 flags;
  484. __be32 total_locks; // locks to be sent for this migration cookie
  485. __be64 mig_cookie; // cookie for this lockres migration
  486. // or zero if not needed
  487. // 16 bytes
  488. u8 lockname[DLM_LOCKID_NAME_MAX];
  489. // 48 bytes
  490. u8 lvb[DLM_LVB_LEN];
  491. // 112 bytes
  492. struct dlm_migratable_lock ml[0]; // 16 bytes each, begins at byte 112
  493. };
  494. #define DLM_MIG_LOCKRES_MAX_LEN \
  495. (sizeof(struct dlm_migratable_lockres) + \
  496. (sizeof(struct dlm_migratable_lock) * \
  497. DLM_MAX_MIGRATABLE_LOCKS) )
  498. /* from above, 128 bytes
  499. * for some undetermined future use */
  500. #define DLM_MIG_LOCKRES_RESERVED (NET_MAX_PAYLOAD_BYTES - \
  501. DLM_MIG_LOCKRES_MAX_LEN)
  502. struct dlm_create_lock
  503. {
  504. __be64 cookie;
  505. __be32 flags;
  506. u8 pad1;
  507. u8 node_idx;
  508. s8 requested_type;
  509. u8 namelen;
  510. u8 name[O2NM_MAX_NAME_LEN];
  511. };
  512. struct dlm_convert_lock
  513. {
  514. __be64 cookie;
  515. __be32 flags;
  516. u8 pad1;
  517. u8 node_idx;
  518. s8 requested_type;
  519. u8 namelen;
  520. u8 name[O2NM_MAX_NAME_LEN];
  521. s8 lvb[0];
  522. };
  523. #define DLM_CONVERT_LOCK_MAX_LEN (sizeof(struct dlm_convert_lock)+DLM_LVB_LEN)
  524. struct dlm_unlock_lock
  525. {
  526. __be64 cookie;
  527. __be32 flags;
  528. __be16 pad1;
  529. u8 node_idx;
  530. u8 namelen;
  531. u8 name[O2NM_MAX_NAME_LEN];
  532. s8 lvb[0];
  533. };
  534. #define DLM_UNLOCK_LOCK_MAX_LEN (sizeof(struct dlm_unlock_lock)+DLM_LVB_LEN)
  535. struct dlm_proxy_ast
  536. {
  537. __be64 cookie;
  538. __be32 flags;
  539. u8 node_idx;
  540. u8 type;
  541. u8 blocked_type;
  542. u8 namelen;
  543. u8 name[O2NM_MAX_NAME_LEN];
  544. s8 lvb[0];
  545. };
  546. #define DLM_PROXY_AST_MAX_LEN (sizeof(struct dlm_proxy_ast)+DLM_LVB_LEN)
  547. #define DLM_MOD_KEY (0x666c6172)
  548. enum dlm_query_join_response_code {
  549. JOIN_DISALLOW = 0,
  550. JOIN_OK,
  551. JOIN_OK_NO_MAP,
  552. JOIN_PROTOCOL_MISMATCH,
  553. };
  554. struct dlm_query_join_packet {
  555. u8 code; /* Response code. dlm_minor and fs_minor
  556. are only valid if this is JOIN_OK */
  557. u8 dlm_minor; /* The minor version of the protocol the
  558. dlm is speaking. */
  559. u8 fs_minor; /* The minor version of the protocol the
  560. filesystem is speaking. */
  561. u8 reserved;
  562. };
  563. union dlm_query_join_response {
  564. u32 intval;
  565. struct dlm_query_join_packet packet;
  566. };
  567. struct dlm_lock_request
  568. {
  569. u8 node_idx;
  570. u8 dead_node;
  571. __be16 pad1;
  572. __be32 pad2;
  573. };
  574. struct dlm_reco_data_done
  575. {
  576. u8 node_idx;
  577. u8 dead_node;
  578. __be16 pad1;
  579. __be32 pad2;
  580. /* unused for now */
  581. /* eventually we can use this to attempt
  582. * lvb recovery based on each node's info */
  583. u8 reco_lvb[DLM_LVB_LEN];
  584. };
  585. struct dlm_begin_reco
  586. {
  587. u8 node_idx;
  588. u8 dead_node;
  589. __be16 pad1;
  590. __be32 pad2;
  591. };
  592. #define BITS_PER_BYTE 8
  593. #define BITS_TO_BYTES(bits) (((bits)+BITS_PER_BYTE-1)/BITS_PER_BYTE)
  594. struct dlm_query_join_request
  595. {
  596. u8 node_idx;
  597. u8 pad1[2];
  598. u8 name_len;
  599. struct dlm_protocol_version dlm_proto;
  600. struct dlm_protocol_version fs_proto;
  601. u8 domain[O2NM_MAX_NAME_LEN];
  602. u8 node_map[BITS_TO_BYTES(O2NM_MAX_NODES)];
  603. };
  604. struct dlm_assert_joined
  605. {
  606. u8 node_idx;
  607. u8 pad1[2];
  608. u8 name_len;
  609. u8 domain[O2NM_MAX_NAME_LEN];
  610. };
  611. struct dlm_cancel_join
  612. {
  613. u8 node_idx;
  614. u8 pad1[2];
  615. u8 name_len;
  616. u8 domain[O2NM_MAX_NAME_LEN];
  617. };
  618. struct dlm_exit_domain
  619. {
  620. u8 node_idx;
  621. u8 pad1[3];
  622. };
  623. struct dlm_finalize_reco
  624. {
  625. u8 node_idx;
  626. u8 dead_node;
  627. u8 flags;
  628. u8 pad1;
  629. __be32 pad2;
  630. };
  631. struct dlm_deref_lockres
  632. {
  633. u32 pad1;
  634. u16 pad2;
  635. u8 node_idx;
  636. u8 namelen;
  637. u8 name[O2NM_MAX_NAME_LEN];
  638. };
  639. static inline enum dlm_status
  640. __dlm_lockres_state_to_status(struct dlm_lock_resource *res)
  641. {
  642. enum dlm_status status = DLM_NORMAL;
  643. assert_spin_locked(&res->spinlock);
  644. if (res->state & DLM_LOCK_RES_RECOVERING)
  645. status = DLM_RECOVERING;
  646. else if (res->state & DLM_LOCK_RES_MIGRATING)
  647. status = DLM_MIGRATING;
  648. else if (res->state & DLM_LOCK_RES_IN_PROGRESS)
  649. status = DLM_FORWARD;
  650. return status;
  651. }
  652. static inline u8 dlm_get_lock_cookie_node(u64 cookie)
  653. {
  654. u8 ret;
  655. cookie >>= 56;
  656. ret = (u8)(cookie & 0xffULL);
  657. return ret;
  658. }
  659. static inline unsigned long long dlm_get_lock_cookie_seq(u64 cookie)
  660. {
  661. unsigned long long ret;
  662. ret = ((unsigned long long)cookie) & 0x00ffffffffffffffULL;
  663. return ret;
  664. }
  665. struct dlm_lock * dlm_new_lock(int type, u8 node, u64 cookie,
  666. struct dlm_lockstatus *lksb);
  667. void dlm_lock_get(struct dlm_lock *lock);
  668. void dlm_lock_put(struct dlm_lock *lock);
  669. void dlm_lock_attach_lockres(struct dlm_lock *lock,
  670. struct dlm_lock_resource *res);
  671. int dlm_create_lock_handler(struct o2net_msg *msg, u32 len, void *data,
  672. void **ret_data);
  673. int dlm_convert_lock_handler(struct o2net_msg *msg, u32 len, void *data,
  674. void **ret_data);
  675. int dlm_proxy_ast_handler(struct o2net_msg *msg, u32 len, void *data,
  676. void **ret_data);
  677. void dlm_revert_pending_convert(struct dlm_lock_resource *res,
  678. struct dlm_lock *lock);
  679. void dlm_revert_pending_lock(struct dlm_lock_resource *res,
  680. struct dlm_lock *lock);
  681. int dlm_unlock_lock_handler(struct o2net_msg *msg, u32 len, void *data,
  682. void **ret_data);
  683. void dlm_commit_pending_cancel(struct dlm_lock_resource *res,
  684. struct dlm_lock *lock);
  685. void dlm_commit_pending_unlock(struct dlm_lock_resource *res,
  686. struct dlm_lock *lock);
  687. int dlm_launch_thread(struct dlm_ctxt *dlm);
  688. void dlm_complete_thread(struct dlm_ctxt *dlm);
  689. int dlm_launch_recovery_thread(struct dlm_ctxt *dlm);
  690. void dlm_complete_recovery_thread(struct dlm_ctxt *dlm);
  691. void dlm_wait_for_recovery(struct dlm_ctxt *dlm);
  692. void dlm_kick_recovery_thread(struct dlm_ctxt *dlm);
  693. int dlm_is_node_dead(struct dlm_ctxt *dlm, u8 node);
  694. int dlm_wait_for_node_death(struct dlm_ctxt *dlm, u8 node, int timeout);
  695. int dlm_wait_for_node_recovery(struct dlm_ctxt *dlm, u8 node, int timeout);
  696. void dlm_put(struct dlm_ctxt *dlm);
  697. struct dlm_ctxt *dlm_grab(struct dlm_ctxt *dlm);
  698. int dlm_domain_fully_joined(struct dlm_ctxt *dlm);
  699. void __dlm_lockres_calc_usage(struct dlm_ctxt *dlm,
  700. struct dlm_lock_resource *res);
  701. void dlm_lockres_calc_usage(struct dlm_ctxt *dlm,
  702. struct dlm_lock_resource *res);
  703. static inline void dlm_lockres_get(struct dlm_lock_resource *res)
  704. {
  705. /* This is called on every lookup, so it might be worth
  706. * inlining. */
  707. kref_get(&res->refs);
  708. }
  709. void dlm_lockres_put(struct dlm_lock_resource *res);
  710. void __dlm_unhash_lockres(struct dlm_lock_resource *res);
  711. void __dlm_insert_lockres(struct dlm_ctxt *dlm,
  712. struct dlm_lock_resource *res);
  713. struct dlm_lock_resource * __dlm_lookup_lockres_full(struct dlm_ctxt *dlm,
  714. const char *name,
  715. unsigned int len,
  716. unsigned int hash);
  717. struct dlm_lock_resource * __dlm_lookup_lockres(struct dlm_ctxt *dlm,
  718. const char *name,
  719. unsigned int len,
  720. unsigned int hash);
  721. struct dlm_lock_resource * dlm_lookup_lockres(struct dlm_ctxt *dlm,
  722. const char *name,
  723. unsigned int len);
  724. int dlm_is_host_down(int errno);
  725. struct dlm_lock_resource * dlm_get_lock_resource(struct dlm_ctxt *dlm,
  726. const char *lockid,
  727. int namelen,
  728. int flags);
  729. struct dlm_lock_resource *dlm_new_lockres(struct dlm_ctxt *dlm,
  730. const char *name,
  731. unsigned int namelen);
  732. #define dlm_lockres_set_refmap_bit(bit,res) \
  733. __dlm_lockres_set_refmap_bit(bit,res,__FILE__,__LINE__)
  734. #define dlm_lockres_clear_refmap_bit(bit,res) \
  735. __dlm_lockres_clear_refmap_bit(bit,res,__FILE__,__LINE__)
  736. static inline void __dlm_lockres_set_refmap_bit(int bit,
  737. struct dlm_lock_resource *res,
  738. const char *file,
  739. int line)
  740. {
  741. //printk("%s:%d:%.*s: setting bit %d\n", file, line,
  742. // res->lockname.len, res->lockname.name, bit);
  743. set_bit(bit, res->refmap);
  744. }
  745. static inline void __dlm_lockres_clear_refmap_bit(int bit,
  746. struct dlm_lock_resource *res,
  747. const char *file,
  748. int line)
  749. {
  750. //printk("%s:%d:%.*s: clearing bit %d\n", file, line,
  751. // res->lockname.len, res->lockname.name, bit);
  752. clear_bit(bit, res->refmap);
  753. }
  754. void __dlm_lockres_drop_inflight_ref(struct dlm_ctxt *dlm,
  755. struct dlm_lock_resource *res,
  756. const char *file,
  757. int line);
  758. void __dlm_lockres_grab_inflight_ref(struct dlm_ctxt *dlm,
  759. struct dlm_lock_resource *res,
  760. int new_lockres,
  761. const char *file,
  762. int line);
  763. #define dlm_lockres_drop_inflight_ref(d,r) \
  764. __dlm_lockres_drop_inflight_ref(d,r,__FILE__,__LINE__)
  765. #define dlm_lockres_grab_inflight_ref(d,r) \
  766. __dlm_lockres_grab_inflight_ref(d,r,0,__FILE__,__LINE__)
  767. #define dlm_lockres_grab_inflight_ref_new(d,r) \
  768. __dlm_lockres_grab_inflight_ref(d,r,1,__FILE__,__LINE__)
  769. void dlm_queue_ast(struct dlm_ctxt *dlm, struct dlm_lock *lock);
  770. void dlm_queue_bast(struct dlm_ctxt *dlm, struct dlm_lock *lock);
  771. void __dlm_queue_ast(struct dlm_ctxt *dlm, struct dlm_lock *lock);
  772. void __dlm_queue_bast(struct dlm_ctxt *dlm, struct dlm_lock *lock);
  773. void dlm_do_local_ast(struct dlm_ctxt *dlm,
  774. struct dlm_lock_resource *res,
  775. struct dlm_lock *lock);
  776. int dlm_do_remote_ast(struct dlm_ctxt *dlm,
  777. struct dlm_lock_resource *res,
  778. struct dlm_lock *lock);
  779. void dlm_do_local_bast(struct dlm_ctxt *dlm,
  780. struct dlm_lock_resource *res,
  781. struct dlm_lock *lock,
  782. int blocked_type);
  783. int dlm_send_proxy_ast_msg(struct dlm_ctxt *dlm,
  784. struct dlm_lock_resource *res,
  785. struct dlm_lock *lock,
  786. int msg_type,
  787. int blocked_type, int flags);
  788. static inline int dlm_send_proxy_bast(struct dlm_ctxt *dlm,
  789. struct dlm_lock_resource *res,
  790. struct dlm_lock *lock,
  791. int blocked_type)
  792. {
  793. return dlm_send_proxy_ast_msg(dlm, res, lock, DLM_BAST,
  794. blocked_type, 0);
  795. }
  796. static inline int dlm_send_proxy_ast(struct dlm_ctxt *dlm,
  797. struct dlm_lock_resource *res,
  798. struct dlm_lock *lock,
  799. int flags)
  800. {
  801. return dlm_send_proxy_ast_msg(dlm, res, lock, DLM_AST,
  802. 0, flags);
  803. }
  804. void dlm_print_one_lock_resource(struct dlm_lock_resource *res);
  805. void __dlm_print_one_lock_resource(struct dlm_lock_resource *res);
  806. u8 dlm_nm_this_node(struct dlm_ctxt *dlm);
  807. void dlm_kick_thread(struct dlm_ctxt *dlm, struct dlm_lock_resource *res);
  808. void __dlm_dirty_lockres(struct dlm_ctxt *dlm, struct dlm_lock_resource *res);
  809. int dlm_nm_init(struct dlm_ctxt *dlm);
  810. int dlm_heartbeat_init(struct dlm_ctxt *dlm);
  811. void dlm_hb_node_down_cb(struct o2nm_node *node, int idx, void *data);
  812. void dlm_hb_node_up_cb(struct o2nm_node *node, int idx, void *data);
  813. int dlm_empty_lockres(struct dlm_ctxt *dlm, struct dlm_lock_resource *res);
  814. int dlm_finish_migration(struct dlm_ctxt *dlm,
  815. struct dlm_lock_resource *res,
  816. u8 old_master);
  817. void dlm_lockres_release_ast(struct dlm_ctxt *dlm,
  818. struct dlm_lock_resource *res);
  819. void __dlm_lockres_reserve_ast(struct dlm_lock_resource *res);
  820. int dlm_master_request_handler(struct o2net_msg *msg, u32 len, void *data,
  821. void **ret_data);
  822. int dlm_assert_master_handler(struct o2net_msg *msg, u32 len, void *data,
  823. void **ret_data);
  824. void dlm_assert_master_post_handler(int status, void *data, void *ret_data);
  825. int dlm_deref_lockres_handler(struct o2net_msg *msg, u32 len, void *data,
  826. void **ret_data);
  827. int dlm_migrate_request_handler(struct o2net_msg *msg, u32 len, void *data,
  828. void **ret_data);
  829. int dlm_mig_lockres_handler(struct o2net_msg *msg, u32 len, void *data,
  830. void **ret_data);
  831. int dlm_master_requery_handler(struct o2net_msg *msg, u32 len, void *data,
  832. void **ret_data);
  833. int dlm_request_all_locks_handler(struct o2net_msg *msg, u32 len, void *data,
  834. void **ret_data);
  835. int dlm_reco_data_done_handler(struct o2net_msg *msg, u32 len, void *data,
  836. void **ret_data);
  837. int dlm_begin_reco_handler(struct o2net_msg *msg, u32 len, void *data,
  838. void **ret_data);
  839. int dlm_finalize_reco_handler(struct o2net_msg *msg, u32 len, void *data,
  840. void **ret_data);
  841. int dlm_do_master_requery(struct dlm_ctxt *dlm, struct dlm_lock_resource *res,
  842. u8 nodenum, u8 *real_master);
  843. int dlm_dispatch_assert_master(struct dlm_ctxt *dlm,
  844. struct dlm_lock_resource *res,
  845. int ignore_higher,
  846. u8 request_from,
  847. u32 flags);
  848. int dlm_send_one_lockres(struct dlm_ctxt *dlm,
  849. struct dlm_lock_resource *res,
  850. struct dlm_migratable_lockres *mres,
  851. u8 send_to,
  852. u8 flags);
  853. void dlm_move_lockres_to_recovery_list(struct dlm_ctxt *dlm,
  854. struct dlm_lock_resource *res);
  855. /* will exit holding res->spinlock, but may drop in function */
  856. void __dlm_wait_on_lockres_flags(struct dlm_lock_resource *res, int flags);
  857. void __dlm_wait_on_lockres_flags_set(struct dlm_lock_resource *res, int flags);
  858. /* will exit holding res->spinlock, but may drop in function */
  859. static inline void __dlm_wait_on_lockres(struct dlm_lock_resource *res)
  860. {
  861. __dlm_wait_on_lockres_flags(res, (DLM_LOCK_RES_IN_PROGRESS|
  862. DLM_LOCK_RES_RECOVERING|
  863. DLM_LOCK_RES_MIGRATING));
  864. }
  865. void __dlm_unlink_mle(struct dlm_ctxt *dlm, struct dlm_master_list_entry *mle);
  866. void __dlm_insert_mle(struct dlm_ctxt *dlm, struct dlm_master_list_entry *mle);
  867. /* create/destroy slab caches */
  868. int dlm_init_master_caches(void);
  869. void dlm_destroy_master_caches(void);
  870. int dlm_init_lock_cache(void);
  871. void dlm_destroy_lock_cache(void);
  872. int dlm_init_mle_cache(void);
  873. void dlm_destroy_mle_cache(void);
  874. void dlm_hb_event_notify_attached(struct dlm_ctxt *dlm, int idx, int node_up);
  875. int dlm_drop_lockres_ref(struct dlm_ctxt *dlm,
  876. struct dlm_lock_resource *res);
  877. void dlm_clean_master_list(struct dlm_ctxt *dlm,
  878. u8 dead_node);
  879. int dlm_lock_basts_flushed(struct dlm_ctxt *dlm, struct dlm_lock *lock);
  880. int __dlm_lockres_has_locks(struct dlm_lock_resource *res);
  881. int __dlm_lockres_unused(struct dlm_lock_resource *res);
  882. static inline const char * dlm_lock_mode_name(int mode)
  883. {
  884. switch (mode) {
  885. case LKM_EXMODE:
  886. return "EX";
  887. case LKM_PRMODE:
  888. return "PR";
  889. case LKM_NLMODE:
  890. return "NL";
  891. }
  892. return "UNKNOWN";
  893. }
  894. static inline int dlm_lock_compatible(int existing, int request)
  895. {
  896. /* NO_LOCK compatible with all */
  897. if (request == LKM_NLMODE ||
  898. existing == LKM_NLMODE)
  899. return 1;
  900. /* EX incompatible with all non-NO_LOCK */
  901. if (request == LKM_EXMODE)
  902. return 0;
  903. /* request must be PR, which is compatible with PR */
  904. if (existing == LKM_PRMODE)
  905. return 1;
  906. return 0;
  907. }
  908. static inline int dlm_lock_on_list(struct list_head *head,
  909. struct dlm_lock *lock)
  910. {
  911. struct list_head *iter;
  912. struct dlm_lock *tmplock;
  913. list_for_each(iter, head) {
  914. tmplock = list_entry(iter, struct dlm_lock, list);
  915. if (tmplock == lock)
  916. return 1;
  917. }
  918. return 0;
  919. }
  920. static inline enum dlm_status dlm_err_to_dlm_status(int err)
  921. {
  922. enum dlm_status ret;
  923. if (err == -ENOMEM)
  924. ret = DLM_SYSERR;
  925. else if (err == -ETIMEDOUT || o2net_link_down(err, NULL))
  926. ret = DLM_NOLOCKMGR;
  927. else if (err == -EINVAL)
  928. ret = DLM_BADPARAM;
  929. else if (err == -ENAMETOOLONG)
  930. ret = DLM_IVBUFLEN;
  931. else
  932. ret = DLM_BADARGS;
  933. return ret;
  934. }
  935. static inline void dlm_node_iter_init(unsigned long *map,
  936. struct dlm_node_iter *iter)
  937. {
  938. memcpy(iter->node_map, map, sizeof(iter->node_map));
  939. iter->curnode = -1;
  940. }
  941. static inline int dlm_node_iter_next(struct dlm_node_iter *iter)
  942. {
  943. int bit;
  944. bit = find_next_bit(iter->node_map, O2NM_MAX_NODES, iter->curnode+1);
  945. if (bit >= O2NM_MAX_NODES) {
  946. iter->curnode = O2NM_MAX_NODES;
  947. return -ENOENT;
  948. }
  949. iter->curnode = bit;
  950. return bit;
  951. }
  952. static inline void dlm_set_lockres_owner(struct dlm_ctxt *dlm,
  953. struct dlm_lock_resource *res,
  954. u8 owner)
  955. {
  956. assert_spin_locked(&res->spinlock);
  957. res->owner = owner;
  958. }
  959. static inline void dlm_change_lockres_owner(struct dlm_ctxt *dlm,
  960. struct dlm_lock_resource *res,
  961. u8 owner)
  962. {
  963. assert_spin_locked(&res->spinlock);
  964. if (owner != res->owner)
  965. dlm_set_lockres_owner(dlm, res, owner);
  966. }
  967. #endif /* DLMCOMMON_H */