vnode.c 9.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380
  1. /* AFS vnode management
  2. *
  3. * Copyright (C) 2002, 2007 Red Hat, Inc. All Rights Reserved.
  4. * Written by David Howells (dhowells@redhat.com)
  5. *
  6. * This program is free software; you can redistribute it and/or
  7. * modify it under the terms of the GNU General Public License
  8. * as published by the Free Software Foundation; either version
  9. * 2 of the License, or (at your option) any later version.
  10. */
  11. #include <linux/kernel.h>
  12. #include <linux/module.h>
  13. #include <linux/init.h>
  14. #include <linux/slab.h>
  15. #include <linux/fs.h>
  16. #include "internal.h"
  17. #if 0
  18. static noinline bool dump_tree_aux(struct rb_node *node, struct rb_node *parent,
  19. int depth, char lr)
  20. {
  21. struct afs_vnode *vnode;
  22. bool bad = false;
  23. if (!node)
  24. return false;
  25. if (node->rb_left)
  26. bad = dump_tree_aux(node->rb_left, node, depth + 2, '/');
  27. vnode = rb_entry(node, struct afs_vnode, cb_promise);
  28. kdebug("%c %*.*s%c%p {%d}",
  29. rb_is_red(node) ? 'R' : 'B',
  30. depth, depth, "", lr,
  31. vnode, vnode->cb_expires_at);
  32. if (rb_parent(node) != parent) {
  33. printk("BAD: %p != %p\n", rb_parent(node), parent);
  34. bad = true;
  35. }
  36. if (node->rb_right)
  37. bad |= dump_tree_aux(node->rb_right, node, depth + 2, '\\');
  38. return bad;
  39. }
  40. static noinline void dump_tree(const char *name, struct afs_server *server)
  41. {
  42. kenter("%s", name);
  43. if (dump_tree_aux(server->cb_promises.rb_node, NULL, 0, '-'))
  44. BUG();
  45. }
  46. #endif
  47. /*
  48. * insert a vnode into the backing server's vnode tree
  49. */
  50. static void afs_install_vnode(struct afs_vnode *vnode,
  51. struct afs_server *server)
  52. {
  53. struct afs_server *old_server = vnode->server;
  54. struct afs_vnode *xvnode;
  55. struct rb_node *parent, **p;
  56. _enter("%p,%p", vnode, server);
  57. if (old_server) {
  58. spin_lock(&old_server->fs_lock);
  59. rb_erase(&vnode->server_rb, &old_server->fs_vnodes);
  60. spin_unlock(&old_server->fs_lock);
  61. }
  62. afs_get_server(server);
  63. vnode->server = server;
  64. afs_put_server(old_server);
  65. /* insert into the server's vnode tree in FID order */
  66. spin_lock(&server->fs_lock);
  67. parent = NULL;
  68. p = &server->fs_vnodes.rb_node;
  69. while (*p) {
  70. parent = *p;
  71. xvnode = rb_entry(parent, struct afs_vnode, server_rb);
  72. if (vnode->fid.vid < xvnode->fid.vid)
  73. p = &(*p)->rb_left;
  74. else if (vnode->fid.vid > xvnode->fid.vid)
  75. p = &(*p)->rb_right;
  76. else if (vnode->fid.vnode < xvnode->fid.vnode)
  77. p = &(*p)->rb_left;
  78. else if (vnode->fid.vnode > xvnode->fid.vnode)
  79. p = &(*p)->rb_right;
  80. else if (vnode->fid.unique < xvnode->fid.unique)
  81. p = &(*p)->rb_left;
  82. else if (vnode->fid.unique > xvnode->fid.unique)
  83. p = &(*p)->rb_right;
  84. else
  85. BUG(); /* can't happen unless afs_iget() malfunctions */
  86. }
  87. rb_link_node(&vnode->server_rb, parent, p);
  88. rb_insert_color(&vnode->server_rb, &server->fs_vnodes);
  89. spin_unlock(&server->fs_lock);
  90. _leave("");
  91. }
  92. /*
  93. * insert a vnode into the promising server's update/expiration tree
  94. * - caller must hold vnode->lock
  95. */
  96. static void afs_vnode_note_promise(struct afs_vnode *vnode,
  97. struct afs_server *server)
  98. {
  99. struct afs_server *old_server;
  100. struct afs_vnode *xvnode;
  101. struct rb_node *parent, **p;
  102. _enter("%p,%p", vnode, server);
  103. ASSERT(server != NULL);
  104. old_server = vnode->server;
  105. if (vnode->cb_promised) {
  106. if (server == old_server &&
  107. vnode->cb_expires == vnode->cb_expires_at) {
  108. _leave(" [no change]");
  109. return;
  110. }
  111. spin_lock(&old_server->cb_lock);
  112. if (vnode->cb_promised) {
  113. _debug("delete");
  114. rb_erase(&vnode->cb_promise, &old_server->cb_promises);
  115. vnode->cb_promised = false;
  116. }
  117. spin_unlock(&old_server->cb_lock);
  118. }
  119. if (vnode->server != server)
  120. afs_install_vnode(vnode, server);
  121. vnode->cb_expires_at = vnode->cb_expires;
  122. _debug("PROMISE on %p {%lu}",
  123. vnode, (unsigned long) vnode->cb_expires_at);
  124. /* abuse an RB-tree to hold the expiration order (we may have multiple
  125. * items with the same expiration time) */
  126. spin_lock(&server->cb_lock);
  127. parent = NULL;
  128. p = &server->cb_promises.rb_node;
  129. while (*p) {
  130. parent = *p;
  131. xvnode = rb_entry(parent, struct afs_vnode, cb_promise);
  132. if (vnode->cb_expires_at < xvnode->cb_expires_at)
  133. p = &(*p)->rb_left;
  134. else
  135. p = &(*p)->rb_right;
  136. }
  137. rb_link_node(&vnode->cb_promise, parent, p);
  138. rb_insert_color(&vnode->cb_promise, &server->cb_promises);
  139. vnode->cb_promised = true;
  140. spin_unlock(&server->cb_lock);
  141. _leave("");
  142. }
  143. /*
  144. * handle remote file deletion by discarding the callback promise
  145. */
  146. static void afs_vnode_deleted_remotely(struct afs_vnode *vnode)
  147. {
  148. struct afs_server *server;
  149. set_bit(AFS_VNODE_DELETED, &vnode->flags);
  150. server = vnode->server;
  151. if (vnode->cb_promised) {
  152. spin_lock(&server->cb_lock);
  153. if (vnode->cb_promised) {
  154. rb_erase(&vnode->cb_promise, &server->cb_promises);
  155. vnode->cb_promised = false;
  156. }
  157. spin_unlock(&server->cb_lock);
  158. }
  159. afs_put_server(server);
  160. }
  161. /*
  162. * finish off updating the recorded status of a file
  163. * - starts callback expiry timer
  164. * - adds to server's callback list
  165. */
  166. static void afs_vnode_finalise_status_update(struct afs_vnode *vnode,
  167. struct afs_server *server,
  168. int ret)
  169. {
  170. struct afs_server *oldserver = NULL;
  171. _enter("%p,%p,%d", vnode, server, ret);
  172. spin_lock(&vnode->lock);
  173. clear_bit(AFS_VNODE_CB_BROKEN, &vnode->flags);
  174. switch (ret) {
  175. case 0:
  176. afs_vnode_note_promise(vnode, server);
  177. break;
  178. case -ENOENT:
  179. /* the file was deleted on the server */
  180. _debug("got NOENT from server - marking file deleted");
  181. afs_vnode_deleted_remotely(vnode);
  182. break;
  183. default:
  184. break;
  185. }
  186. vnode->update_cnt--;
  187. spin_unlock(&vnode->lock);
  188. wake_up_all(&vnode->update_waitq);
  189. afs_put_server(oldserver);
  190. _leave("");
  191. }
  192. /*
  193. * fetch file status from the volume
  194. * - don't issue a fetch if:
  195. * - the changed bit is not set and there's a valid callback
  196. * - there are any outstanding ops that will fetch the status
  197. * - TODO implement local caching
  198. */
  199. int afs_vnode_fetch_status(struct afs_vnode *vnode)
  200. {
  201. struct afs_server *server;
  202. int ret;
  203. DECLARE_WAITQUEUE(myself, current);
  204. _enter("%s,{%u,%u,%u}",
  205. vnode->volume->vlocation->vldb.name,
  206. vnode->fid.vid, vnode->fid.vnode, vnode->fid.unique);
  207. if (!test_bit(AFS_VNODE_CB_BROKEN, &vnode->flags) &&
  208. vnode->cb_promised) {
  209. _leave(" [unchanged]");
  210. return 0;
  211. }
  212. if (test_bit(AFS_VNODE_DELETED, &vnode->flags)) {
  213. _leave(" [deleted]");
  214. return -ENOENT;
  215. }
  216. spin_lock(&vnode->lock);
  217. if (!test_bit(AFS_VNODE_CB_BROKEN, &vnode->flags) &&
  218. vnode->cb_promised) {
  219. spin_unlock(&vnode->lock);
  220. _leave(" [unchanged]");
  221. return 0;
  222. }
  223. if (vnode->update_cnt > 0) {
  224. /* someone else started a fetch */
  225. set_current_state(TASK_UNINTERRUPTIBLE);
  226. ASSERT(myself.func != NULL);
  227. add_wait_queue(&vnode->update_waitq, &myself);
  228. /* wait for the status to be updated */
  229. for (;;) {
  230. if (!test_bit(AFS_VNODE_CB_BROKEN, &vnode->flags))
  231. break;
  232. if (test_bit(AFS_VNODE_DELETED, &vnode->flags))
  233. break;
  234. /* check to see if it got updated and invalidated all
  235. * before we saw it */
  236. if (vnode->update_cnt == 0) {
  237. remove_wait_queue(&vnode->update_waitq,
  238. &myself);
  239. set_current_state(TASK_RUNNING);
  240. goto get_anyway;
  241. }
  242. spin_unlock(&vnode->lock);
  243. schedule();
  244. set_current_state(TASK_UNINTERRUPTIBLE);
  245. spin_lock(&vnode->lock);
  246. }
  247. remove_wait_queue(&vnode->update_waitq, &myself);
  248. spin_unlock(&vnode->lock);
  249. set_current_state(TASK_RUNNING);
  250. return test_bit(AFS_VNODE_DELETED, &vnode->flags) ?
  251. -ENOENT : 0;
  252. }
  253. get_anyway:
  254. /* okay... we're going to have to initiate the op */
  255. vnode->update_cnt++;
  256. spin_unlock(&vnode->lock);
  257. /* merge AFS status fetches and clear outstanding callback on this
  258. * vnode */
  259. do {
  260. /* pick a server to query */
  261. server = afs_volume_pick_fileserver(vnode);
  262. if (IS_ERR(server))
  263. return PTR_ERR(server);
  264. _debug("USING SERVER: %p{%08x}",
  265. server, ntohl(server->addr.s_addr));
  266. ret = afs_fs_fetch_file_status(server, vnode, NULL,
  267. &afs_sync_call);
  268. } while (!afs_volume_release_fileserver(vnode, server, ret));
  269. /* adjust the flags */
  270. afs_vnode_finalise_status_update(vnode, server, ret);
  271. _leave(" = %d", ret);
  272. return ret;
  273. }
  274. /*
  275. * fetch file data from the volume
  276. * - TODO implement caching and server failover
  277. */
  278. int afs_vnode_fetch_data(struct afs_vnode *vnode, off_t offset, size_t length,
  279. struct page *page)
  280. {
  281. struct afs_server *server;
  282. int ret;
  283. _enter("%s,{%u,%u,%u}",
  284. vnode->volume->vlocation->vldb.name,
  285. vnode->fid.vid,
  286. vnode->fid.vnode,
  287. vnode->fid.unique);
  288. /* this op will fetch the status */
  289. spin_lock(&vnode->lock);
  290. vnode->update_cnt++;
  291. spin_unlock(&vnode->lock);
  292. /* merge in AFS status fetches and clear outstanding callback on this
  293. * vnode */
  294. do {
  295. /* pick a server to query */
  296. server = afs_volume_pick_fileserver(vnode);
  297. if (IS_ERR(server))
  298. return PTR_ERR(server);
  299. _debug("USING SERVER: %08x\n", ntohl(server->addr.s_addr));
  300. ret = afs_fs_fetch_data(server, vnode, offset, length, page,
  301. NULL, &afs_sync_call);
  302. } while (!afs_volume_release_fileserver(vnode, server, ret));
  303. /* adjust the flags */
  304. afs_vnode_finalise_status_update(vnode, server, ret);
  305. _leave(" = %d", ret);
  306. return ret;
  307. }