dlmdomain.c 59 KB

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