svcsubs.c 7.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335
  1. /*
  2. * linux/fs/lockd/svcsubs.c
  3. *
  4. * Various support routines for the NLM server.
  5. *
  6. * Copyright (C) 1996, Olaf Kirch <okir@monad.swb.de>
  7. */
  8. #include <linux/types.h>
  9. #include <linux/string.h>
  10. #include <linux/time.h>
  11. #include <linux/in.h>
  12. #include <linux/mutex.h>
  13. #include <linux/sunrpc/svc.h>
  14. #include <linux/sunrpc/clnt.h>
  15. #include <linux/nfsd/nfsfh.h>
  16. #include <linux/nfsd/export.h>
  17. #include <linux/lockd/lockd.h>
  18. #include <linux/lockd/share.h>
  19. #include <linux/lockd/sm_inter.h>
  20. #define NLMDBG_FACILITY NLMDBG_SVCSUBS
  21. /*
  22. * Global file hash table
  23. */
  24. #define FILE_HASH_BITS 5
  25. #define FILE_NRHASH (1<<FILE_HASH_BITS)
  26. static struct nlm_file * nlm_files[FILE_NRHASH];
  27. static DEFINE_MUTEX(nlm_file_mutex);
  28. #ifdef NFSD_DEBUG
  29. static inline void nlm_debug_print_fh(char *msg, struct nfs_fh *f)
  30. {
  31. u32 *fhp = (u32*)f->data;
  32. /* print the first 32 bytes of the fh */
  33. dprintk("lockd: %s (%08x %08x %08x %08x %08x %08x %08x %08x)\n",
  34. msg, fhp[0], fhp[1], fhp[2], fhp[3],
  35. fhp[4], fhp[5], fhp[6], fhp[7]);
  36. }
  37. static inline void nlm_debug_print_file(char *msg, struct nlm_file *file)
  38. {
  39. struct inode *inode = file->f_file->f_dentry->d_inode;
  40. dprintk("lockd: %s %s/%ld\n",
  41. msg, inode->i_sb->s_id, inode->i_ino);
  42. }
  43. #else
  44. static inline void nlm_debug_print_fh(char *msg, struct nfs_fh *f)
  45. {
  46. return;
  47. }
  48. static inline void nlm_debug_print_file(char *msg, struct nlm_file *file)
  49. {
  50. return;
  51. }
  52. #endif
  53. static inline unsigned int file_hash(struct nfs_fh *f)
  54. {
  55. unsigned int tmp=0;
  56. int i;
  57. for (i=0; i<NFS2_FHSIZE;i++)
  58. tmp += f->data[i];
  59. return tmp & (FILE_NRHASH - 1);
  60. }
  61. /*
  62. * Lookup file info. If it doesn't exist, create a file info struct
  63. * and open a (VFS) file for the given inode.
  64. *
  65. * FIXME:
  66. * Note that we open the file O_RDONLY even when creating write locks.
  67. * This is not quite right, but for now, we assume the client performs
  68. * the proper R/W checking.
  69. */
  70. u32
  71. nlm_lookup_file(struct svc_rqst *rqstp, struct nlm_file **result,
  72. struct nfs_fh *f)
  73. {
  74. struct nlm_file *file;
  75. unsigned int hash;
  76. u32 nfserr;
  77. nlm_debug_print_fh("nlm_file_lookup", f);
  78. hash = file_hash(f);
  79. /* Lock file table */
  80. mutex_lock(&nlm_file_mutex);
  81. for (file = nlm_files[hash]; file; file = file->f_next)
  82. if (!nfs_compare_fh(&file->f_handle, f))
  83. goto found;
  84. nlm_debug_print_fh("creating file for", f);
  85. nfserr = nlm_lck_denied_nolocks;
  86. file = kzalloc(sizeof(*file), GFP_KERNEL);
  87. if (!file)
  88. goto out_unlock;
  89. memcpy(&file->f_handle, f, sizeof(struct nfs_fh));
  90. file->f_hash = hash;
  91. init_MUTEX(&file->f_sema);
  92. /* Open the file. Note that this must not sleep for too long, else
  93. * we would lock up lockd:-) So no NFS re-exports, folks.
  94. *
  95. * We have to make sure we have the right credential to open
  96. * the file.
  97. */
  98. if ((nfserr = nlmsvc_ops->fopen(rqstp, f, &file->f_file)) != 0) {
  99. dprintk("lockd: open failed (nfserr %d)\n", ntohl(nfserr));
  100. goto out_free;
  101. }
  102. file->f_next = nlm_files[hash];
  103. nlm_files[hash] = file;
  104. found:
  105. dprintk("lockd: found file %p (count %d)\n", file, file->f_count);
  106. *result = file;
  107. file->f_count++;
  108. nfserr = 0;
  109. out_unlock:
  110. mutex_unlock(&nlm_file_mutex);
  111. return nfserr;
  112. out_free:
  113. kfree(file);
  114. #ifdef CONFIG_LOCKD_V4
  115. if (nfserr == 1)
  116. nfserr = nlm4_stale_fh;
  117. else
  118. #endif
  119. nfserr = nlm_lck_denied;
  120. goto out_unlock;
  121. }
  122. /*
  123. * Delete a file after having released all locks, blocks and shares
  124. */
  125. static inline void
  126. nlm_delete_file(struct nlm_file *file)
  127. {
  128. struct nlm_file **fp, *f;
  129. nlm_debug_print_file("closing file", file);
  130. fp = nlm_files + file->f_hash;
  131. while ((f = *fp) != NULL) {
  132. if (f == file) {
  133. *fp = file->f_next;
  134. nlmsvc_ops->fclose(file->f_file);
  135. kfree(file);
  136. return;
  137. }
  138. fp = &f->f_next;
  139. }
  140. printk(KERN_WARNING "lockd: attempt to release unknown file!\n");
  141. }
  142. /*
  143. * Loop over all locks on the given file and perform the specified
  144. * action.
  145. */
  146. static int
  147. nlm_traverse_locks(struct nlm_host *host, struct nlm_file *file, int action)
  148. {
  149. struct inode *inode = nlmsvc_file_inode(file);
  150. struct file_lock *fl;
  151. struct nlm_host *lockhost;
  152. again:
  153. file->f_locks = 0;
  154. for (fl = inode->i_flock; fl; fl = fl->fl_next) {
  155. if (fl->fl_lmops != &nlmsvc_lock_operations)
  156. continue;
  157. /* update current lock count */
  158. file->f_locks++;
  159. lockhost = (struct nlm_host *) fl->fl_owner;
  160. if (action == NLM_ACT_MARK)
  161. lockhost->h_inuse = 1;
  162. else if (action == NLM_ACT_CHECK)
  163. return 1;
  164. else if (action == NLM_ACT_UNLOCK) {
  165. struct file_lock lock = *fl;
  166. if (host && lockhost != host)
  167. continue;
  168. lock.fl_type = F_UNLCK;
  169. lock.fl_start = 0;
  170. lock.fl_end = OFFSET_MAX;
  171. if (posix_lock_file(file->f_file, &lock) < 0) {
  172. printk("lockd: unlock failure in %s:%d\n",
  173. __FILE__, __LINE__);
  174. return 1;
  175. }
  176. goto again;
  177. }
  178. }
  179. return 0;
  180. }
  181. /*
  182. * Operate on a single file
  183. */
  184. static inline int
  185. nlm_inspect_file(struct nlm_host *host, struct nlm_file *file, int action)
  186. {
  187. if (action == NLM_ACT_CHECK) {
  188. /* Fast path for mark and sweep garbage collection */
  189. if (file->f_count || file->f_blocks || file->f_shares)
  190. return 1;
  191. } else {
  192. nlmsvc_traverse_blocks(host, file, action);
  193. nlmsvc_traverse_shares(host, file, action);
  194. }
  195. return nlm_traverse_locks(host, file, action);
  196. }
  197. /*
  198. * Loop over all files in the file table.
  199. */
  200. static int
  201. nlm_traverse_files(struct nlm_host *host, int action)
  202. {
  203. struct nlm_file *file, **fp;
  204. int i, ret = 0;
  205. mutex_lock(&nlm_file_mutex);
  206. for (i = 0; i < FILE_NRHASH; i++) {
  207. fp = nlm_files + i;
  208. while ((file = *fp) != NULL) {
  209. file->f_count++;
  210. mutex_unlock(&nlm_file_mutex);
  211. /* Traverse locks, blocks and shares of this file
  212. * and update file->f_locks count */
  213. if (nlm_inspect_file(host, file, action))
  214. ret = 1;
  215. mutex_lock(&nlm_file_mutex);
  216. file->f_count--;
  217. /* No more references to this file. Let go of it. */
  218. if (!file->f_blocks && !file->f_locks
  219. && !file->f_shares && !file->f_count) {
  220. *fp = file->f_next;
  221. nlmsvc_ops->fclose(file->f_file);
  222. kfree(file);
  223. } else {
  224. fp = &file->f_next;
  225. }
  226. }
  227. }
  228. mutex_unlock(&nlm_file_mutex);
  229. return ret;
  230. }
  231. /*
  232. * Release file. If there are no more remote locks on this file,
  233. * close it and free the handle.
  234. *
  235. * Note that we can't do proper reference counting without major
  236. * contortions because the code in fs/locks.c creates, deletes and
  237. * splits locks without notification. Our only way is to walk the
  238. * entire lock list each time we remove a lock.
  239. */
  240. void
  241. nlm_release_file(struct nlm_file *file)
  242. {
  243. dprintk("lockd: nlm_release_file(%p, ct = %d)\n",
  244. file, file->f_count);
  245. /* Lock file table */
  246. mutex_lock(&nlm_file_mutex);
  247. /* If there are no more locks etc, delete the file */
  248. if(--file->f_count == 0) {
  249. if(!nlm_inspect_file(NULL, file, NLM_ACT_CHECK))
  250. nlm_delete_file(file);
  251. }
  252. mutex_unlock(&nlm_file_mutex);
  253. }
  254. /*
  255. * Mark all hosts that still hold resources
  256. */
  257. void
  258. nlmsvc_mark_resources(void)
  259. {
  260. dprintk("lockd: nlmsvc_mark_resources\n");
  261. nlm_traverse_files(NULL, NLM_ACT_MARK);
  262. }
  263. /*
  264. * Release all resources held by the given client
  265. */
  266. void
  267. nlmsvc_free_host_resources(struct nlm_host *host)
  268. {
  269. dprintk("lockd: nlmsvc_free_host_resources\n");
  270. if (nlm_traverse_files(host, NLM_ACT_UNLOCK))
  271. printk(KERN_WARNING
  272. "lockd: couldn't remove all locks held by %s",
  273. host->h_name);
  274. }
  275. /*
  276. * delete all hosts structs for clients
  277. */
  278. void
  279. nlmsvc_invalidate_all(void)
  280. {
  281. struct nlm_host *host;
  282. while ((host = nlm_find_client()) != NULL) {
  283. nlmsvc_free_host_resources(host);
  284. host->h_expires = 0;
  285. host->h_killed = 1;
  286. nlm_release_host(host);
  287. }
  288. }