nfs4state.c 24 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965
  1. /*
  2. * fs/nfs/nfs4state.c
  3. *
  4. * Client-side XDR for NFSv4.
  5. *
  6. * Copyright (c) 2002 The Regents of the University of Michigan.
  7. * All rights reserved.
  8. *
  9. * Kendrick Smith <kmsmith@umich.edu>
  10. *
  11. * Redistribution and use in source and binary forms, with or without
  12. * modification, are permitted provided that the following conditions
  13. * are met:
  14. *
  15. * 1. Redistributions of source code must retain the above copyright
  16. * notice, this list of conditions and the following disclaimer.
  17. * 2. Redistributions in binary form must reproduce the above copyright
  18. * notice, this list of conditions and the following disclaimer in the
  19. * documentation and/or other materials provided with the distribution.
  20. * 3. Neither the name of the University nor the names of its
  21. * contributors may be used to endorse or promote products derived
  22. * from this software without specific prior written permission.
  23. *
  24. * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESS OR IMPLIED
  25. * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
  26. * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
  27. * DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  28. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
  29. * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
  30. * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
  31. * BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
  32. * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
  33. * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
  34. * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  35. *
  36. * Implementation of the NFSv4 state model. For the time being,
  37. * this is minimal, but will be made much more complex in a
  38. * subsequent patch.
  39. */
  40. #include <linux/config.h>
  41. #include <linux/slab.h>
  42. #include <linux/smp_lock.h>
  43. #include <linux/nfs_fs.h>
  44. #include <linux/nfs_idmap.h>
  45. #include <linux/workqueue.h>
  46. #include <linux/bitops.h>
  47. #include "nfs4_fs.h"
  48. #include "callback.h"
  49. #include "delegation.h"
  50. #define OPENOWNER_POOL_SIZE 8
  51. const nfs4_stateid zero_stateid;
  52. static DEFINE_SPINLOCK(state_spinlock);
  53. static LIST_HEAD(nfs4_clientid_list);
  54. static void nfs4_recover_state(void *);
  55. void
  56. init_nfsv4_state(struct nfs_server *server)
  57. {
  58. server->nfs4_state = NULL;
  59. INIT_LIST_HEAD(&server->nfs4_siblings);
  60. }
  61. void
  62. destroy_nfsv4_state(struct nfs_server *server)
  63. {
  64. if (server->mnt_path) {
  65. kfree(server->mnt_path);
  66. server->mnt_path = NULL;
  67. }
  68. if (server->nfs4_state) {
  69. nfs4_put_client(server->nfs4_state);
  70. server->nfs4_state = NULL;
  71. }
  72. }
  73. /*
  74. * nfs4_get_client(): returns an empty client structure
  75. * nfs4_put_client(): drops reference to client structure
  76. *
  77. * Since these are allocated/deallocated very rarely, we don't
  78. * bother putting them in a slab cache...
  79. */
  80. static struct nfs4_client *
  81. nfs4_alloc_client(struct in_addr *addr)
  82. {
  83. struct nfs4_client *clp;
  84. if (nfs_callback_up() < 0)
  85. return NULL;
  86. if ((clp = kmalloc(sizeof(*clp), GFP_KERNEL)) == NULL) {
  87. nfs_callback_down();
  88. return NULL;
  89. }
  90. memset(clp, 0, sizeof(*clp));
  91. memcpy(&clp->cl_addr, addr, sizeof(clp->cl_addr));
  92. init_rwsem(&clp->cl_sem);
  93. INIT_LIST_HEAD(&clp->cl_delegations);
  94. INIT_LIST_HEAD(&clp->cl_state_owners);
  95. INIT_LIST_HEAD(&clp->cl_unused);
  96. spin_lock_init(&clp->cl_lock);
  97. atomic_set(&clp->cl_count, 1);
  98. INIT_WORK(&clp->cl_recoverd, nfs4_recover_state, clp);
  99. INIT_WORK(&clp->cl_renewd, nfs4_renew_state, clp);
  100. INIT_LIST_HEAD(&clp->cl_superblocks);
  101. init_waitqueue_head(&clp->cl_waitq);
  102. rpc_init_wait_queue(&clp->cl_rpcwaitq, "NFS4 client");
  103. clp->cl_rpcclient = ERR_PTR(-EINVAL);
  104. clp->cl_boot_time = CURRENT_TIME;
  105. clp->cl_state = 1 << NFS4CLNT_OK;
  106. return clp;
  107. }
  108. static void
  109. nfs4_free_client(struct nfs4_client *clp)
  110. {
  111. struct nfs4_state_owner *sp;
  112. while (!list_empty(&clp->cl_unused)) {
  113. sp = list_entry(clp->cl_unused.next,
  114. struct nfs4_state_owner,
  115. so_list);
  116. list_del(&sp->so_list);
  117. kfree(sp);
  118. }
  119. BUG_ON(!list_empty(&clp->cl_state_owners));
  120. if (clp->cl_cred)
  121. put_rpccred(clp->cl_cred);
  122. nfs_idmap_delete(clp);
  123. if (!IS_ERR(clp->cl_rpcclient))
  124. rpc_shutdown_client(clp->cl_rpcclient);
  125. kfree(clp);
  126. nfs_callback_down();
  127. }
  128. static struct nfs4_client *__nfs4_find_client(struct in_addr *addr)
  129. {
  130. struct nfs4_client *clp;
  131. list_for_each_entry(clp, &nfs4_clientid_list, cl_servers) {
  132. if (memcmp(&clp->cl_addr, addr, sizeof(clp->cl_addr)) == 0) {
  133. atomic_inc(&clp->cl_count);
  134. return clp;
  135. }
  136. }
  137. return NULL;
  138. }
  139. struct nfs4_client *nfs4_find_client(struct in_addr *addr)
  140. {
  141. struct nfs4_client *clp;
  142. spin_lock(&state_spinlock);
  143. clp = __nfs4_find_client(addr);
  144. spin_unlock(&state_spinlock);
  145. return clp;
  146. }
  147. struct nfs4_client *
  148. nfs4_get_client(struct in_addr *addr)
  149. {
  150. struct nfs4_client *clp, *new = NULL;
  151. spin_lock(&state_spinlock);
  152. for (;;) {
  153. clp = __nfs4_find_client(addr);
  154. if (clp != NULL)
  155. break;
  156. clp = new;
  157. if (clp != NULL) {
  158. list_add(&clp->cl_servers, &nfs4_clientid_list);
  159. new = NULL;
  160. break;
  161. }
  162. spin_unlock(&state_spinlock);
  163. new = nfs4_alloc_client(addr);
  164. spin_lock(&state_spinlock);
  165. if (new == NULL)
  166. break;
  167. }
  168. spin_unlock(&state_spinlock);
  169. if (new)
  170. nfs4_free_client(new);
  171. return clp;
  172. }
  173. void
  174. nfs4_put_client(struct nfs4_client *clp)
  175. {
  176. if (!atomic_dec_and_lock(&clp->cl_count, &state_spinlock))
  177. return;
  178. list_del(&clp->cl_servers);
  179. spin_unlock(&state_spinlock);
  180. BUG_ON(!list_empty(&clp->cl_superblocks));
  181. wake_up_all(&clp->cl_waitq);
  182. rpc_wake_up(&clp->cl_rpcwaitq);
  183. nfs4_kill_renewd(clp);
  184. nfs4_free_client(clp);
  185. }
  186. static int __nfs4_init_client(struct nfs4_client *clp)
  187. {
  188. int status = nfs4_proc_setclientid(clp, NFS4_CALLBACK, nfs_callback_tcpport);
  189. if (status == 0)
  190. status = nfs4_proc_setclientid_confirm(clp);
  191. if (status == 0)
  192. nfs4_schedule_state_renewal(clp);
  193. return status;
  194. }
  195. int nfs4_init_client(struct nfs4_client *clp)
  196. {
  197. return nfs4_map_errors(__nfs4_init_client(clp));
  198. }
  199. u32
  200. nfs4_alloc_lockowner_id(struct nfs4_client *clp)
  201. {
  202. return clp->cl_lockowner_id ++;
  203. }
  204. static struct nfs4_state_owner *
  205. nfs4_client_grab_unused(struct nfs4_client *clp, struct rpc_cred *cred)
  206. {
  207. struct nfs4_state_owner *sp = NULL;
  208. if (!list_empty(&clp->cl_unused)) {
  209. sp = list_entry(clp->cl_unused.next, struct nfs4_state_owner, so_list);
  210. atomic_inc(&sp->so_count);
  211. sp->so_cred = cred;
  212. list_move(&sp->so_list, &clp->cl_state_owners);
  213. clp->cl_nunused--;
  214. }
  215. return sp;
  216. }
  217. static struct nfs4_state_owner *
  218. nfs4_find_state_owner(struct nfs4_client *clp, struct rpc_cred *cred)
  219. {
  220. struct nfs4_state_owner *sp, *res = NULL;
  221. list_for_each_entry(sp, &clp->cl_state_owners, so_list) {
  222. if (sp->so_cred != cred)
  223. continue;
  224. atomic_inc(&sp->so_count);
  225. /* Move to the head of the list */
  226. list_move(&sp->so_list, &clp->cl_state_owners);
  227. res = sp;
  228. break;
  229. }
  230. return res;
  231. }
  232. /*
  233. * nfs4_alloc_state_owner(): this is called on the OPEN or CREATE path to
  234. * create a new state_owner.
  235. *
  236. */
  237. static struct nfs4_state_owner *
  238. nfs4_alloc_state_owner(void)
  239. {
  240. struct nfs4_state_owner *sp;
  241. sp = kzalloc(sizeof(*sp),GFP_KERNEL);
  242. if (!sp)
  243. return NULL;
  244. spin_lock_init(&sp->so_lock);
  245. INIT_LIST_HEAD(&sp->so_states);
  246. INIT_LIST_HEAD(&sp->so_delegations);
  247. rpc_init_wait_queue(&sp->so_sequence.wait, "Seqid_waitqueue");
  248. sp->so_seqid.sequence = &sp->so_sequence;
  249. spin_lock_init(&sp->so_sequence.lock);
  250. INIT_LIST_HEAD(&sp->so_sequence.list);
  251. atomic_set(&sp->so_count, 1);
  252. return sp;
  253. }
  254. void
  255. nfs4_drop_state_owner(struct nfs4_state_owner *sp)
  256. {
  257. struct nfs4_client *clp = sp->so_client;
  258. spin_lock(&clp->cl_lock);
  259. list_del_init(&sp->so_list);
  260. spin_unlock(&clp->cl_lock);
  261. }
  262. /*
  263. * Note: must be called with clp->cl_sem held in order to prevent races
  264. * with reboot recovery!
  265. */
  266. struct nfs4_state_owner *nfs4_get_state_owner(struct nfs_server *server, struct rpc_cred *cred)
  267. {
  268. struct nfs4_client *clp = server->nfs4_state;
  269. struct nfs4_state_owner *sp, *new;
  270. get_rpccred(cred);
  271. new = nfs4_alloc_state_owner();
  272. spin_lock(&clp->cl_lock);
  273. sp = nfs4_find_state_owner(clp, cred);
  274. if (sp == NULL)
  275. sp = nfs4_client_grab_unused(clp, cred);
  276. if (sp == NULL && new != NULL) {
  277. list_add(&new->so_list, &clp->cl_state_owners);
  278. new->so_client = clp;
  279. new->so_id = nfs4_alloc_lockowner_id(clp);
  280. new->so_cred = cred;
  281. sp = new;
  282. new = NULL;
  283. }
  284. spin_unlock(&clp->cl_lock);
  285. if (new)
  286. kfree(new);
  287. if (sp != NULL)
  288. return sp;
  289. put_rpccred(cred);
  290. return NULL;
  291. }
  292. /*
  293. * Must be called with clp->cl_sem held in order to avoid races
  294. * with state recovery...
  295. */
  296. void nfs4_put_state_owner(struct nfs4_state_owner *sp)
  297. {
  298. struct nfs4_client *clp = sp->so_client;
  299. struct rpc_cred *cred = sp->so_cred;
  300. if (!atomic_dec_and_lock(&sp->so_count, &clp->cl_lock))
  301. return;
  302. if (clp->cl_nunused >= OPENOWNER_POOL_SIZE)
  303. goto out_free;
  304. if (list_empty(&sp->so_list))
  305. goto out_free;
  306. list_move(&sp->so_list, &clp->cl_unused);
  307. clp->cl_nunused++;
  308. spin_unlock(&clp->cl_lock);
  309. put_rpccred(cred);
  310. cred = NULL;
  311. return;
  312. out_free:
  313. list_del(&sp->so_list);
  314. spin_unlock(&clp->cl_lock);
  315. put_rpccred(cred);
  316. kfree(sp);
  317. }
  318. static struct nfs4_state *
  319. nfs4_alloc_open_state(void)
  320. {
  321. struct nfs4_state *state;
  322. state = kmalloc(sizeof(*state), GFP_KERNEL);
  323. if (!state)
  324. return NULL;
  325. state->state = 0;
  326. state->nreaders = 0;
  327. state->nwriters = 0;
  328. state->flags = 0;
  329. memset(state->stateid.data, 0, sizeof(state->stateid.data));
  330. atomic_set(&state->count, 1);
  331. INIT_LIST_HEAD(&state->lock_states);
  332. spin_lock_init(&state->state_lock);
  333. return state;
  334. }
  335. void
  336. nfs4_state_set_mode_locked(struct nfs4_state *state, mode_t mode)
  337. {
  338. if (state->state == mode)
  339. return;
  340. /* NB! List reordering - see the reclaim code for why. */
  341. if ((mode & FMODE_WRITE) != (state->state & FMODE_WRITE)) {
  342. if (mode & FMODE_WRITE)
  343. list_move(&state->open_states, &state->owner->so_states);
  344. else
  345. list_move_tail(&state->open_states, &state->owner->so_states);
  346. }
  347. if (mode == 0)
  348. list_del_init(&state->inode_states);
  349. state->state = mode;
  350. }
  351. static struct nfs4_state *
  352. __nfs4_find_state_byowner(struct inode *inode, struct nfs4_state_owner *owner)
  353. {
  354. struct nfs_inode *nfsi = NFS_I(inode);
  355. struct nfs4_state *state;
  356. list_for_each_entry(state, &nfsi->open_states, inode_states) {
  357. /* Is this in the process of being freed? */
  358. if (state->state == 0)
  359. continue;
  360. if (state->owner == owner) {
  361. atomic_inc(&state->count);
  362. return state;
  363. }
  364. }
  365. return NULL;
  366. }
  367. static void
  368. nfs4_free_open_state(struct nfs4_state *state)
  369. {
  370. kfree(state);
  371. }
  372. struct nfs4_state *
  373. nfs4_get_open_state(struct inode *inode, struct nfs4_state_owner *owner)
  374. {
  375. struct nfs4_state *state, *new;
  376. struct nfs_inode *nfsi = NFS_I(inode);
  377. spin_lock(&inode->i_lock);
  378. state = __nfs4_find_state_byowner(inode, owner);
  379. spin_unlock(&inode->i_lock);
  380. if (state)
  381. goto out;
  382. new = nfs4_alloc_open_state();
  383. spin_lock(&owner->so_lock);
  384. spin_lock(&inode->i_lock);
  385. state = __nfs4_find_state_byowner(inode, owner);
  386. if (state == NULL && new != NULL) {
  387. state = new;
  388. state->owner = owner;
  389. atomic_inc(&owner->so_count);
  390. list_add(&state->inode_states, &nfsi->open_states);
  391. state->inode = igrab(inode);
  392. spin_unlock(&inode->i_lock);
  393. /* Note: The reclaim code dictates that we add stateless
  394. * and read-only stateids to the end of the list */
  395. list_add_tail(&state->open_states, &owner->so_states);
  396. spin_unlock(&owner->so_lock);
  397. } else {
  398. spin_unlock(&inode->i_lock);
  399. spin_unlock(&owner->so_lock);
  400. if (new)
  401. nfs4_free_open_state(new);
  402. }
  403. out:
  404. return state;
  405. }
  406. /*
  407. * Beware! Caller must be holding exactly one
  408. * reference to clp->cl_sem!
  409. */
  410. void nfs4_put_open_state(struct nfs4_state *state)
  411. {
  412. struct inode *inode = state->inode;
  413. struct nfs4_state_owner *owner = state->owner;
  414. if (!atomic_dec_and_lock(&state->count, &owner->so_lock))
  415. return;
  416. spin_lock(&inode->i_lock);
  417. if (!list_empty(&state->inode_states))
  418. list_del(&state->inode_states);
  419. list_del(&state->open_states);
  420. spin_unlock(&inode->i_lock);
  421. spin_unlock(&owner->so_lock);
  422. iput(inode);
  423. nfs4_free_open_state(state);
  424. nfs4_put_state_owner(owner);
  425. }
  426. /*
  427. * Close the current file.
  428. */
  429. void nfs4_close_state(struct nfs4_state *state, mode_t mode)
  430. {
  431. struct inode *inode = state->inode;
  432. struct nfs4_state_owner *owner = state->owner;
  433. int oldstate, newstate = 0;
  434. atomic_inc(&owner->so_count);
  435. /* Protect against nfs4_find_state() */
  436. spin_lock(&owner->so_lock);
  437. spin_lock(&inode->i_lock);
  438. if (mode & FMODE_READ)
  439. state->nreaders--;
  440. if (mode & FMODE_WRITE)
  441. state->nwriters--;
  442. oldstate = newstate = state->state;
  443. if (state->nreaders == 0)
  444. newstate &= ~FMODE_READ;
  445. if (state->nwriters == 0)
  446. newstate &= ~FMODE_WRITE;
  447. if (test_bit(NFS_DELEGATED_STATE, &state->flags)) {
  448. nfs4_state_set_mode_locked(state, newstate);
  449. oldstate = newstate;
  450. }
  451. spin_unlock(&inode->i_lock);
  452. spin_unlock(&owner->so_lock);
  453. if (oldstate != newstate && nfs4_do_close(inode, state) == 0)
  454. return;
  455. nfs4_put_open_state(state);
  456. nfs4_put_state_owner(owner);
  457. }
  458. /*
  459. * Search the state->lock_states for an existing lock_owner
  460. * that is compatible with current->files
  461. */
  462. static struct nfs4_lock_state *
  463. __nfs4_find_lock_state(struct nfs4_state *state, fl_owner_t fl_owner)
  464. {
  465. struct nfs4_lock_state *pos;
  466. list_for_each_entry(pos, &state->lock_states, ls_locks) {
  467. if (pos->ls_owner != fl_owner)
  468. continue;
  469. atomic_inc(&pos->ls_count);
  470. return pos;
  471. }
  472. return NULL;
  473. }
  474. /*
  475. * Return a compatible lock_state. If no initialized lock_state structure
  476. * exists, return an uninitialized one.
  477. *
  478. */
  479. static struct nfs4_lock_state *nfs4_alloc_lock_state(struct nfs4_state *state, fl_owner_t fl_owner)
  480. {
  481. struct nfs4_lock_state *lsp;
  482. struct nfs4_client *clp = state->owner->so_client;
  483. lsp = kzalloc(sizeof(*lsp), GFP_KERNEL);
  484. if (lsp == NULL)
  485. return NULL;
  486. lsp->ls_seqid.sequence = &state->owner->so_sequence;
  487. atomic_set(&lsp->ls_count, 1);
  488. lsp->ls_owner = fl_owner;
  489. spin_lock(&clp->cl_lock);
  490. lsp->ls_id = nfs4_alloc_lockowner_id(clp);
  491. spin_unlock(&clp->cl_lock);
  492. INIT_LIST_HEAD(&lsp->ls_locks);
  493. return lsp;
  494. }
  495. /*
  496. * Return a compatible lock_state. If no initialized lock_state structure
  497. * exists, return an uninitialized one.
  498. *
  499. * The caller must be holding clp->cl_sem
  500. */
  501. static struct nfs4_lock_state *nfs4_get_lock_state(struct nfs4_state *state, fl_owner_t owner)
  502. {
  503. struct nfs4_lock_state *lsp, *new = NULL;
  504. for(;;) {
  505. spin_lock(&state->state_lock);
  506. lsp = __nfs4_find_lock_state(state, owner);
  507. if (lsp != NULL)
  508. break;
  509. if (new != NULL) {
  510. new->ls_state = state;
  511. list_add(&new->ls_locks, &state->lock_states);
  512. set_bit(LK_STATE_IN_USE, &state->flags);
  513. lsp = new;
  514. new = NULL;
  515. break;
  516. }
  517. spin_unlock(&state->state_lock);
  518. new = nfs4_alloc_lock_state(state, owner);
  519. if (new == NULL)
  520. return NULL;
  521. }
  522. spin_unlock(&state->state_lock);
  523. kfree(new);
  524. return lsp;
  525. }
  526. /*
  527. * Release reference to lock_state, and free it if we see that
  528. * it is no longer in use
  529. */
  530. void nfs4_put_lock_state(struct nfs4_lock_state *lsp)
  531. {
  532. struct nfs4_state *state;
  533. if (lsp == NULL)
  534. return;
  535. state = lsp->ls_state;
  536. if (!atomic_dec_and_lock(&lsp->ls_count, &state->state_lock))
  537. return;
  538. list_del(&lsp->ls_locks);
  539. if (list_empty(&state->lock_states))
  540. clear_bit(LK_STATE_IN_USE, &state->flags);
  541. spin_unlock(&state->state_lock);
  542. kfree(lsp);
  543. }
  544. static void nfs4_fl_copy_lock(struct file_lock *dst, struct file_lock *src)
  545. {
  546. struct nfs4_lock_state *lsp = src->fl_u.nfs4_fl.owner;
  547. dst->fl_u.nfs4_fl.owner = lsp;
  548. atomic_inc(&lsp->ls_count);
  549. }
  550. static void nfs4_fl_release_lock(struct file_lock *fl)
  551. {
  552. nfs4_put_lock_state(fl->fl_u.nfs4_fl.owner);
  553. }
  554. static struct file_lock_operations nfs4_fl_lock_ops = {
  555. .fl_copy_lock = nfs4_fl_copy_lock,
  556. .fl_release_private = nfs4_fl_release_lock,
  557. };
  558. int nfs4_set_lock_state(struct nfs4_state *state, struct file_lock *fl)
  559. {
  560. struct nfs4_lock_state *lsp;
  561. if (fl->fl_ops != NULL)
  562. return 0;
  563. lsp = nfs4_get_lock_state(state, fl->fl_owner);
  564. if (lsp == NULL)
  565. return -ENOMEM;
  566. fl->fl_u.nfs4_fl.owner = lsp;
  567. fl->fl_ops = &nfs4_fl_lock_ops;
  568. return 0;
  569. }
  570. /*
  571. * Byte-range lock aware utility to initialize the stateid of read/write
  572. * requests.
  573. */
  574. void nfs4_copy_stateid(nfs4_stateid *dst, struct nfs4_state *state, fl_owner_t fl_owner)
  575. {
  576. struct nfs4_lock_state *lsp;
  577. memcpy(dst, &state->stateid, sizeof(*dst));
  578. if (test_bit(LK_STATE_IN_USE, &state->flags) == 0)
  579. return;
  580. spin_lock(&state->state_lock);
  581. lsp = __nfs4_find_lock_state(state, fl_owner);
  582. if (lsp != NULL && (lsp->ls_flags & NFS_LOCK_INITIALIZED) != 0)
  583. memcpy(dst, &lsp->ls_stateid, sizeof(*dst));
  584. spin_unlock(&state->state_lock);
  585. nfs4_put_lock_state(lsp);
  586. }
  587. struct nfs_seqid *nfs_alloc_seqid(struct nfs_seqid_counter *counter)
  588. {
  589. struct nfs_seqid *new;
  590. new = kmalloc(sizeof(*new), GFP_KERNEL);
  591. if (new != NULL) {
  592. new->sequence = counter;
  593. INIT_LIST_HEAD(&new->list);
  594. }
  595. return new;
  596. }
  597. void nfs_free_seqid(struct nfs_seqid *seqid)
  598. {
  599. struct rpc_sequence *sequence = seqid->sequence->sequence;
  600. if (!list_empty(&seqid->list)) {
  601. spin_lock(&sequence->lock);
  602. list_del(&seqid->list);
  603. spin_unlock(&sequence->lock);
  604. }
  605. rpc_wake_up_next(&sequence->wait);
  606. kfree(seqid);
  607. }
  608. /*
  609. * Increment the seqid if the OPEN/OPEN_DOWNGRADE/CLOSE succeeded, or
  610. * failed with a seqid incrementing error -
  611. * see comments nfs_fs.h:seqid_mutating_error()
  612. */
  613. static inline void nfs_increment_seqid(int status, struct nfs_seqid *seqid)
  614. {
  615. switch (status) {
  616. case 0:
  617. break;
  618. case -NFS4ERR_BAD_SEQID:
  619. case -NFS4ERR_STALE_CLIENTID:
  620. case -NFS4ERR_STALE_STATEID:
  621. case -NFS4ERR_BAD_STATEID:
  622. case -NFS4ERR_BADXDR:
  623. case -NFS4ERR_RESOURCE:
  624. case -NFS4ERR_NOFILEHANDLE:
  625. /* Non-seqid mutating errors */
  626. return;
  627. };
  628. /*
  629. * Note: no locking needed as we are guaranteed to be first
  630. * on the sequence list
  631. */
  632. seqid->sequence->counter++;
  633. }
  634. void nfs_increment_open_seqid(int status, struct nfs_seqid *seqid)
  635. {
  636. if (status == -NFS4ERR_BAD_SEQID) {
  637. struct nfs4_state_owner *sp = container_of(seqid->sequence,
  638. struct nfs4_state_owner, so_seqid);
  639. nfs4_drop_state_owner(sp);
  640. }
  641. return nfs_increment_seqid(status, seqid);
  642. }
  643. /*
  644. * Increment the seqid if the LOCK/LOCKU succeeded, or
  645. * failed with a seqid incrementing error -
  646. * see comments nfs_fs.h:seqid_mutating_error()
  647. */
  648. void nfs_increment_lock_seqid(int status, struct nfs_seqid *seqid)
  649. {
  650. return nfs_increment_seqid(status, seqid);
  651. }
  652. int nfs_wait_on_sequence(struct nfs_seqid *seqid, struct rpc_task *task)
  653. {
  654. struct rpc_sequence *sequence = seqid->sequence->sequence;
  655. int status = 0;
  656. if (sequence->list.next == &seqid->list)
  657. goto out;
  658. spin_lock(&sequence->lock);
  659. if (!list_empty(&sequence->list)) {
  660. rpc_sleep_on(&sequence->wait, task, NULL, NULL);
  661. status = -EAGAIN;
  662. } else
  663. list_add(&seqid->list, &sequence->list);
  664. spin_unlock(&sequence->lock);
  665. out:
  666. return status;
  667. }
  668. static int reclaimer(void *);
  669. struct reclaimer_args {
  670. struct nfs4_client *clp;
  671. struct completion complete;
  672. };
  673. /*
  674. * State recovery routine
  675. */
  676. void
  677. nfs4_recover_state(void *data)
  678. {
  679. struct nfs4_client *clp = (struct nfs4_client *)data;
  680. struct reclaimer_args args = {
  681. .clp = clp,
  682. };
  683. might_sleep();
  684. init_completion(&args.complete);
  685. if (kernel_thread(reclaimer, &args, CLONE_KERNEL) < 0)
  686. goto out_failed_clear;
  687. wait_for_completion(&args.complete);
  688. return;
  689. out_failed_clear:
  690. set_bit(NFS4CLNT_OK, &clp->cl_state);
  691. wake_up_all(&clp->cl_waitq);
  692. rpc_wake_up(&clp->cl_rpcwaitq);
  693. }
  694. /*
  695. * Schedule a state recovery attempt
  696. */
  697. void
  698. nfs4_schedule_state_recovery(struct nfs4_client *clp)
  699. {
  700. if (!clp)
  701. return;
  702. if (test_and_clear_bit(NFS4CLNT_OK, &clp->cl_state))
  703. schedule_work(&clp->cl_recoverd);
  704. }
  705. static int nfs4_reclaim_locks(struct nfs4_state_recovery_ops *ops, struct nfs4_state *state)
  706. {
  707. struct inode *inode = state->inode;
  708. struct file_lock *fl;
  709. int status = 0;
  710. for (fl = inode->i_flock; fl != 0; fl = fl->fl_next) {
  711. if (!(fl->fl_flags & (FL_POSIX|FL_FLOCK)))
  712. continue;
  713. if (((struct nfs_open_context *)fl->fl_file->private_data)->state != state)
  714. continue;
  715. status = ops->recover_lock(state, fl);
  716. if (status >= 0)
  717. continue;
  718. switch (status) {
  719. default:
  720. printk(KERN_ERR "%s: unhandled error %d. Zeroing state\n",
  721. __FUNCTION__, status);
  722. case -NFS4ERR_EXPIRED:
  723. case -NFS4ERR_NO_GRACE:
  724. case -NFS4ERR_RECLAIM_BAD:
  725. case -NFS4ERR_RECLAIM_CONFLICT:
  726. /* kill_proc(fl->fl_pid, SIGLOST, 1); */
  727. break;
  728. case -NFS4ERR_STALE_CLIENTID:
  729. goto out_err;
  730. }
  731. }
  732. return 0;
  733. out_err:
  734. return status;
  735. }
  736. static int nfs4_reclaim_open_state(struct nfs4_state_recovery_ops *ops, struct nfs4_state_owner *sp)
  737. {
  738. struct nfs4_state *state;
  739. struct nfs4_lock_state *lock;
  740. int status = 0;
  741. /* Note: we rely on the sp->so_states list being ordered
  742. * so that we always reclaim open(O_RDWR) and/or open(O_WRITE)
  743. * states first.
  744. * This is needed to ensure that the server won't give us any
  745. * read delegations that we have to return if, say, we are
  746. * recovering after a network partition or a reboot from a
  747. * server that doesn't support a grace period.
  748. */
  749. list_for_each_entry(state, &sp->so_states, open_states) {
  750. if (state->state == 0)
  751. continue;
  752. status = ops->recover_open(sp, state);
  753. if (status >= 0) {
  754. status = nfs4_reclaim_locks(ops, state);
  755. if (status < 0)
  756. goto out_err;
  757. list_for_each_entry(lock, &state->lock_states, ls_locks) {
  758. if (!(lock->ls_flags & NFS_LOCK_INITIALIZED))
  759. printk("%s: Lock reclaim failed!\n",
  760. __FUNCTION__);
  761. }
  762. continue;
  763. }
  764. switch (status) {
  765. default:
  766. printk(KERN_ERR "%s: unhandled error %d. Zeroing state\n",
  767. __FUNCTION__, status);
  768. case -ENOENT:
  769. case -NFS4ERR_RECLAIM_BAD:
  770. case -NFS4ERR_RECLAIM_CONFLICT:
  771. /*
  772. * Open state on this file cannot be recovered
  773. * All we can do is revert to using the zero stateid.
  774. */
  775. memset(state->stateid.data, 0,
  776. sizeof(state->stateid.data));
  777. /* Mark the file as being 'closed' */
  778. state->state = 0;
  779. break;
  780. case -NFS4ERR_EXPIRED:
  781. case -NFS4ERR_NO_GRACE:
  782. case -NFS4ERR_STALE_CLIENTID:
  783. goto out_err;
  784. }
  785. }
  786. return 0;
  787. out_err:
  788. return status;
  789. }
  790. static void nfs4_state_mark_reclaim(struct nfs4_client *clp)
  791. {
  792. struct nfs4_state_owner *sp;
  793. struct nfs4_state *state;
  794. struct nfs4_lock_state *lock;
  795. /* Reset all sequence ids to zero */
  796. list_for_each_entry(sp, &clp->cl_state_owners, so_list) {
  797. sp->so_seqid.counter = 0;
  798. sp->so_seqid.flags = 0;
  799. spin_lock(&sp->so_lock);
  800. list_for_each_entry(state, &sp->so_states, open_states) {
  801. list_for_each_entry(lock, &state->lock_states, ls_locks) {
  802. lock->ls_seqid.counter = 0;
  803. lock->ls_seqid.flags = 0;
  804. lock->ls_flags &= ~NFS_LOCK_INITIALIZED;
  805. }
  806. }
  807. spin_unlock(&sp->so_lock);
  808. }
  809. }
  810. static int reclaimer(void *ptr)
  811. {
  812. struct reclaimer_args *args = (struct reclaimer_args *)ptr;
  813. struct nfs4_client *clp = args->clp;
  814. struct nfs4_state_owner *sp;
  815. struct nfs4_state_recovery_ops *ops;
  816. int status = 0;
  817. daemonize("%u.%u.%u.%u-reclaim", NIPQUAD(clp->cl_addr));
  818. allow_signal(SIGKILL);
  819. atomic_inc(&clp->cl_count);
  820. complete(&args->complete);
  821. /* Ensure exclusive access to NFSv4 state */
  822. lock_kernel();
  823. down_write(&clp->cl_sem);
  824. /* Are there any NFS mounts out there? */
  825. if (list_empty(&clp->cl_superblocks))
  826. goto out;
  827. restart_loop:
  828. status = nfs4_proc_renew(clp);
  829. switch (status) {
  830. case 0:
  831. case -NFS4ERR_CB_PATH_DOWN:
  832. goto out;
  833. case -NFS4ERR_STALE_CLIENTID:
  834. case -NFS4ERR_LEASE_MOVED:
  835. ops = &nfs4_reboot_recovery_ops;
  836. break;
  837. default:
  838. ops = &nfs4_network_partition_recovery_ops;
  839. };
  840. nfs4_state_mark_reclaim(clp);
  841. status = __nfs4_init_client(clp);
  842. if (status)
  843. goto out_error;
  844. /* Mark all delegations for reclaim */
  845. nfs_delegation_mark_reclaim(clp);
  846. /* Note: list is protected by exclusive lock on cl->cl_sem */
  847. list_for_each_entry(sp, &clp->cl_state_owners, so_list) {
  848. status = nfs4_reclaim_open_state(ops, sp);
  849. if (status < 0) {
  850. if (status == -NFS4ERR_NO_GRACE) {
  851. ops = &nfs4_network_partition_recovery_ops;
  852. status = nfs4_reclaim_open_state(ops, sp);
  853. }
  854. if (status == -NFS4ERR_STALE_CLIENTID)
  855. goto restart_loop;
  856. if (status == -NFS4ERR_EXPIRED)
  857. goto restart_loop;
  858. }
  859. }
  860. nfs_delegation_reap_unclaimed(clp);
  861. out:
  862. set_bit(NFS4CLNT_OK, &clp->cl_state);
  863. up_write(&clp->cl_sem);
  864. unlock_kernel();
  865. wake_up_all(&clp->cl_waitq);
  866. rpc_wake_up(&clp->cl_rpcwaitq);
  867. if (status == -NFS4ERR_CB_PATH_DOWN)
  868. nfs_handle_cb_pathdown(clp);
  869. nfs4_put_client(clp);
  870. return 0;
  871. out_error:
  872. printk(KERN_WARNING "Error: state recovery failed on NFSv4 server %u.%u.%u.%u with error %d\n",
  873. NIPQUAD(clp->cl_addr.s_addr), -status);
  874. goto out;
  875. }
  876. /*
  877. * Local variables:
  878. * c-basic-offset: 8
  879. * End:
  880. */