dlmdomain.c 60 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387
  1. /* -*- mode: c; c-basic-offset: 8; -*-
  2. * vim: noexpandtab sw=8 ts=8 sts=0:
  3. *
  4. * dlmdomain.c
  5. *
  6. * defines domain join / leave apis
  7. *
  8. * Copyright (C) 2004 Oracle. All rights reserved.
  9. *
  10. * This program is free software; you can redistribute it and/or
  11. * modify it under the terms of the GNU General Public
  12. * License as published by the Free Software Foundation; either
  13. * version 2 of the License, or (at your option) any later version.
  14. *
  15. * This program is distributed in the hope that it will be useful,
  16. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  17. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  18. * General Public License for more details.
  19. *
  20. * You should have received a copy of the GNU General Public
  21. * License along with this program; if not, write to the
  22. * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
  23. * Boston, MA 021110-1307, USA.
  24. *
  25. */
  26. #include <linux/module.h>
  27. #include <linux/types.h>
  28. #include <linux/slab.h>
  29. #include <linux/highmem.h>
  30. #include <linux/init.h>
  31. #include <linux/spinlock.h>
  32. #include <linux/delay.h>
  33. #include <linux/err.h>
  34. #include <linux/debugfs.h>
  35. #include "cluster/heartbeat.h"
  36. #include "cluster/nodemanager.h"
  37. #include "cluster/tcp.h"
  38. #include "dlmapi.h"
  39. #include "dlmcommon.h"
  40. #include "dlmdomain.h"
  41. #include "dlmdebug.h"
  42. #define MLOG_MASK_PREFIX (ML_DLM|ML_DLM_DOMAIN)
  43. #include "cluster/masklog.h"
  44. /*
  45. * ocfs2 node maps are array of long int, which limits to send them freely
  46. * across the wire due to endianness issues. To workaround this, we convert
  47. * long ints to byte arrays. Following 3 routines are helper functions to
  48. * set/test/copy bits within those array of bytes
  49. */
  50. static inline void byte_set_bit(u8 nr, u8 map[])
  51. {
  52. map[nr >> 3] |= (1UL << (nr & 7));
  53. }
  54. static inline int byte_test_bit(u8 nr, u8 map[])
  55. {
  56. return ((1UL << (nr & 7)) & (map[nr >> 3])) != 0;
  57. }
  58. static inline void byte_copymap(u8 dmap[], unsigned long smap[],
  59. unsigned int sz)
  60. {
  61. unsigned int nn;
  62. if (!sz)
  63. return;
  64. memset(dmap, 0, ((sz + 7) >> 3));
  65. for (nn = 0 ; nn < sz; nn++)
  66. if (test_bit(nn, smap))
  67. byte_set_bit(nn, dmap);
  68. }
  69. static void dlm_free_pagevec(void **vec, int pages)
  70. {
  71. while (pages--)
  72. free_page((unsigned long)vec[pages]);
  73. kfree(vec);
  74. }
  75. static void **dlm_alloc_pagevec(int pages)
  76. {
  77. void **vec = kmalloc(pages * sizeof(void *), GFP_KERNEL);
  78. int i;
  79. if (!vec)
  80. return NULL;
  81. for (i = 0; i < pages; i++)
  82. if (!(vec[i] = (void *)__get_free_page(GFP_KERNEL)))
  83. goto out_free;
  84. mlog(0, "Allocated DLM hash pagevec; %d pages (%lu expected), %lu buckets per page\n",
  85. pages, (unsigned long)DLM_HASH_PAGES,
  86. (unsigned long)DLM_BUCKETS_PER_PAGE);
  87. return vec;
  88. out_free:
  89. dlm_free_pagevec(vec, i);
  90. return NULL;
  91. }
  92. /*
  93. *
  94. * spinlock lock ordering: if multiple locks are needed, obey this ordering:
  95. * dlm_domain_lock
  96. * struct dlm_ctxt->spinlock
  97. * struct dlm_lock_resource->spinlock
  98. * struct dlm_ctxt->master_lock
  99. * struct dlm_ctxt->ast_lock
  100. * dlm_master_list_entry->spinlock
  101. * dlm_lock->spinlock
  102. *
  103. */
  104. DEFINE_SPINLOCK(dlm_domain_lock);
  105. LIST_HEAD(dlm_domains);
  106. static DECLARE_WAIT_QUEUE_HEAD(dlm_domain_events);
  107. /*
  108. * The supported protocol version for DLM communication. Running domains
  109. * will have a negotiated version with the same major number and a minor
  110. * number equal or smaller. The dlm_ctxt->dlm_locking_proto field should
  111. * be used to determine what a running domain is actually using.
  112. *
  113. * New in version 1.1:
  114. * - Message DLM_QUERY_REGION added to support global heartbeat
  115. * - Message DLM_QUERY_NODEINFO added to allow online node removes
  116. * New in version 1.2:
  117. * - Message DLM_BEGIN_EXIT_DOMAIN_MSG added to mark start of exit domain
  118. */
  119. static const struct dlm_protocol_version dlm_protocol = {
  120. .pv_major = 1,
  121. .pv_minor = 2,
  122. };
  123. #define DLM_DOMAIN_BACKOFF_MS 200
  124. static int dlm_query_join_handler(struct o2net_msg *msg, u32 len, void *data,
  125. void **ret_data);
  126. static int dlm_assert_joined_handler(struct o2net_msg *msg, u32 len, void *data,
  127. void **ret_data);
  128. static int dlm_cancel_join_handler(struct o2net_msg *msg, u32 len, void *data,
  129. void **ret_data);
  130. static int dlm_query_region_handler(struct o2net_msg *msg, u32 len,
  131. void *data, void **ret_data);
  132. static int dlm_exit_domain_handler(struct o2net_msg *msg, u32 len, void *data,
  133. void **ret_data);
  134. static int dlm_protocol_compare(struct dlm_protocol_version *existing,
  135. struct dlm_protocol_version *request);
  136. static void dlm_unregister_domain_handlers(struct dlm_ctxt *dlm);
  137. void __dlm_unhash_lockres(struct dlm_ctxt *dlm, struct dlm_lock_resource *res)
  138. {
  139. if (hlist_unhashed(&res->hash_node))
  140. return;
  141. mlog(0, "%s: Unhash res %.*s\n", dlm->name, res->lockname.len,
  142. res->lockname.name);
  143. hlist_del_init(&res->hash_node);
  144. dlm_lockres_put(res);
  145. }
  146. void __dlm_insert_lockres(struct dlm_ctxt *dlm, struct dlm_lock_resource *res)
  147. {
  148. struct hlist_head *bucket;
  149. struct qstr *q;
  150. assert_spin_locked(&dlm->spinlock);
  151. q = &res->lockname;
  152. bucket = dlm_lockres_hash(dlm, q->hash);
  153. /* get a reference for our hashtable */
  154. dlm_lockres_get(res);
  155. hlist_add_head(&res->hash_node, bucket);
  156. mlog(0, "%s: Hash res %.*s\n", dlm->name, res->lockname.len,
  157. res->lockname.name);
  158. }
  159. struct dlm_lock_resource * __dlm_lookup_lockres_full(struct dlm_ctxt *dlm,
  160. const char *name,
  161. unsigned int len,
  162. unsigned int hash)
  163. {
  164. struct hlist_head *bucket;
  165. struct dlm_lock_resource *res;
  166. mlog(0, "%.*s\n", len, name);
  167. assert_spin_locked(&dlm->spinlock);
  168. bucket = dlm_lockres_hash(dlm, hash);
  169. hlist_for_each_entry(res, bucket, hash_node) {
  170. if (res->lockname.name[0] != name[0])
  171. continue;
  172. if (unlikely(res->lockname.len != len))
  173. continue;
  174. if (memcmp(res->lockname.name + 1, name + 1, len - 1))
  175. continue;
  176. dlm_lockres_get(res);
  177. return res;
  178. }
  179. return NULL;
  180. }
  181. /* intended to be called by functions which do not care about lock
  182. * resources which are being purged (most net _handler functions).
  183. * this will return NULL for any lock resource which is found but
  184. * currently in the process of dropping its mastery reference.
  185. * use __dlm_lookup_lockres_full when you need the lock resource
  186. * regardless (e.g. dlm_get_lock_resource) */
  187. struct dlm_lock_resource * __dlm_lookup_lockres(struct dlm_ctxt *dlm,
  188. const char *name,
  189. unsigned int len,
  190. unsigned int hash)
  191. {
  192. struct dlm_lock_resource *res = NULL;
  193. mlog(0, "%.*s\n", len, name);
  194. assert_spin_locked(&dlm->spinlock);
  195. res = __dlm_lookup_lockres_full(dlm, name, len, hash);
  196. if (res) {
  197. spin_lock(&res->spinlock);
  198. if (res->state & DLM_LOCK_RES_DROPPING_REF) {
  199. spin_unlock(&res->spinlock);
  200. dlm_lockres_put(res);
  201. return NULL;
  202. }
  203. spin_unlock(&res->spinlock);
  204. }
  205. return res;
  206. }
  207. struct dlm_lock_resource * dlm_lookup_lockres(struct dlm_ctxt *dlm,
  208. const char *name,
  209. unsigned int len)
  210. {
  211. struct dlm_lock_resource *res;
  212. unsigned int hash = dlm_lockid_hash(name, len);
  213. spin_lock(&dlm->spinlock);
  214. res = __dlm_lookup_lockres(dlm, name, len, hash);
  215. spin_unlock(&dlm->spinlock);
  216. return res;
  217. }
  218. static struct dlm_ctxt * __dlm_lookup_domain_full(const char *domain, int len)
  219. {
  220. struct dlm_ctxt *tmp;
  221. assert_spin_locked(&dlm_domain_lock);
  222. /* tmp->name here is always NULL terminated,
  223. * but domain may not be! */
  224. list_for_each_entry(tmp, &dlm_domains, list) {
  225. if (strlen(tmp->name) == len &&
  226. memcmp(tmp->name, domain, len)==0)
  227. return tmp;
  228. }
  229. return NULL;
  230. }
  231. /* For null terminated domain strings ONLY */
  232. static struct dlm_ctxt * __dlm_lookup_domain(const char *domain)
  233. {
  234. assert_spin_locked(&dlm_domain_lock);
  235. return __dlm_lookup_domain_full(domain, strlen(domain));
  236. }
  237. /* returns true on one of two conditions:
  238. * 1) the domain does not exist
  239. * 2) the domain exists and it's state is "joined" */
  240. static int dlm_wait_on_domain_helper(const char *domain)
  241. {
  242. int ret = 0;
  243. struct dlm_ctxt *tmp = NULL;
  244. spin_lock(&dlm_domain_lock);
  245. tmp = __dlm_lookup_domain(domain);
  246. if (!tmp)
  247. ret = 1;
  248. else if (tmp->dlm_state == DLM_CTXT_JOINED)
  249. ret = 1;
  250. spin_unlock(&dlm_domain_lock);
  251. return ret;
  252. }
  253. static void dlm_free_ctxt_mem(struct dlm_ctxt *dlm)
  254. {
  255. dlm_destroy_debugfs_subroot(dlm);
  256. if (dlm->lockres_hash)
  257. dlm_free_pagevec((void **)dlm->lockres_hash, DLM_HASH_PAGES);
  258. if (dlm->master_hash)
  259. dlm_free_pagevec((void **)dlm->master_hash, DLM_HASH_PAGES);
  260. kfree(dlm->name);
  261. kfree(dlm);
  262. }
  263. /* A little strange - this function will be called while holding
  264. * dlm_domain_lock and is expected to be holding it on the way out. We
  265. * will however drop and reacquire it multiple times */
  266. static void dlm_ctxt_release(struct kref *kref)
  267. {
  268. struct dlm_ctxt *dlm;
  269. dlm = container_of(kref, struct dlm_ctxt, dlm_refs);
  270. BUG_ON(dlm->num_joins);
  271. BUG_ON(dlm->dlm_state == DLM_CTXT_JOINED);
  272. /* we may still be in the list if we hit an error during join. */
  273. list_del_init(&dlm->list);
  274. spin_unlock(&dlm_domain_lock);
  275. mlog(0, "freeing memory from domain %s\n", dlm->name);
  276. wake_up(&dlm_domain_events);
  277. dlm_free_ctxt_mem(dlm);
  278. spin_lock(&dlm_domain_lock);
  279. }
  280. void dlm_put(struct dlm_ctxt *dlm)
  281. {
  282. spin_lock(&dlm_domain_lock);
  283. kref_put(&dlm->dlm_refs, dlm_ctxt_release);
  284. spin_unlock(&dlm_domain_lock);
  285. }
  286. static void __dlm_get(struct dlm_ctxt *dlm)
  287. {
  288. kref_get(&dlm->dlm_refs);
  289. }
  290. /* given a questionable reference to a dlm object, gets a reference if
  291. * it can find it in the list, otherwise returns NULL in which case
  292. * you shouldn't trust your pointer. */
  293. struct dlm_ctxt *dlm_grab(struct dlm_ctxt *dlm)
  294. {
  295. struct dlm_ctxt *target;
  296. struct dlm_ctxt *ret = NULL;
  297. spin_lock(&dlm_domain_lock);
  298. list_for_each_entry(target, &dlm_domains, list) {
  299. if (target == dlm) {
  300. __dlm_get(target);
  301. ret = target;
  302. break;
  303. }
  304. }
  305. spin_unlock(&dlm_domain_lock);
  306. return ret;
  307. }
  308. int dlm_domain_fully_joined(struct dlm_ctxt *dlm)
  309. {
  310. int ret;
  311. spin_lock(&dlm_domain_lock);
  312. ret = (dlm->dlm_state == DLM_CTXT_JOINED) ||
  313. (dlm->dlm_state == DLM_CTXT_IN_SHUTDOWN);
  314. spin_unlock(&dlm_domain_lock);
  315. return ret;
  316. }
  317. static void dlm_destroy_dlm_worker(struct dlm_ctxt *dlm)
  318. {
  319. if (dlm->dlm_worker) {
  320. flush_workqueue(dlm->dlm_worker);
  321. destroy_workqueue(dlm->dlm_worker);
  322. dlm->dlm_worker = NULL;
  323. }
  324. }
  325. static void dlm_complete_dlm_shutdown(struct dlm_ctxt *dlm)
  326. {
  327. dlm_unregister_domain_handlers(dlm);
  328. dlm_debug_shutdown(dlm);
  329. dlm_complete_thread(dlm);
  330. dlm_complete_recovery_thread(dlm);
  331. dlm_destroy_dlm_worker(dlm);
  332. /* We've left the domain. Now we can take ourselves out of the
  333. * list and allow the kref stuff to help us free the
  334. * memory. */
  335. spin_lock(&dlm_domain_lock);
  336. list_del_init(&dlm->list);
  337. spin_unlock(&dlm_domain_lock);
  338. /* Wake up anyone waiting for us to remove this domain */
  339. wake_up(&dlm_domain_events);
  340. }
  341. static int dlm_migrate_all_locks(struct dlm_ctxt *dlm)
  342. {
  343. int i, num, n, ret = 0;
  344. struct dlm_lock_resource *res;
  345. struct hlist_node *iter;
  346. struct hlist_head *bucket;
  347. int dropped;
  348. mlog(0, "Migrating locks from domain %s\n", dlm->name);
  349. num = 0;
  350. spin_lock(&dlm->spinlock);
  351. for (i = 0; i < DLM_HASH_BUCKETS; i++) {
  352. redo_bucket:
  353. n = 0;
  354. bucket = dlm_lockres_hash(dlm, i);
  355. iter = bucket->first;
  356. while (iter) {
  357. n++;
  358. res = hlist_entry(iter, struct dlm_lock_resource,
  359. hash_node);
  360. dlm_lockres_get(res);
  361. /* migrate, if necessary. this will drop the dlm
  362. * spinlock and retake it if it does migration. */
  363. dropped = dlm_empty_lockres(dlm, res);
  364. spin_lock(&res->spinlock);
  365. if (dropped)
  366. __dlm_lockres_calc_usage(dlm, res);
  367. else
  368. iter = res->hash_node.next;
  369. spin_unlock(&res->spinlock);
  370. dlm_lockres_put(res);
  371. if (dropped) {
  372. cond_resched_lock(&dlm->spinlock);
  373. goto redo_bucket;
  374. }
  375. }
  376. cond_resched_lock(&dlm->spinlock);
  377. num += n;
  378. }
  379. spin_unlock(&dlm->spinlock);
  380. wake_up(&dlm->dlm_thread_wq);
  381. /* let the dlm thread take care of purging, keep scanning until
  382. * nothing remains in the hash */
  383. if (num) {
  384. mlog(0, "%s: %d lock resources in hash last pass\n",
  385. dlm->name, num);
  386. ret = -EAGAIN;
  387. }
  388. mlog(0, "DONE Migrating locks from domain %s\n", dlm->name);
  389. return ret;
  390. }
  391. static int dlm_no_joining_node(struct dlm_ctxt *dlm)
  392. {
  393. int ret;
  394. spin_lock(&dlm->spinlock);
  395. ret = dlm->joining_node == DLM_LOCK_RES_OWNER_UNKNOWN;
  396. spin_unlock(&dlm->spinlock);
  397. return ret;
  398. }
  399. static int dlm_begin_exit_domain_handler(struct o2net_msg *msg, u32 len,
  400. void *data, void **ret_data)
  401. {
  402. struct dlm_ctxt *dlm = data;
  403. unsigned int node;
  404. struct dlm_exit_domain *exit_msg = (struct dlm_exit_domain *) msg->buf;
  405. if (!dlm_grab(dlm))
  406. return 0;
  407. node = exit_msg->node_idx;
  408. mlog(0, "%s: Node %u sent a begin exit domain message\n", dlm->name, node);
  409. spin_lock(&dlm->spinlock);
  410. set_bit(node, dlm->exit_domain_map);
  411. spin_unlock(&dlm->spinlock);
  412. dlm_put(dlm);
  413. return 0;
  414. }
  415. static void dlm_mark_domain_leaving(struct dlm_ctxt *dlm)
  416. {
  417. /* Yikes, a double spinlock! I need domain_lock for the dlm
  418. * state and the dlm spinlock for join state... Sorry! */
  419. again:
  420. spin_lock(&dlm_domain_lock);
  421. spin_lock(&dlm->spinlock);
  422. if (dlm->joining_node != DLM_LOCK_RES_OWNER_UNKNOWN) {
  423. mlog(0, "Node %d is joining, we wait on it.\n",
  424. dlm->joining_node);
  425. spin_unlock(&dlm->spinlock);
  426. spin_unlock(&dlm_domain_lock);
  427. wait_event(dlm->dlm_join_events, dlm_no_joining_node(dlm));
  428. goto again;
  429. }
  430. dlm->dlm_state = DLM_CTXT_LEAVING;
  431. spin_unlock(&dlm->spinlock);
  432. spin_unlock(&dlm_domain_lock);
  433. }
  434. static void __dlm_print_nodes(struct dlm_ctxt *dlm)
  435. {
  436. int node = -1, num = 0;
  437. assert_spin_locked(&dlm->spinlock);
  438. printk("( ");
  439. while ((node = find_next_bit(dlm->domain_map, O2NM_MAX_NODES,
  440. node + 1)) < O2NM_MAX_NODES) {
  441. printk("%d ", node);
  442. ++num;
  443. }
  444. printk(") %u nodes\n", num);
  445. }
  446. static int dlm_exit_domain_handler(struct o2net_msg *msg, u32 len, void *data,
  447. void **ret_data)
  448. {
  449. struct dlm_ctxt *dlm = data;
  450. unsigned int node;
  451. struct dlm_exit_domain *exit_msg = (struct dlm_exit_domain *) msg->buf;
  452. mlog(0, "%p %u %p", msg, len, data);
  453. if (!dlm_grab(dlm))
  454. return 0;
  455. node = exit_msg->node_idx;
  456. spin_lock(&dlm->spinlock);
  457. clear_bit(node, dlm->domain_map);
  458. clear_bit(node, dlm->exit_domain_map);
  459. printk(KERN_NOTICE "o2dlm: Node %u leaves domain %s ", node, dlm->name);
  460. __dlm_print_nodes(dlm);
  461. /* notify anything attached to the heartbeat events */
  462. dlm_hb_event_notify_attached(dlm, node, 0);
  463. spin_unlock(&dlm->spinlock);
  464. dlm_put(dlm);
  465. return 0;
  466. }
  467. static int dlm_send_one_domain_exit(struct dlm_ctxt *dlm, u32 msg_type,
  468. unsigned int node)
  469. {
  470. int status;
  471. struct dlm_exit_domain leave_msg;
  472. mlog(0, "%s: Sending domain exit message %u to node %u\n", dlm->name,
  473. msg_type, node);
  474. memset(&leave_msg, 0, sizeof(leave_msg));
  475. leave_msg.node_idx = dlm->node_num;
  476. status = o2net_send_message(msg_type, dlm->key, &leave_msg,
  477. sizeof(leave_msg), node, NULL);
  478. if (status < 0)
  479. mlog(ML_ERROR, "Error %d sending domain exit message %u "
  480. "to node %u on domain %s\n", status, msg_type, node,
  481. dlm->name);
  482. return status;
  483. }
  484. static void dlm_begin_exit_domain(struct dlm_ctxt *dlm)
  485. {
  486. int node = -1;
  487. /* Support for begin exit domain was added in 1.2 */
  488. if (dlm->dlm_locking_proto.pv_major == 1 &&
  489. dlm->dlm_locking_proto.pv_minor < 2)
  490. return;
  491. /*
  492. * Unlike DLM_EXIT_DOMAIN_MSG, DLM_BEGIN_EXIT_DOMAIN_MSG is purely
  493. * informational. Meaning if a node does not receive the message,
  494. * so be it.
  495. */
  496. spin_lock(&dlm->spinlock);
  497. while (1) {
  498. node = find_next_bit(dlm->domain_map, O2NM_MAX_NODES, node + 1);
  499. if (node >= O2NM_MAX_NODES)
  500. break;
  501. if (node == dlm->node_num)
  502. continue;
  503. spin_unlock(&dlm->spinlock);
  504. dlm_send_one_domain_exit(dlm, DLM_BEGIN_EXIT_DOMAIN_MSG, node);
  505. spin_lock(&dlm->spinlock);
  506. }
  507. spin_unlock(&dlm->spinlock);
  508. }
  509. static void dlm_leave_domain(struct dlm_ctxt *dlm)
  510. {
  511. int node, clear_node, status;
  512. /* At this point we've migrated away all our locks and won't
  513. * accept mastership of new ones. The dlm is responsible for
  514. * almost nothing now. We make sure not to confuse any joining
  515. * nodes and then commence shutdown procedure. */
  516. spin_lock(&dlm->spinlock);
  517. /* Clear ourselves from the domain map */
  518. clear_bit(dlm->node_num, dlm->domain_map);
  519. while ((node = find_next_bit(dlm->domain_map, O2NM_MAX_NODES,
  520. 0)) < O2NM_MAX_NODES) {
  521. /* Drop the dlm spinlock. This is safe wrt the domain_map.
  522. * -nodes cannot be added now as the
  523. * query_join_handlers knows to respond with OK_NO_MAP
  524. * -we catch the right network errors if a node is
  525. * removed from the map while we're sending him the
  526. * exit message. */
  527. spin_unlock(&dlm->spinlock);
  528. clear_node = 1;
  529. status = dlm_send_one_domain_exit(dlm, DLM_EXIT_DOMAIN_MSG,
  530. node);
  531. if (status < 0 &&
  532. status != -ENOPROTOOPT &&
  533. status != -ENOTCONN) {
  534. mlog(ML_NOTICE, "Error %d sending domain exit message "
  535. "to node %d\n", status, node);
  536. /* Not sure what to do here but lets sleep for
  537. * a bit in case this was a transient
  538. * error... */
  539. msleep(DLM_DOMAIN_BACKOFF_MS);
  540. clear_node = 0;
  541. }
  542. spin_lock(&dlm->spinlock);
  543. /* If we're not clearing the node bit then we intend
  544. * to loop back around to try again. */
  545. if (clear_node)
  546. clear_bit(node, dlm->domain_map);
  547. }
  548. spin_unlock(&dlm->spinlock);
  549. }
  550. int dlm_joined(struct dlm_ctxt *dlm)
  551. {
  552. int ret = 0;
  553. spin_lock(&dlm_domain_lock);
  554. if (dlm->dlm_state == DLM_CTXT_JOINED)
  555. ret = 1;
  556. spin_unlock(&dlm_domain_lock);
  557. return ret;
  558. }
  559. int dlm_shutting_down(struct dlm_ctxt *dlm)
  560. {
  561. int ret = 0;
  562. spin_lock(&dlm_domain_lock);
  563. if (dlm->dlm_state == DLM_CTXT_IN_SHUTDOWN)
  564. ret = 1;
  565. spin_unlock(&dlm_domain_lock);
  566. return ret;
  567. }
  568. void dlm_unregister_domain(struct dlm_ctxt *dlm)
  569. {
  570. int leave = 0;
  571. struct dlm_lock_resource *res;
  572. spin_lock(&dlm_domain_lock);
  573. BUG_ON(dlm->dlm_state != DLM_CTXT_JOINED);
  574. BUG_ON(!dlm->num_joins);
  575. dlm->num_joins--;
  576. if (!dlm->num_joins) {
  577. /* We mark it "in shutdown" now so new register
  578. * requests wait until we've completely left the
  579. * domain. Don't use DLM_CTXT_LEAVING yet as we still
  580. * want new domain joins to communicate with us at
  581. * least until we've completed migration of our
  582. * resources. */
  583. dlm->dlm_state = DLM_CTXT_IN_SHUTDOWN;
  584. leave = 1;
  585. }
  586. spin_unlock(&dlm_domain_lock);
  587. if (leave) {
  588. mlog(0, "shutting down domain %s\n", dlm->name);
  589. dlm_begin_exit_domain(dlm);
  590. /* We changed dlm state, notify the thread */
  591. dlm_kick_thread(dlm, NULL);
  592. while (dlm_migrate_all_locks(dlm)) {
  593. /* Give dlm_thread time to purge the lockres' */
  594. msleep(500);
  595. mlog(0, "%s: more migration to do\n", dlm->name);
  596. }
  597. /* This list should be empty. If not, print remaining lockres */
  598. if (!list_empty(&dlm->tracking_list)) {
  599. mlog(ML_ERROR, "Following lockres' are still on the "
  600. "tracking list:\n");
  601. list_for_each_entry(res, &dlm->tracking_list, tracking)
  602. dlm_print_one_lock_resource(res);
  603. }
  604. dlm_mark_domain_leaving(dlm);
  605. dlm_leave_domain(dlm);
  606. printk(KERN_NOTICE "o2dlm: Leaving domain %s\n", dlm->name);
  607. dlm_force_free_mles(dlm);
  608. dlm_complete_dlm_shutdown(dlm);
  609. }
  610. dlm_put(dlm);
  611. }
  612. EXPORT_SYMBOL_GPL(dlm_unregister_domain);
  613. static int dlm_query_join_proto_check(char *proto_type, int node,
  614. struct dlm_protocol_version *ours,
  615. struct dlm_protocol_version *request)
  616. {
  617. int rc;
  618. struct dlm_protocol_version proto = *request;
  619. if (!dlm_protocol_compare(ours, &proto)) {
  620. mlog(0,
  621. "node %u wanted to join with %s locking protocol "
  622. "%u.%u, we respond with %u.%u\n",
  623. node, proto_type,
  624. request->pv_major,
  625. request->pv_minor,
  626. proto.pv_major, proto.pv_minor);
  627. request->pv_minor = proto.pv_minor;
  628. rc = 0;
  629. } else {
  630. mlog(ML_NOTICE,
  631. "Node %u wanted to join with %s locking "
  632. "protocol %u.%u, but we have %u.%u, disallowing\n",
  633. node, proto_type,
  634. request->pv_major,
  635. request->pv_minor,
  636. ours->pv_major,
  637. ours->pv_minor);
  638. rc = 1;
  639. }
  640. return rc;
  641. }
  642. /*
  643. * struct dlm_query_join_packet is made up of four one-byte fields. They
  644. * are effectively in big-endian order already. However, little-endian
  645. * machines swap them before putting the packet on the wire (because
  646. * query_join's response is a status, and that status is treated as a u32
  647. * on the wire). Thus, a big-endian and little-endian machines will treat
  648. * this structure differently.
  649. *
  650. * The solution is to have little-endian machines swap the structure when
  651. * converting from the structure to the u32 representation. This will
  652. * result in the structure having the correct format on the wire no matter
  653. * the host endian format.
  654. */
  655. static void dlm_query_join_packet_to_wire(struct dlm_query_join_packet *packet,
  656. u32 *wire)
  657. {
  658. union dlm_query_join_response response;
  659. response.packet = *packet;
  660. *wire = be32_to_cpu(response.intval);
  661. }
  662. static void dlm_query_join_wire_to_packet(u32 wire,
  663. struct dlm_query_join_packet *packet)
  664. {
  665. union dlm_query_join_response response;
  666. response.intval = cpu_to_be32(wire);
  667. *packet = response.packet;
  668. }
  669. static int dlm_query_join_handler(struct o2net_msg *msg, u32 len, void *data,
  670. void **ret_data)
  671. {
  672. struct dlm_query_join_request *query;
  673. struct dlm_query_join_packet packet = {
  674. .code = JOIN_DISALLOW,
  675. };
  676. struct dlm_ctxt *dlm = NULL;
  677. u32 response;
  678. u8 nodenum;
  679. query = (struct dlm_query_join_request *) msg->buf;
  680. mlog(0, "node %u wants to join domain %s\n", query->node_idx,
  681. query->domain);
  682. /*
  683. * If heartbeat doesn't consider the node live, tell it
  684. * to back off and try again. This gives heartbeat a chance
  685. * to catch up.
  686. */
  687. if (!o2hb_check_node_heartbeating(query->node_idx)) {
  688. mlog(0, "node %u is not in our live map yet\n",
  689. query->node_idx);
  690. packet.code = JOIN_DISALLOW;
  691. goto respond;
  692. }
  693. packet.code = JOIN_OK_NO_MAP;
  694. spin_lock(&dlm_domain_lock);
  695. dlm = __dlm_lookup_domain_full(query->domain, query->name_len);
  696. if (!dlm)
  697. goto unlock_respond;
  698. /*
  699. * There is a small window where the joining node may not see the
  700. * node(s) that just left but still part of the cluster. DISALLOW
  701. * join request if joining node has different node map.
  702. */
  703. nodenum=0;
  704. while (nodenum < O2NM_MAX_NODES) {
  705. if (test_bit(nodenum, dlm->domain_map)) {
  706. if (!byte_test_bit(nodenum, query->node_map)) {
  707. mlog(0, "disallow join as node %u does not "
  708. "have node %u in its nodemap\n",
  709. query->node_idx, nodenum);
  710. packet.code = JOIN_DISALLOW;
  711. goto unlock_respond;
  712. }
  713. }
  714. nodenum++;
  715. }
  716. /* Once the dlm ctxt is marked as leaving then we don't want
  717. * to be put in someone's domain map.
  718. * Also, explicitly disallow joining at certain troublesome
  719. * times (ie. during recovery). */
  720. if (dlm && dlm->dlm_state != DLM_CTXT_LEAVING) {
  721. int bit = query->node_idx;
  722. spin_lock(&dlm->spinlock);
  723. if (dlm->dlm_state == DLM_CTXT_NEW &&
  724. dlm->joining_node == DLM_LOCK_RES_OWNER_UNKNOWN) {
  725. /*If this is a brand new context and we
  726. * haven't started our join process yet, then
  727. * the other node won the race. */
  728. packet.code = JOIN_OK_NO_MAP;
  729. } else if (dlm->joining_node != DLM_LOCK_RES_OWNER_UNKNOWN) {
  730. /* Disallow parallel joins. */
  731. packet.code = JOIN_DISALLOW;
  732. } else if (dlm->reco.state & DLM_RECO_STATE_ACTIVE) {
  733. mlog(0, "node %u trying to join, but recovery "
  734. "is ongoing.\n", bit);
  735. packet.code = JOIN_DISALLOW;
  736. } else if (test_bit(bit, dlm->recovery_map)) {
  737. mlog(0, "node %u trying to join, but it "
  738. "still needs recovery.\n", bit);
  739. packet.code = JOIN_DISALLOW;
  740. } else if (test_bit(bit, dlm->domain_map)) {
  741. mlog(0, "node %u trying to join, but it "
  742. "is still in the domain! needs recovery?\n",
  743. bit);
  744. packet.code = JOIN_DISALLOW;
  745. } else {
  746. /* Alright we're fully a part of this domain
  747. * so we keep some state as to who's joining
  748. * and indicate to him that needs to be fixed
  749. * up. */
  750. /* Make sure we speak compatible locking protocols. */
  751. if (dlm_query_join_proto_check("DLM", bit,
  752. &dlm->dlm_locking_proto,
  753. &query->dlm_proto)) {
  754. packet.code = JOIN_PROTOCOL_MISMATCH;
  755. } else if (dlm_query_join_proto_check("fs", bit,
  756. &dlm->fs_locking_proto,
  757. &query->fs_proto)) {
  758. packet.code = JOIN_PROTOCOL_MISMATCH;
  759. } else {
  760. packet.dlm_minor = query->dlm_proto.pv_minor;
  761. packet.fs_minor = query->fs_proto.pv_minor;
  762. packet.code = JOIN_OK;
  763. __dlm_set_joining_node(dlm, query->node_idx);
  764. }
  765. }
  766. spin_unlock(&dlm->spinlock);
  767. }
  768. unlock_respond:
  769. spin_unlock(&dlm_domain_lock);
  770. respond:
  771. mlog(0, "We respond with %u\n", packet.code);
  772. dlm_query_join_packet_to_wire(&packet, &response);
  773. return response;
  774. }
  775. static int dlm_assert_joined_handler(struct o2net_msg *msg, u32 len, void *data,
  776. void **ret_data)
  777. {
  778. struct dlm_assert_joined *assert;
  779. struct dlm_ctxt *dlm = NULL;
  780. assert = (struct dlm_assert_joined *) msg->buf;
  781. mlog(0, "node %u asserts join on domain %s\n", assert->node_idx,
  782. assert->domain);
  783. spin_lock(&dlm_domain_lock);
  784. dlm = __dlm_lookup_domain_full(assert->domain, assert->name_len);
  785. /* XXX should we consider no dlm ctxt an error? */
  786. if (dlm) {
  787. spin_lock(&dlm->spinlock);
  788. /* Alright, this node has officially joined our
  789. * domain. Set him in the map and clean up our
  790. * leftover join state. */
  791. BUG_ON(dlm->joining_node != assert->node_idx);
  792. if (dlm->reco.state & DLM_RECO_STATE_ACTIVE) {
  793. mlog(0, "dlm recovery is ongoing, disallow join\n");
  794. spin_unlock(&dlm->spinlock);
  795. spin_unlock(&dlm_domain_lock);
  796. return -EAGAIN;
  797. }
  798. set_bit(assert->node_idx, dlm->domain_map);
  799. clear_bit(assert->node_idx, dlm->exit_domain_map);
  800. __dlm_set_joining_node(dlm, DLM_LOCK_RES_OWNER_UNKNOWN);
  801. printk(KERN_NOTICE "o2dlm: Node %u joins domain %s ",
  802. assert->node_idx, dlm->name);
  803. __dlm_print_nodes(dlm);
  804. /* notify anything attached to the heartbeat events */
  805. dlm_hb_event_notify_attached(dlm, assert->node_idx, 1);
  806. spin_unlock(&dlm->spinlock);
  807. }
  808. spin_unlock(&dlm_domain_lock);
  809. return 0;
  810. }
  811. static int dlm_match_regions(struct dlm_ctxt *dlm,
  812. struct dlm_query_region *qr,
  813. char *local, int locallen)
  814. {
  815. char *remote = qr->qr_regions;
  816. char *l, *r;
  817. int localnr, i, j, foundit;
  818. int status = 0;
  819. if (!o2hb_global_heartbeat_active()) {
  820. if (qr->qr_numregions) {
  821. mlog(ML_ERROR, "Domain %s: Joining node %d has global "
  822. "heartbeat enabled but local node %d does not\n",
  823. qr->qr_domain, qr->qr_node, dlm->node_num);
  824. status = -EINVAL;
  825. }
  826. goto bail;
  827. }
  828. if (o2hb_global_heartbeat_active() && !qr->qr_numregions) {
  829. mlog(ML_ERROR, "Domain %s: Local node %d has global "
  830. "heartbeat enabled but joining node %d does not\n",
  831. qr->qr_domain, dlm->node_num, qr->qr_node);
  832. status = -EINVAL;
  833. goto bail;
  834. }
  835. r = remote;
  836. for (i = 0; i < qr->qr_numregions; ++i) {
  837. mlog(0, "Region %.*s\n", O2HB_MAX_REGION_NAME_LEN, r);
  838. r += O2HB_MAX_REGION_NAME_LEN;
  839. }
  840. localnr = min(O2NM_MAX_REGIONS, locallen/O2HB_MAX_REGION_NAME_LEN);
  841. localnr = o2hb_get_all_regions(local, (u8)localnr);
  842. /* compare local regions with remote */
  843. l = local;
  844. for (i = 0; i < localnr; ++i) {
  845. foundit = 0;
  846. r = remote;
  847. for (j = 0; j <= qr->qr_numregions; ++j) {
  848. if (!memcmp(l, r, O2HB_MAX_REGION_NAME_LEN)) {
  849. foundit = 1;
  850. break;
  851. }
  852. r += O2HB_MAX_REGION_NAME_LEN;
  853. }
  854. if (!foundit) {
  855. status = -EINVAL;
  856. mlog(ML_ERROR, "Domain %s: Region '%.*s' registered "
  857. "in local node %d but not in joining node %d\n",
  858. qr->qr_domain, O2HB_MAX_REGION_NAME_LEN, l,
  859. dlm->node_num, qr->qr_node);
  860. goto bail;
  861. }
  862. l += O2HB_MAX_REGION_NAME_LEN;
  863. }
  864. /* compare remote with local regions */
  865. r = remote;
  866. for (i = 0; i < qr->qr_numregions; ++i) {
  867. foundit = 0;
  868. l = local;
  869. for (j = 0; j < localnr; ++j) {
  870. if (!memcmp(r, l, O2HB_MAX_REGION_NAME_LEN)) {
  871. foundit = 1;
  872. break;
  873. }
  874. l += O2HB_MAX_REGION_NAME_LEN;
  875. }
  876. if (!foundit) {
  877. status = -EINVAL;
  878. mlog(ML_ERROR, "Domain %s: Region '%.*s' registered "
  879. "in joining node %d but not in local node %d\n",
  880. qr->qr_domain, O2HB_MAX_REGION_NAME_LEN, r,
  881. qr->qr_node, dlm->node_num);
  882. goto bail;
  883. }
  884. r += O2HB_MAX_REGION_NAME_LEN;
  885. }
  886. bail:
  887. return status;
  888. }
  889. static int dlm_send_regions(struct dlm_ctxt *dlm, unsigned long *node_map)
  890. {
  891. struct dlm_query_region *qr = NULL;
  892. int status, ret = 0, i;
  893. char *p;
  894. if (find_next_bit(node_map, O2NM_MAX_NODES, 0) >= O2NM_MAX_NODES)
  895. goto bail;
  896. qr = kzalloc(sizeof(struct dlm_query_region), GFP_KERNEL);
  897. if (!qr) {
  898. ret = -ENOMEM;
  899. mlog_errno(ret);
  900. goto bail;
  901. }
  902. qr->qr_node = dlm->node_num;
  903. qr->qr_namelen = strlen(dlm->name);
  904. memcpy(qr->qr_domain, dlm->name, qr->qr_namelen);
  905. /* if local hb, the numregions will be zero */
  906. if (o2hb_global_heartbeat_active())
  907. qr->qr_numregions = o2hb_get_all_regions(qr->qr_regions,
  908. O2NM_MAX_REGIONS);
  909. p = qr->qr_regions;
  910. for (i = 0; i < qr->qr_numregions; ++i, p += O2HB_MAX_REGION_NAME_LEN)
  911. mlog(0, "Region %.*s\n", O2HB_MAX_REGION_NAME_LEN, p);
  912. i = -1;
  913. while ((i = find_next_bit(node_map, O2NM_MAX_NODES,
  914. i + 1)) < O2NM_MAX_NODES) {
  915. if (i == dlm->node_num)
  916. continue;
  917. mlog(0, "Sending regions to node %d\n", i);
  918. ret = o2net_send_message(DLM_QUERY_REGION, DLM_MOD_KEY, qr,
  919. sizeof(struct dlm_query_region),
  920. i, &status);
  921. if (ret >= 0)
  922. ret = status;
  923. if (ret) {
  924. mlog(ML_ERROR, "Region mismatch %d, node %d\n",
  925. ret, i);
  926. break;
  927. }
  928. }
  929. bail:
  930. kfree(qr);
  931. return ret;
  932. }
  933. static int dlm_query_region_handler(struct o2net_msg *msg, u32 len,
  934. void *data, void **ret_data)
  935. {
  936. struct dlm_query_region *qr;
  937. struct dlm_ctxt *dlm = NULL;
  938. char *local = NULL;
  939. int status = 0;
  940. qr = (struct dlm_query_region *) msg->buf;
  941. mlog(0, "Node %u queries hb regions on domain %s\n", qr->qr_node,
  942. qr->qr_domain);
  943. /* buffer used in dlm_mast_regions() */
  944. local = kmalloc(sizeof(qr->qr_regions), GFP_KERNEL);
  945. if (!local)
  946. return -ENOMEM;
  947. status = -EINVAL;
  948. spin_lock(&dlm_domain_lock);
  949. dlm = __dlm_lookup_domain_full(qr->qr_domain, qr->qr_namelen);
  950. if (!dlm) {
  951. mlog(ML_ERROR, "Node %d queried hb regions on domain %s "
  952. "before join domain\n", qr->qr_node, qr->qr_domain);
  953. goto out_domain_lock;
  954. }
  955. spin_lock(&dlm->spinlock);
  956. if (dlm->joining_node != qr->qr_node) {
  957. mlog(ML_ERROR, "Node %d queried hb regions on domain %s "
  958. "but joining node is %d\n", qr->qr_node, qr->qr_domain,
  959. dlm->joining_node);
  960. goto out_dlm_lock;
  961. }
  962. /* Support for global heartbeat was added in 1.1 */
  963. if (dlm->dlm_locking_proto.pv_major == 1 &&
  964. dlm->dlm_locking_proto.pv_minor == 0) {
  965. mlog(ML_ERROR, "Node %d queried hb regions on domain %s "
  966. "but active dlm protocol is %d.%d\n", qr->qr_node,
  967. qr->qr_domain, dlm->dlm_locking_proto.pv_major,
  968. dlm->dlm_locking_proto.pv_minor);
  969. goto out_dlm_lock;
  970. }
  971. status = dlm_match_regions(dlm, qr, local, sizeof(qr->qr_regions));
  972. out_dlm_lock:
  973. spin_unlock(&dlm->spinlock);
  974. out_domain_lock:
  975. spin_unlock(&dlm_domain_lock);
  976. kfree(local);
  977. return status;
  978. }
  979. static int dlm_match_nodes(struct dlm_ctxt *dlm, struct dlm_query_nodeinfo *qn)
  980. {
  981. struct o2nm_node *local;
  982. struct dlm_node_info *remote;
  983. int i, j;
  984. int status = 0;
  985. for (j = 0; j < qn->qn_numnodes; ++j)
  986. mlog(0, "Node %3d, %pI4:%u\n", qn->qn_nodes[j].ni_nodenum,
  987. &(qn->qn_nodes[j].ni_ipv4_address),
  988. ntohs(qn->qn_nodes[j].ni_ipv4_port));
  989. for (i = 0; i < O2NM_MAX_NODES && !status; ++i) {
  990. local = o2nm_get_node_by_num(i);
  991. remote = NULL;
  992. for (j = 0; j < qn->qn_numnodes; ++j) {
  993. if (qn->qn_nodes[j].ni_nodenum == i) {
  994. remote = &(qn->qn_nodes[j]);
  995. break;
  996. }
  997. }
  998. if (!local && !remote)
  999. continue;
  1000. if ((local && !remote) || (!local && remote))
  1001. status = -EINVAL;
  1002. if (!status &&
  1003. ((remote->ni_nodenum != local->nd_num) ||
  1004. (remote->ni_ipv4_port != local->nd_ipv4_port) ||
  1005. (remote->ni_ipv4_address != local->nd_ipv4_address)))
  1006. status = -EINVAL;
  1007. if (status) {
  1008. if (remote && !local)
  1009. mlog(ML_ERROR, "Domain %s: Node %d (%pI4:%u) "
  1010. "registered in joining node %d but not in "
  1011. "local node %d\n", qn->qn_domain,
  1012. remote->ni_nodenum,
  1013. &(remote->ni_ipv4_address),
  1014. ntohs(remote->ni_ipv4_port),
  1015. qn->qn_nodenum, dlm->node_num);
  1016. if (local && !remote)
  1017. mlog(ML_ERROR, "Domain %s: Node %d (%pI4:%u) "
  1018. "registered in local node %d but not in "
  1019. "joining node %d\n", qn->qn_domain,
  1020. local->nd_num, &(local->nd_ipv4_address),
  1021. ntohs(local->nd_ipv4_port),
  1022. dlm->node_num, qn->qn_nodenum);
  1023. BUG_ON((!local && !remote));
  1024. }
  1025. if (local)
  1026. o2nm_node_put(local);
  1027. }
  1028. return status;
  1029. }
  1030. static int dlm_send_nodeinfo(struct dlm_ctxt *dlm, unsigned long *node_map)
  1031. {
  1032. struct dlm_query_nodeinfo *qn = NULL;
  1033. struct o2nm_node *node;
  1034. int ret = 0, status, count, i;
  1035. if (find_next_bit(node_map, O2NM_MAX_NODES, 0) >= O2NM_MAX_NODES)
  1036. goto bail;
  1037. qn = kzalloc(sizeof(struct dlm_query_nodeinfo), GFP_KERNEL);
  1038. if (!qn) {
  1039. ret = -ENOMEM;
  1040. mlog_errno(ret);
  1041. goto bail;
  1042. }
  1043. for (i = 0, count = 0; i < O2NM_MAX_NODES; ++i) {
  1044. node = o2nm_get_node_by_num(i);
  1045. if (!node)
  1046. continue;
  1047. qn->qn_nodes[count].ni_nodenum = node->nd_num;
  1048. qn->qn_nodes[count].ni_ipv4_port = node->nd_ipv4_port;
  1049. qn->qn_nodes[count].ni_ipv4_address = node->nd_ipv4_address;
  1050. mlog(0, "Node %3d, %pI4:%u\n", node->nd_num,
  1051. &(node->nd_ipv4_address), ntohs(node->nd_ipv4_port));
  1052. ++count;
  1053. o2nm_node_put(node);
  1054. }
  1055. qn->qn_nodenum = dlm->node_num;
  1056. qn->qn_numnodes = count;
  1057. qn->qn_namelen = strlen(dlm->name);
  1058. memcpy(qn->qn_domain, dlm->name, qn->qn_namelen);
  1059. i = -1;
  1060. while ((i = find_next_bit(node_map, O2NM_MAX_NODES,
  1061. i + 1)) < O2NM_MAX_NODES) {
  1062. if (i == dlm->node_num)
  1063. continue;
  1064. mlog(0, "Sending nodeinfo to node %d\n", i);
  1065. ret = o2net_send_message(DLM_QUERY_NODEINFO, DLM_MOD_KEY,
  1066. qn, sizeof(struct dlm_query_nodeinfo),
  1067. i, &status);
  1068. if (ret >= 0)
  1069. ret = status;
  1070. if (ret) {
  1071. mlog(ML_ERROR, "node mismatch %d, node %d\n", ret, i);
  1072. break;
  1073. }
  1074. }
  1075. bail:
  1076. kfree(qn);
  1077. return ret;
  1078. }
  1079. static int dlm_query_nodeinfo_handler(struct o2net_msg *msg, u32 len,
  1080. void *data, void **ret_data)
  1081. {
  1082. struct dlm_query_nodeinfo *qn;
  1083. struct dlm_ctxt *dlm = NULL;
  1084. int locked = 0, status = -EINVAL;
  1085. qn = (struct dlm_query_nodeinfo *) msg->buf;
  1086. mlog(0, "Node %u queries nodes on domain %s\n", qn->qn_nodenum,
  1087. qn->qn_domain);
  1088. spin_lock(&dlm_domain_lock);
  1089. dlm = __dlm_lookup_domain_full(qn->qn_domain, qn->qn_namelen);
  1090. if (!dlm) {
  1091. mlog(ML_ERROR, "Node %d queried nodes on domain %s before "
  1092. "join domain\n", qn->qn_nodenum, qn->qn_domain);
  1093. goto bail;
  1094. }
  1095. spin_lock(&dlm->spinlock);
  1096. locked = 1;
  1097. if (dlm->joining_node != qn->qn_nodenum) {
  1098. mlog(ML_ERROR, "Node %d queried nodes on domain %s but "
  1099. "joining node is %d\n", qn->qn_nodenum, qn->qn_domain,
  1100. dlm->joining_node);
  1101. goto bail;
  1102. }
  1103. /* Support for node query was added in 1.1 */
  1104. if (dlm->dlm_locking_proto.pv_major == 1 &&
  1105. dlm->dlm_locking_proto.pv_minor == 0) {
  1106. mlog(ML_ERROR, "Node %d queried nodes on domain %s "
  1107. "but active dlm protocol is %d.%d\n", qn->qn_nodenum,
  1108. qn->qn_domain, dlm->dlm_locking_proto.pv_major,
  1109. dlm->dlm_locking_proto.pv_minor);
  1110. goto bail;
  1111. }
  1112. status = dlm_match_nodes(dlm, qn);
  1113. bail:
  1114. if (locked)
  1115. spin_unlock(&dlm->spinlock);
  1116. spin_unlock(&dlm_domain_lock);
  1117. return status;
  1118. }
  1119. static int dlm_cancel_join_handler(struct o2net_msg *msg, u32 len, void *data,
  1120. void **ret_data)
  1121. {
  1122. struct dlm_cancel_join *cancel;
  1123. struct dlm_ctxt *dlm = NULL;
  1124. cancel = (struct dlm_cancel_join *) msg->buf;
  1125. mlog(0, "node %u cancels join on domain %s\n", cancel->node_idx,
  1126. cancel->domain);
  1127. spin_lock(&dlm_domain_lock);
  1128. dlm = __dlm_lookup_domain_full(cancel->domain, cancel->name_len);
  1129. if (dlm) {
  1130. spin_lock(&dlm->spinlock);
  1131. /* Yikes, this guy wants to cancel his join. No
  1132. * problem, we simply cleanup our join state. */
  1133. BUG_ON(dlm->joining_node != cancel->node_idx);
  1134. __dlm_set_joining_node(dlm, DLM_LOCK_RES_OWNER_UNKNOWN);
  1135. spin_unlock(&dlm->spinlock);
  1136. }
  1137. spin_unlock(&dlm_domain_lock);
  1138. return 0;
  1139. }
  1140. static int dlm_send_one_join_cancel(struct dlm_ctxt *dlm,
  1141. unsigned int node)
  1142. {
  1143. int status;
  1144. struct dlm_cancel_join cancel_msg;
  1145. memset(&cancel_msg, 0, sizeof(cancel_msg));
  1146. cancel_msg.node_idx = dlm->node_num;
  1147. cancel_msg.name_len = strlen(dlm->name);
  1148. memcpy(cancel_msg.domain, dlm->name, cancel_msg.name_len);
  1149. status = o2net_send_message(DLM_CANCEL_JOIN_MSG, DLM_MOD_KEY,
  1150. &cancel_msg, sizeof(cancel_msg), node,
  1151. NULL);
  1152. if (status < 0) {
  1153. mlog(ML_ERROR, "Error %d when sending message %u (key 0x%x) to "
  1154. "node %u\n", status, DLM_CANCEL_JOIN_MSG, DLM_MOD_KEY,
  1155. node);
  1156. goto bail;
  1157. }
  1158. bail:
  1159. return status;
  1160. }
  1161. /* map_size should be in bytes. */
  1162. static int dlm_send_join_cancels(struct dlm_ctxt *dlm,
  1163. unsigned long *node_map,
  1164. unsigned int map_size)
  1165. {
  1166. int status, tmpstat;
  1167. unsigned int node;
  1168. if (map_size != (BITS_TO_LONGS(O2NM_MAX_NODES) *
  1169. sizeof(unsigned long))) {
  1170. mlog(ML_ERROR,
  1171. "map_size %u != BITS_TO_LONGS(O2NM_MAX_NODES) %u\n",
  1172. map_size, (unsigned)BITS_TO_LONGS(O2NM_MAX_NODES));
  1173. return -EINVAL;
  1174. }
  1175. status = 0;
  1176. node = -1;
  1177. while ((node = find_next_bit(node_map, O2NM_MAX_NODES,
  1178. node + 1)) < O2NM_MAX_NODES) {
  1179. if (node == dlm->node_num)
  1180. continue;
  1181. tmpstat = dlm_send_one_join_cancel(dlm, node);
  1182. if (tmpstat) {
  1183. mlog(ML_ERROR, "Error return %d cancelling join on "
  1184. "node %d\n", tmpstat, node);
  1185. if (!status)
  1186. status = tmpstat;
  1187. }
  1188. }
  1189. if (status)
  1190. mlog_errno(status);
  1191. return status;
  1192. }
  1193. static int dlm_request_join(struct dlm_ctxt *dlm,
  1194. int node,
  1195. enum dlm_query_join_response_code *response)
  1196. {
  1197. int status;
  1198. struct dlm_query_join_request join_msg;
  1199. struct dlm_query_join_packet packet;
  1200. u32 join_resp;
  1201. mlog(0, "querying node %d\n", node);
  1202. memset(&join_msg, 0, sizeof(join_msg));
  1203. join_msg.node_idx = dlm->node_num;
  1204. join_msg.name_len = strlen(dlm->name);
  1205. memcpy(join_msg.domain, dlm->name, join_msg.name_len);
  1206. join_msg.dlm_proto = dlm->dlm_locking_proto;
  1207. join_msg.fs_proto = dlm->fs_locking_proto;
  1208. /* copy live node map to join message */
  1209. byte_copymap(join_msg.node_map, dlm->live_nodes_map, O2NM_MAX_NODES);
  1210. status = o2net_send_message(DLM_QUERY_JOIN_MSG, DLM_MOD_KEY, &join_msg,
  1211. sizeof(join_msg), node, &join_resp);
  1212. if (status < 0 && status != -ENOPROTOOPT) {
  1213. mlog(ML_ERROR, "Error %d when sending message %u (key 0x%x) to "
  1214. "node %u\n", status, DLM_QUERY_JOIN_MSG, DLM_MOD_KEY,
  1215. node);
  1216. goto bail;
  1217. }
  1218. dlm_query_join_wire_to_packet(join_resp, &packet);
  1219. /* -ENOPROTOOPT from the net code means the other side isn't
  1220. listening for our message type -- that's fine, it means
  1221. his dlm isn't up, so we can consider him a 'yes' but not
  1222. joined into the domain. */
  1223. if (status == -ENOPROTOOPT) {
  1224. status = 0;
  1225. *response = JOIN_OK_NO_MAP;
  1226. } else if (packet.code == JOIN_DISALLOW ||
  1227. packet.code == JOIN_OK_NO_MAP) {
  1228. *response = packet.code;
  1229. } else if (packet.code == JOIN_PROTOCOL_MISMATCH) {
  1230. mlog(ML_NOTICE,
  1231. "This node requested DLM locking protocol %u.%u and "
  1232. "filesystem locking protocol %u.%u. At least one of "
  1233. "the protocol versions on node %d is not compatible, "
  1234. "disconnecting\n",
  1235. dlm->dlm_locking_proto.pv_major,
  1236. dlm->dlm_locking_proto.pv_minor,
  1237. dlm->fs_locking_proto.pv_major,
  1238. dlm->fs_locking_proto.pv_minor,
  1239. node);
  1240. status = -EPROTO;
  1241. *response = packet.code;
  1242. } else if (packet.code == JOIN_OK) {
  1243. *response = packet.code;
  1244. /* Use the same locking protocol as the remote node */
  1245. dlm->dlm_locking_proto.pv_minor = packet.dlm_minor;
  1246. dlm->fs_locking_proto.pv_minor = packet.fs_minor;
  1247. mlog(0,
  1248. "Node %d responds JOIN_OK with DLM locking protocol "
  1249. "%u.%u and fs locking protocol %u.%u\n",
  1250. node,
  1251. dlm->dlm_locking_proto.pv_major,
  1252. dlm->dlm_locking_proto.pv_minor,
  1253. dlm->fs_locking_proto.pv_major,
  1254. dlm->fs_locking_proto.pv_minor);
  1255. } else {
  1256. status = -EINVAL;
  1257. mlog(ML_ERROR, "invalid response %d from node %u\n",
  1258. packet.code, node);
  1259. }
  1260. mlog(0, "status %d, node %d response is %d\n", status, node,
  1261. *response);
  1262. bail:
  1263. return status;
  1264. }
  1265. static int dlm_send_one_join_assert(struct dlm_ctxt *dlm,
  1266. unsigned int node)
  1267. {
  1268. int status;
  1269. int ret;
  1270. struct dlm_assert_joined assert_msg;
  1271. mlog(0, "Sending join assert to node %u\n", node);
  1272. memset(&assert_msg, 0, sizeof(assert_msg));
  1273. assert_msg.node_idx = dlm->node_num;
  1274. assert_msg.name_len = strlen(dlm->name);
  1275. memcpy(assert_msg.domain, dlm->name, assert_msg.name_len);
  1276. status = o2net_send_message(DLM_ASSERT_JOINED_MSG, DLM_MOD_KEY,
  1277. &assert_msg, sizeof(assert_msg), node,
  1278. &ret);
  1279. if (status < 0)
  1280. mlog(ML_ERROR, "Error %d when sending message %u (key 0x%x) to "
  1281. "node %u\n", status, DLM_ASSERT_JOINED_MSG, DLM_MOD_KEY,
  1282. node);
  1283. else
  1284. status = ret;
  1285. return status;
  1286. }
  1287. static void dlm_send_join_asserts(struct dlm_ctxt *dlm,
  1288. unsigned long *node_map)
  1289. {
  1290. int status, node, live;
  1291. status = 0;
  1292. node = -1;
  1293. while ((node = find_next_bit(node_map, O2NM_MAX_NODES,
  1294. node + 1)) < O2NM_MAX_NODES) {
  1295. if (node == dlm->node_num)
  1296. continue;
  1297. do {
  1298. /* It is very important that this message be
  1299. * received so we spin until either the node
  1300. * has died or it gets the message. */
  1301. status = dlm_send_one_join_assert(dlm, node);
  1302. spin_lock(&dlm->spinlock);
  1303. live = test_bit(node, dlm->live_nodes_map);
  1304. spin_unlock(&dlm->spinlock);
  1305. if (status) {
  1306. mlog(ML_ERROR, "Error return %d asserting "
  1307. "join on node %d\n", status, node);
  1308. /* give us some time between errors... */
  1309. if (live)
  1310. msleep(DLM_DOMAIN_BACKOFF_MS);
  1311. }
  1312. } while (status && live);
  1313. }
  1314. }
  1315. struct domain_join_ctxt {
  1316. unsigned long live_map[BITS_TO_LONGS(O2NM_MAX_NODES)];
  1317. unsigned long yes_resp_map[BITS_TO_LONGS(O2NM_MAX_NODES)];
  1318. };
  1319. static int dlm_should_restart_join(struct dlm_ctxt *dlm,
  1320. struct domain_join_ctxt *ctxt,
  1321. enum dlm_query_join_response_code response)
  1322. {
  1323. int ret;
  1324. if (response == JOIN_DISALLOW) {
  1325. mlog(0, "Latest response of disallow -- should restart\n");
  1326. return 1;
  1327. }
  1328. spin_lock(&dlm->spinlock);
  1329. /* For now, we restart the process if the node maps have
  1330. * changed at all */
  1331. ret = memcmp(ctxt->live_map, dlm->live_nodes_map,
  1332. sizeof(dlm->live_nodes_map));
  1333. spin_unlock(&dlm->spinlock);
  1334. if (ret)
  1335. mlog(0, "Node maps changed -- should restart\n");
  1336. return ret;
  1337. }
  1338. static int dlm_try_to_join_domain(struct dlm_ctxt *dlm)
  1339. {
  1340. int status = 0, tmpstat, node;
  1341. struct domain_join_ctxt *ctxt;
  1342. enum dlm_query_join_response_code response = JOIN_DISALLOW;
  1343. mlog(0, "%p", dlm);
  1344. ctxt = kzalloc(sizeof(*ctxt), GFP_KERNEL);
  1345. if (!ctxt) {
  1346. status = -ENOMEM;
  1347. mlog_errno(status);
  1348. goto bail;
  1349. }
  1350. /* group sem locking should work for us here -- we're already
  1351. * registered for heartbeat events so filling this should be
  1352. * atomic wrt getting those handlers called. */
  1353. o2hb_fill_node_map(dlm->live_nodes_map, sizeof(dlm->live_nodes_map));
  1354. spin_lock(&dlm->spinlock);
  1355. memcpy(ctxt->live_map, dlm->live_nodes_map, sizeof(ctxt->live_map));
  1356. __dlm_set_joining_node(dlm, dlm->node_num);
  1357. spin_unlock(&dlm->spinlock);
  1358. node = -1;
  1359. while ((node = find_next_bit(ctxt->live_map, O2NM_MAX_NODES,
  1360. node + 1)) < O2NM_MAX_NODES) {
  1361. if (node == dlm->node_num)
  1362. continue;
  1363. status = dlm_request_join(dlm, node, &response);
  1364. if (status < 0) {
  1365. mlog_errno(status);
  1366. goto bail;
  1367. }
  1368. /* Ok, either we got a response or the node doesn't have a
  1369. * dlm up. */
  1370. if (response == JOIN_OK)
  1371. set_bit(node, ctxt->yes_resp_map);
  1372. if (dlm_should_restart_join(dlm, ctxt, response)) {
  1373. status = -EAGAIN;
  1374. goto bail;
  1375. }
  1376. }
  1377. mlog(0, "Yay, done querying nodes!\n");
  1378. /* Yay, everyone agree's we can join the domain. My domain is
  1379. * comprised of all nodes who were put in the
  1380. * yes_resp_map. Copy that into our domain map and send a join
  1381. * assert message to clean up everyone elses state. */
  1382. spin_lock(&dlm->spinlock);
  1383. memcpy(dlm->domain_map, ctxt->yes_resp_map,
  1384. sizeof(ctxt->yes_resp_map));
  1385. set_bit(dlm->node_num, dlm->domain_map);
  1386. spin_unlock(&dlm->spinlock);
  1387. /* Support for global heartbeat and node info was added in 1.1 */
  1388. if (dlm->dlm_locking_proto.pv_major > 1 ||
  1389. dlm->dlm_locking_proto.pv_minor > 0) {
  1390. status = dlm_send_nodeinfo(dlm, ctxt->yes_resp_map);
  1391. if (status) {
  1392. mlog_errno(status);
  1393. goto bail;
  1394. }
  1395. status = dlm_send_regions(dlm, ctxt->yes_resp_map);
  1396. if (status) {
  1397. mlog_errno(status);
  1398. goto bail;
  1399. }
  1400. }
  1401. dlm_send_join_asserts(dlm, ctxt->yes_resp_map);
  1402. /* Joined state *must* be set before the joining node
  1403. * information, otherwise the query_join handler may read no
  1404. * current joiner but a state of NEW and tell joining nodes
  1405. * we're not in the domain. */
  1406. spin_lock(&dlm_domain_lock);
  1407. dlm->dlm_state = DLM_CTXT_JOINED;
  1408. dlm->num_joins++;
  1409. spin_unlock(&dlm_domain_lock);
  1410. bail:
  1411. spin_lock(&dlm->spinlock);
  1412. __dlm_set_joining_node(dlm, DLM_LOCK_RES_OWNER_UNKNOWN);
  1413. if (!status) {
  1414. printk(KERN_NOTICE "o2dlm: Joining domain %s ", dlm->name);
  1415. __dlm_print_nodes(dlm);
  1416. }
  1417. spin_unlock(&dlm->spinlock);
  1418. if (ctxt) {
  1419. /* Do we need to send a cancel message to any nodes? */
  1420. if (status < 0) {
  1421. tmpstat = dlm_send_join_cancels(dlm,
  1422. ctxt->yes_resp_map,
  1423. sizeof(ctxt->yes_resp_map));
  1424. if (tmpstat < 0)
  1425. mlog_errno(tmpstat);
  1426. }
  1427. kfree(ctxt);
  1428. }
  1429. mlog(0, "returning %d\n", status);
  1430. return status;
  1431. }
  1432. static void dlm_unregister_domain_handlers(struct dlm_ctxt *dlm)
  1433. {
  1434. o2hb_unregister_callback(dlm->name, &dlm->dlm_hb_up);
  1435. o2hb_unregister_callback(dlm->name, &dlm->dlm_hb_down);
  1436. o2net_unregister_handler_list(&dlm->dlm_domain_handlers);
  1437. }
  1438. static int dlm_register_domain_handlers(struct dlm_ctxt *dlm)
  1439. {
  1440. int status;
  1441. mlog(0, "registering handlers.\n");
  1442. o2hb_setup_callback(&dlm->dlm_hb_down, O2HB_NODE_DOWN_CB,
  1443. dlm_hb_node_down_cb, dlm, DLM_HB_NODE_DOWN_PRI);
  1444. status = o2hb_register_callback(dlm->name, &dlm->dlm_hb_down);
  1445. if (status)
  1446. goto bail;
  1447. o2hb_setup_callback(&dlm->dlm_hb_up, O2HB_NODE_UP_CB,
  1448. dlm_hb_node_up_cb, dlm, DLM_HB_NODE_UP_PRI);
  1449. status = o2hb_register_callback(dlm->name, &dlm->dlm_hb_up);
  1450. if (status)
  1451. goto bail;
  1452. status = o2net_register_handler(DLM_MASTER_REQUEST_MSG, dlm->key,
  1453. sizeof(struct dlm_master_request),
  1454. dlm_master_request_handler,
  1455. dlm, NULL, &dlm->dlm_domain_handlers);
  1456. if (status)
  1457. goto bail;
  1458. status = o2net_register_handler(DLM_ASSERT_MASTER_MSG, dlm->key,
  1459. sizeof(struct dlm_assert_master),
  1460. dlm_assert_master_handler,
  1461. dlm, dlm_assert_master_post_handler,
  1462. &dlm->dlm_domain_handlers);
  1463. if (status)
  1464. goto bail;
  1465. status = o2net_register_handler(DLM_CREATE_LOCK_MSG, dlm->key,
  1466. sizeof(struct dlm_create_lock),
  1467. dlm_create_lock_handler,
  1468. dlm, NULL, &dlm->dlm_domain_handlers);
  1469. if (status)
  1470. goto bail;
  1471. status = o2net_register_handler(DLM_CONVERT_LOCK_MSG, dlm->key,
  1472. DLM_CONVERT_LOCK_MAX_LEN,
  1473. dlm_convert_lock_handler,
  1474. dlm, NULL, &dlm->dlm_domain_handlers);
  1475. if (status)
  1476. goto bail;
  1477. status = o2net_register_handler(DLM_UNLOCK_LOCK_MSG, dlm->key,
  1478. DLM_UNLOCK_LOCK_MAX_LEN,
  1479. dlm_unlock_lock_handler,
  1480. dlm, NULL, &dlm->dlm_domain_handlers);
  1481. if (status)
  1482. goto bail;
  1483. status = o2net_register_handler(DLM_PROXY_AST_MSG, dlm->key,
  1484. DLM_PROXY_AST_MAX_LEN,
  1485. dlm_proxy_ast_handler,
  1486. dlm, NULL, &dlm->dlm_domain_handlers);
  1487. if (status)
  1488. goto bail;
  1489. status = o2net_register_handler(DLM_EXIT_DOMAIN_MSG, dlm->key,
  1490. sizeof(struct dlm_exit_domain),
  1491. dlm_exit_domain_handler,
  1492. dlm, NULL, &dlm->dlm_domain_handlers);
  1493. if (status)
  1494. goto bail;
  1495. status = o2net_register_handler(DLM_DEREF_LOCKRES_MSG, dlm->key,
  1496. sizeof(struct dlm_deref_lockres),
  1497. dlm_deref_lockres_handler,
  1498. dlm, NULL, &dlm->dlm_domain_handlers);
  1499. if (status)
  1500. goto bail;
  1501. status = o2net_register_handler(DLM_MIGRATE_REQUEST_MSG, dlm->key,
  1502. sizeof(struct dlm_migrate_request),
  1503. dlm_migrate_request_handler,
  1504. dlm, NULL, &dlm->dlm_domain_handlers);
  1505. if (status)
  1506. goto bail;
  1507. status = o2net_register_handler(DLM_MIG_LOCKRES_MSG, dlm->key,
  1508. DLM_MIG_LOCKRES_MAX_LEN,
  1509. dlm_mig_lockres_handler,
  1510. dlm, NULL, &dlm->dlm_domain_handlers);
  1511. if (status)
  1512. goto bail;
  1513. status = o2net_register_handler(DLM_MASTER_REQUERY_MSG, dlm->key,
  1514. sizeof(struct dlm_master_requery),
  1515. dlm_master_requery_handler,
  1516. dlm, NULL, &dlm->dlm_domain_handlers);
  1517. if (status)
  1518. goto bail;
  1519. status = o2net_register_handler(DLM_LOCK_REQUEST_MSG, dlm->key,
  1520. sizeof(struct dlm_lock_request),
  1521. dlm_request_all_locks_handler,
  1522. dlm, NULL, &dlm->dlm_domain_handlers);
  1523. if (status)
  1524. goto bail;
  1525. status = o2net_register_handler(DLM_RECO_DATA_DONE_MSG, dlm->key,
  1526. sizeof(struct dlm_reco_data_done),
  1527. dlm_reco_data_done_handler,
  1528. dlm, NULL, &dlm->dlm_domain_handlers);
  1529. if (status)
  1530. goto bail;
  1531. status = o2net_register_handler(DLM_BEGIN_RECO_MSG, dlm->key,
  1532. sizeof(struct dlm_begin_reco),
  1533. dlm_begin_reco_handler,
  1534. dlm, NULL, &dlm->dlm_domain_handlers);
  1535. if (status)
  1536. goto bail;
  1537. status = o2net_register_handler(DLM_FINALIZE_RECO_MSG, dlm->key,
  1538. sizeof(struct dlm_finalize_reco),
  1539. dlm_finalize_reco_handler,
  1540. dlm, NULL, &dlm->dlm_domain_handlers);
  1541. if (status)
  1542. goto bail;
  1543. status = o2net_register_handler(DLM_BEGIN_EXIT_DOMAIN_MSG, dlm->key,
  1544. sizeof(struct dlm_exit_domain),
  1545. dlm_begin_exit_domain_handler,
  1546. dlm, NULL, &dlm->dlm_domain_handlers);
  1547. if (status)
  1548. goto bail;
  1549. bail:
  1550. if (status)
  1551. dlm_unregister_domain_handlers(dlm);
  1552. return status;
  1553. }
  1554. static int dlm_join_domain(struct dlm_ctxt *dlm)
  1555. {
  1556. int status;
  1557. unsigned int backoff;
  1558. unsigned int total_backoff = 0;
  1559. BUG_ON(!dlm);
  1560. mlog(0, "Join domain %s\n", dlm->name);
  1561. status = dlm_register_domain_handlers(dlm);
  1562. if (status) {
  1563. mlog_errno(status);
  1564. goto bail;
  1565. }
  1566. status = dlm_launch_thread(dlm);
  1567. if (status < 0) {
  1568. mlog_errno(status);
  1569. goto bail;
  1570. }
  1571. status = dlm_launch_recovery_thread(dlm);
  1572. if (status < 0) {
  1573. mlog_errno(status);
  1574. goto bail;
  1575. }
  1576. status = dlm_debug_init(dlm);
  1577. if (status < 0) {
  1578. mlog_errno(status);
  1579. goto bail;
  1580. }
  1581. dlm->dlm_worker = create_singlethread_workqueue("dlm_wq");
  1582. if (!dlm->dlm_worker) {
  1583. status = -ENOMEM;
  1584. mlog_errno(status);
  1585. goto bail;
  1586. }
  1587. do {
  1588. status = dlm_try_to_join_domain(dlm);
  1589. /* If we're racing another node to the join, then we
  1590. * need to back off temporarily and let them
  1591. * complete. */
  1592. #define DLM_JOIN_TIMEOUT_MSECS 90000
  1593. if (status == -EAGAIN) {
  1594. if (signal_pending(current)) {
  1595. status = -ERESTARTSYS;
  1596. goto bail;
  1597. }
  1598. if (total_backoff > DLM_JOIN_TIMEOUT_MSECS) {
  1599. status = -ERESTARTSYS;
  1600. mlog(ML_NOTICE, "Timed out joining dlm domain "
  1601. "%s after %u msecs\n", dlm->name,
  1602. total_backoff);
  1603. goto bail;
  1604. }
  1605. /*
  1606. * <chip> After you!
  1607. * <dale> No, after you!
  1608. * <chip> I insist!
  1609. * <dale> But you first!
  1610. * ...
  1611. */
  1612. backoff = (unsigned int)(jiffies & 0x3);
  1613. backoff *= DLM_DOMAIN_BACKOFF_MS;
  1614. total_backoff += backoff;
  1615. mlog(0, "backoff %d\n", backoff);
  1616. msleep(backoff);
  1617. }
  1618. } while (status == -EAGAIN);
  1619. if (status < 0) {
  1620. mlog_errno(status);
  1621. goto bail;
  1622. }
  1623. status = 0;
  1624. bail:
  1625. wake_up(&dlm_domain_events);
  1626. if (status) {
  1627. dlm_unregister_domain_handlers(dlm);
  1628. dlm_debug_shutdown(dlm);
  1629. dlm_complete_thread(dlm);
  1630. dlm_complete_recovery_thread(dlm);
  1631. dlm_destroy_dlm_worker(dlm);
  1632. }
  1633. return status;
  1634. }
  1635. static struct dlm_ctxt *dlm_alloc_ctxt(const char *domain,
  1636. u32 key)
  1637. {
  1638. int i;
  1639. int ret;
  1640. struct dlm_ctxt *dlm = NULL;
  1641. dlm = kzalloc(sizeof(*dlm), GFP_KERNEL);
  1642. if (!dlm) {
  1643. mlog_errno(-ENOMEM);
  1644. goto leave;
  1645. }
  1646. dlm->name = kstrdup(domain, GFP_KERNEL);
  1647. if (dlm->name == NULL) {
  1648. mlog_errno(-ENOMEM);
  1649. kfree(dlm);
  1650. dlm = NULL;
  1651. goto leave;
  1652. }
  1653. dlm->lockres_hash = (struct hlist_head **)dlm_alloc_pagevec(DLM_HASH_PAGES);
  1654. if (!dlm->lockres_hash) {
  1655. mlog_errno(-ENOMEM);
  1656. kfree(dlm->name);
  1657. kfree(dlm);
  1658. dlm = NULL;
  1659. goto leave;
  1660. }
  1661. for (i = 0; i < DLM_HASH_BUCKETS; i++)
  1662. INIT_HLIST_HEAD(dlm_lockres_hash(dlm, i));
  1663. dlm->master_hash = (struct hlist_head **)
  1664. dlm_alloc_pagevec(DLM_HASH_PAGES);
  1665. if (!dlm->master_hash) {
  1666. mlog_errno(-ENOMEM);
  1667. dlm_free_pagevec((void **)dlm->lockres_hash, DLM_HASH_PAGES);
  1668. kfree(dlm->name);
  1669. kfree(dlm);
  1670. dlm = NULL;
  1671. goto leave;
  1672. }
  1673. for (i = 0; i < DLM_HASH_BUCKETS; i++)
  1674. INIT_HLIST_HEAD(dlm_master_hash(dlm, i));
  1675. dlm->key = key;
  1676. dlm->node_num = o2nm_this_node();
  1677. ret = dlm_create_debugfs_subroot(dlm);
  1678. if (ret < 0) {
  1679. dlm_free_pagevec((void **)dlm->master_hash, DLM_HASH_PAGES);
  1680. dlm_free_pagevec((void **)dlm->lockres_hash, DLM_HASH_PAGES);
  1681. kfree(dlm->name);
  1682. kfree(dlm);
  1683. dlm = NULL;
  1684. goto leave;
  1685. }
  1686. spin_lock_init(&dlm->spinlock);
  1687. spin_lock_init(&dlm->master_lock);
  1688. spin_lock_init(&dlm->ast_lock);
  1689. spin_lock_init(&dlm->track_lock);
  1690. INIT_LIST_HEAD(&dlm->list);
  1691. INIT_LIST_HEAD(&dlm->dirty_list);
  1692. INIT_LIST_HEAD(&dlm->reco.resources);
  1693. INIT_LIST_HEAD(&dlm->reco.node_data);
  1694. INIT_LIST_HEAD(&dlm->purge_list);
  1695. INIT_LIST_HEAD(&dlm->dlm_domain_handlers);
  1696. INIT_LIST_HEAD(&dlm->tracking_list);
  1697. dlm->reco.state = 0;
  1698. INIT_LIST_HEAD(&dlm->pending_asts);
  1699. INIT_LIST_HEAD(&dlm->pending_basts);
  1700. mlog(0, "dlm->recovery_map=%p, &(dlm->recovery_map[0])=%p\n",
  1701. dlm->recovery_map, &(dlm->recovery_map[0]));
  1702. memset(dlm->recovery_map, 0, sizeof(dlm->recovery_map));
  1703. memset(dlm->live_nodes_map, 0, sizeof(dlm->live_nodes_map));
  1704. memset(dlm->domain_map, 0, sizeof(dlm->domain_map));
  1705. dlm->dlm_thread_task = NULL;
  1706. dlm->dlm_reco_thread_task = NULL;
  1707. dlm->dlm_worker = NULL;
  1708. init_waitqueue_head(&dlm->dlm_thread_wq);
  1709. init_waitqueue_head(&dlm->dlm_reco_thread_wq);
  1710. init_waitqueue_head(&dlm->reco.event);
  1711. init_waitqueue_head(&dlm->ast_wq);
  1712. init_waitqueue_head(&dlm->migration_wq);
  1713. INIT_LIST_HEAD(&dlm->mle_hb_events);
  1714. dlm->joining_node = DLM_LOCK_RES_OWNER_UNKNOWN;
  1715. init_waitqueue_head(&dlm->dlm_join_events);
  1716. dlm->reco.new_master = O2NM_INVALID_NODE_NUM;
  1717. dlm->reco.dead_node = O2NM_INVALID_NODE_NUM;
  1718. atomic_set(&dlm->res_tot_count, 0);
  1719. atomic_set(&dlm->res_cur_count, 0);
  1720. for (i = 0; i < DLM_MLE_NUM_TYPES; ++i) {
  1721. atomic_set(&dlm->mle_tot_count[i], 0);
  1722. atomic_set(&dlm->mle_cur_count[i], 0);
  1723. }
  1724. spin_lock_init(&dlm->work_lock);
  1725. INIT_LIST_HEAD(&dlm->work_list);
  1726. INIT_WORK(&dlm->dispatched_work, dlm_dispatch_work);
  1727. kref_init(&dlm->dlm_refs);
  1728. dlm->dlm_state = DLM_CTXT_NEW;
  1729. INIT_LIST_HEAD(&dlm->dlm_eviction_callbacks);
  1730. mlog(0, "context init: refcount %u\n",
  1731. atomic_read(&dlm->dlm_refs.refcount));
  1732. leave:
  1733. return dlm;
  1734. }
  1735. /*
  1736. * Compare a requested locking protocol version against the current one.
  1737. *
  1738. * If the major numbers are different, they are incompatible.
  1739. * If the current minor is greater than the request, they are incompatible.
  1740. * If the current minor is less than or equal to the request, they are
  1741. * compatible, and the requester should run at the current minor version.
  1742. */
  1743. static int dlm_protocol_compare(struct dlm_protocol_version *existing,
  1744. struct dlm_protocol_version *request)
  1745. {
  1746. if (existing->pv_major != request->pv_major)
  1747. return 1;
  1748. if (existing->pv_minor > request->pv_minor)
  1749. return 1;
  1750. if (existing->pv_minor < request->pv_minor)
  1751. request->pv_minor = existing->pv_minor;
  1752. return 0;
  1753. }
  1754. /*
  1755. * dlm_register_domain: one-time setup per "domain".
  1756. *
  1757. * The filesystem passes in the requested locking version via proto.
  1758. * If registration was successful, proto will contain the negotiated
  1759. * locking protocol.
  1760. */
  1761. struct dlm_ctxt * dlm_register_domain(const char *domain,
  1762. u32 key,
  1763. struct dlm_protocol_version *fs_proto)
  1764. {
  1765. int ret;
  1766. struct dlm_ctxt *dlm = NULL;
  1767. struct dlm_ctxt *new_ctxt = NULL;
  1768. if (strlen(domain) >= O2NM_MAX_NAME_LEN) {
  1769. ret = -ENAMETOOLONG;
  1770. mlog(ML_ERROR, "domain name length too long\n");
  1771. goto leave;
  1772. }
  1773. mlog(0, "register called for domain \"%s\"\n", domain);
  1774. retry:
  1775. dlm = NULL;
  1776. if (signal_pending(current)) {
  1777. ret = -ERESTARTSYS;
  1778. mlog_errno(ret);
  1779. goto leave;
  1780. }
  1781. spin_lock(&dlm_domain_lock);
  1782. dlm = __dlm_lookup_domain(domain);
  1783. if (dlm) {
  1784. if (dlm->dlm_state != DLM_CTXT_JOINED) {
  1785. spin_unlock(&dlm_domain_lock);
  1786. mlog(0, "This ctxt is not joined yet!\n");
  1787. wait_event_interruptible(dlm_domain_events,
  1788. dlm_wait_on_domain_helper(
  1789. domain));
  1790. goto retry;
  1791. }
  1792. if (dlm_protocol_compare(&dlm->fs_locking_proto, fs_proto)) {
  1793. spin_unlock(&dlm_domain_lock);
  1794. mlog(ML_ERROR,
  1795. "Requested locking protocol version is not "
  1796. "compatible with already registered domain "
  1797. "\"%s\"\n", domain);
  1798. ret = -EPROTO;
  1799. goto leave;
  1800. }
  1801. __dlm_get(dlm);
  1802. dlm->num_joins++;
  1803. spin_unlock(&dlm_domain_lock);
  1804. ret = 0;
  1805. goto leave;
  1806. }
  1807. /* doesn't exist */
  1808. if (!new_ctxt) {
  1809. spin_unlock(&dlm_domain_lock);
  1810. new_ctxt = dlm_alloc_ctxt(domain, key);
  1811. if (new_ctxt)
  1812. goto retry;
  1813. ret = -ENOMEM;
  1814. mlog_errno(ret);
  1815. goto leave;
  1816. }
  1817. /* a little variable switch-a-roo here... */
  1818. dlm = new_ctxt;
  1819. new_ctxt = NULL;
  1820. /* add the new domain */
  1821. list_add_tail(&dlm->list, &dlm_domains);
  1822. spin_unlock(&dlm_domain_lock);
  1823. /*
  1824. * Pass the locking protocol version into the join. If the join
  1825. * succeeds, it will have the negotiated protocol set.
  1826. */
  1827. dlm->dlm_locking_proto = dlm_protocol;
  1828. dlm->fs_locking_proto = *fs_proto;
  1829. ret = dlm_join_domain(dlm);
  1830. if (ret) {
  1831. mlog_errno(ret);
  1832. dlm_put(dlm);
  1833. goto leave;
  1834. }
  1835. /* Tell the caller what locking protocol we negotiated */
  1836. *fs_proto = dlm->fs_locking_proto;
  1837. ret = 0;
  1838. leave:
  1839. if (new_ctxt)
  1840. dlm_free_ctxt_mem(new_ctxt);
  1841. if (ret < 0)
  1842. dlm = ERR_PTR(ret);
  1843. return dlm;
  1844. }
  1845. EXPORT_SYMBOL_GPL(dlm_register_domain);
  1846. static LIST_HEAD(dlm_join_handlers);
  1847. static void dlm_unregister_net_handlers(void)
  1848. {
  1849. o2net_unregister_handler_list(&dlm_join_handlers);
  1850. }
  1851. static int dlm_register_net_handlers(void)
  1852. {
  1853. int status = 0;
  1854. status = o2net_register_handler(DLM_QUERY_JOIN_MSG, DLM_MOD_KEY,
  1855. sizeof(struct dlm_query_join_request),
  1856. dlm_query_join_handler,
  1857. NULL, NULL, &dlm_join_handlers);
  1858. if (status)
  1859. goto bail;
  1860. status = o2net_register_handler(DLM_ASSERT_JOINED_MSG, DLM_MOD_KEY,
  1861. sizeof(struct dlm_assert_joined),
  1862. dlm_assert_joined_handler,
  1863. NULL, NULL, &dlm_join_handlers);
  1864. if (status)
  1865. goto bail;
  1866. status = o2net_register_handler(DLM_CANCEL_JOIN_MSG, DLM_MOD_KEY,
  1867. sizeof(struct dlm_cancel_join),
  1868. dlm_cancel_join_handler,
  1869. NULL, NULL, &dlm_join_handlers);
  1870. if (status)
  1871. goto bail;
  1872. status = o2net_register_handler(DLM_QUERY_REGION, DLM_MOD_KEY,
  1873. sizeof(struct dlm_query_region),
  1874. dlm_query_region_handler,
  1875. NULL, NULL, &dlm_join_handlers);
  1876. if (status)
  1877. goto bail;
  1878. status = o2net_register_handler(DLM_QUERY_NODEINFO, DLM_MOD_KEY,
  1879. sizeof(struct dlm_query_nodeinfo),
  1880. dlm_query_nodeinfo_handler,
  1881. NULL, NULL, &dlm_join_handlers);
  1882. bail:
  1883. if (status < 0)
  1884. dlm_unregister_net_handlers();
  1885. return status;
  1886. }
  1887. /* Domain eviction callback handling.
  1888. *
  1889. * The file system requires notification of node death *before* the
  1890. * dlm completes it's recovery work, otherwise it may be able to
  1891. * acquire locks on resources requiring recovery. Since the dlm can
  1892. * evict a node from it's domain *before* heartbeat fires, a similar
  1893. * mechanism is required. */
  1894. /* Eviction is not expected to happen often, so a per-domain lock is
  1895. * not necessary. Eviction callbacks are allowed to sleep for short
  1896. * periods of time. */
  1897. static DECLARE_RWSEM(dlm_callback_sem);
  1898. void dlm_fire_domain_eviction_callbacks(struct dlm_ctxt *dlm,
  1899. int node_num)
  1900. {
  1901. struct dlm_eviction_cb *cb;
  1902. down_read(&dlm_callback_sem);
  1903. list_for_each_entry(cb, &dlm->dlm_eviction_callbacks, ec_item) {
  1904. cb->ec_func(node_num, cb->ec_data);
  1905. }
  1906. up_read(&dlm_callback_sem);
  1907. }
  1908. void dlm_setup_eviction_cb(struct dlm_eviction_cb *cb,
  1909. dlm_eviction_func *f,
  1910. void *data)
  1911. {
  1912. INIT_LIST_HEAD(&cb->ec_item);
  1913. cb->ec_func = f;
  1914. cb->ec_data = data;
  1915. }
  1916. EXPORT_SYMBOL_GPL(dlm_setup_eviction_cb);
  1917. void dlm_register_eviction_cb(struct dlm_ctxt *dlm,
  1918. struct dlm_eviction_cb *cb)
  1919. {
  1920. down_write(&dlm_callback_sem);
  1921. list_add_tail(&cb->ec_item, &dlm->dlm_eviction_callbacks);
  1922. up_write(&dlm_callback_sem);
  1923. }
  1924. EXPORT_SYMBOL_GPL(dlm_register_eviction_cb);
  1925. void dlm_unregister_eviction_cb(struct dlm_eviction_cb *cb)
  1926. {
  1927. down_write(&dlm_callback_sem);
  1928. list_del_init(&cb->ec_item);
  1929. up_write(&dlm_callback_sem);
  1930. }
  1931. EXPORT_SYMBOL_GPL(dlm_unregister_eviction_cb);
  1932. static int __init dlm_init(void)
  1933. {
  1934. int status;
  1935. status = dlm_init_mle_cache();
  1936. if (status) {
  1937. mlog(ML_ERROR, "Could not create o2dlm_mle slabcache\n");
  1938. goto error;
  1939. }
  1940. status = dlm_init_master_caches();
  1941. if (status) {
  1942. mlog(ML_ERROR, "Could not create o2dlm_lockres and "
  1943. "o2dlm_lockname slabcaches\n");
  1944. goto error;
  1945. }
  1946. status = dlm_init_lock_cache();
  1947. if (status) {
  1948. mlog(ML_ERROR, "Count not create o2dlm_lock slabcache\n");
  1949. goto error;
  1950. }
  1951. status = dlm_register_net_handlers();
  1952. if (status) {
  1953. mlog(ML_ERROR, "Unable to register network handlers\n");
  1954. goto error;
  1955. }
  1956. status = dlm_create_debugfs_root();
  1957. if (status)
  1958. goto error;
  1959. return 0;
  1960. error:
  1961. dlm_unregister_net_handlers();
  1962. dlm_destroy_lock_cache();
  1963. dlm_destroy_master_caches();
  1964. dlm_destroy_mle_cache();
  1965. return -1;
  1966. }
  1967. static void __exit dlm_exit (void)
  1968. {
  1969. dlm_destroy_debugfs_root();
  1970. dlm_unregister_net_handlers();
  1971. dlm_destroy_lock_cache();
  1972. dlm_destroy_master_caches();
  1973. dlm_destroy_mle_cache();
  1974. }
  1975. MODULE_AUTHOR("Oracle");
  1976. MODULE_LICENSE("GPL");
  1977. MODULE_DESCRIPTION("OCFS2 Distributed Lock Management");
  1978. module_init(dlm_init);
  1979. module_exit(dlm_exit);