link.c 9.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342
  1. /*
  2. * fs/cifs/link.c
  3. *
  4. * Copyright (C) International Business Machines Corp., 2002,2003
  5. * Author(s): Steve French (sfrench@us.ibm.com)
  6. *
  7. * This library is free software; you can redistribute it and/or modify
  8. * it under the terms of the GNU Lesser General Public License as published
  9. * by the Free Software Foundation; either version 2.1 of the License, or
  10. * (at your option) any later version.
  11. *
  12. * This library is distributed in the hope that it will be useful,
  13. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  14. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See
  15. * the GNU Lesser General Public License for more details.
  16. *
  17. * You should have received a copy of the GNU Lesser General Public License
  18. * along with this library; if not, write to the Free Software
  19. * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
  20. */
  21. #include <linux/fs.h>
  22. #include <linux/stat.h>
  23. #include <linux/namei.h>
  24. #include "cifsfs.h"
  25. #include "cifspdu.h"
  26. #include "cifsglob.h"
  27. #include "cifsproto.h"
  28. #include "cifs_debug.h"
  29. #include "cifs_fs_sb.h"
  30. int
  31. cifs_hardlink(struct dentry *old_file, struct inode *inode,
  32. struct dentry *direntry)
  33. {
  34. int rc = -EACCES;
  35. int xid;
  36. char *fromName = NULL;
  37. char *toName = NULL;
  38. struct cifs_sb_info *cifs_sb_target;
  39. struct cifsTconInfo *pTcon;
  40. struct cifsInodeInfo *cifsInode;
  41. xid = GetXid();
  42. cifs_sb_target = CIFS_SB(inode->i_sb);
  43. pTcon = cifs_sb_target->tcon;
  44. /* No need to check for cross device links since server will do that
  45. BB note DFS case in future though (when we may have to check) */
  46. fromName = build_path_from_dentry(old_file);
  47. toName = build_path_from_dentry(direntry);
  48. if((fromName == NULL) || (toName == NULL)) {
  49. rc = -ENOMEM;
  50. goto cifs_hl_exit;
  51. }
  52. if (cifs_sb_target->tcon->ses->capabilities & CAP_UNIX)
  53. rc = CIFSUnixCreateHardLink(xid, pTcon, fromName, toName,
  54. cifs_sb_target->local_nls,
  55. cifs_sb_target->mnt_cifs_flags &
  56. CIFS_MOUNT_MAP_SPECIAL_CHR);
  57. else {
  58. rc = CIFSCreateHardLink(xid, pTcon, fromName, toName,
  59. cifs_sb_target->local_nls,
  60. cifs_sb_target->mnt_cifs_flags &
  61. CIFS_MOUNT_MAP_SPECIAL_CHR);
  62. if((rc == -EIO) || (rc == -EINVAL))
  63. rc = -EOPNOTSUPP;
  64. }
  65. d_drop(direntry); /* force new lookup from server of target */
  66. /* if source file is cached (oplocked) revalidate will not go to server
  67. until the file is closed or oplock broken so update nlinks locally */
  68. if(old_file->d_inode) {
  69. cifsInode = CIFS_I(old_file->d_inode);
  70. if(rc == 0) {
  71. old_file->d_inode->i_nlink++;
  72. old_file->d_inode->i_ctime = CURRENT_TIME;
  73. /* parent dir timestamps will update from srv
  74. within a second, would it really be worth it
  75. to set the parent dir cifs inode time to zero
  76. to force revalidate (faster) for it too? */
  77. }
  78. /* if not oplocked will force revalidate to get info
  79. on source file from srv */
  80. cifsInode->time = 0;
  81. /* Will update parent dir timestamps from srv within a second.
  82. Would it really be worth it to set the parent dir (cifs
  83. inode) time field to zero to force revalidate on parent
  84. directory faster ie
  85. CIFS_I(inode)->time = 0; */
  86. }
  87. cifs_hl_exit:
  88. kfree(fromName);
  89. kfree(toName);
  90. FreeXid(xid);
  91. return rc;
  92. }
  93. void *
  94. cifs_follow_link(struct dentry *direntry, struct nameidata *nd)
  95. {
  96. struct inode *inode = direntry->d_inode;
  97. int rc = -EACCES;
  98. int xid;
  99. char *full_path = NULL;
  100. char * target_path = ERR_PTR(-ENOMEM);
  101. struct cifs_sb_info *cifs_sb;
  102. struct cifsTconInfo *pTcon;
  103. xid = GetXid();
  104. full_path = build_path_from_dentry(direntry);
  105. if (!full_path)
  106. goto out_no_free;
  107. cFYI(1, ("Full path: %s inode = 0x%p", full_path, inode));
  108. cifs_sb = CIFS_SB(inode->i_sb);
  109. pTcon = cifs_sb->tcon;
  110. target_path = kmalloc(PATH_MAX, GFP_KERNEL);
  111. if (!target_path) {
  112. target_path = ERR_PTR(-ENOMEM);
  113. goto out;
  114. }
  115. /* BB add read reparse point symlink code and Unix extensions symlink code here BB */
  116. if (pTcon->ses->capabilities & CAP_UNIX)
  117. rc = CIFSSMBUnixQuerySymLink(xid, pTcon, full_path,
  118. target_path,
  119. PATH_MAX-1,
  120. cifs_sb->local_nls);
  121. else {
  122. /* rc = CIFSSMBQueryReparseLinkInfo */
  123. /* BB Add code to Query ReparsePoint info */
  124. /* BB Add MAC style xsymlink check here if enabled */
  125. }
  126. if (rc == 0) {
  127. /* BB Add special case check for Samba DFS symlinks */
  128. target_path[PATH_MAX-1] = 0;
  129. } else {
  130. kfree(target_path);
  131. target_path = ERR_PTR(rc);
  132. }
  133. out:
  134. kfree(full_path);
  135. out_no_free:
  136. FreeXid(xid);
  137. nd_set_link(nd, target_path);
  138. return NULL; /* No cookie */
  139. }
  140. int
  141. cifs_symlink(struct inode *inode, struct dentry *direntry, const char *symname)
  142. {
  143. int rc = -EOPNOTSUPP;
  144. int xid;
  145. struct cifs_sb_info *cifs_sb;
  146. struct cifsTconInfo *pTcon;
  147. char *full_path = NULL;
  148. struct inode *newinode = NULL;
  149. xid = GetXid();
  150. cifs_sb = CIFS_SB(inode->i_sb);
  151. pTcon = cifs_sb->tcon;
  152. full_path = build_path_from_dentry(direntry);
  153. if(full_path == NULL) {
  154. FreeXid(xid);
  155. return -ENOMEM;
  156. }
  157. cFYI(1, ("Full path: %s", full_path));
  158. cFYI(1, ("symname is %s", symname));
  159. /* BB what if DFS and this volume is on different share? BB */
  160. if (cifs_sb->tcon->ses->capabilities & CAP_UNIX)
  161. rc = CIFSUnixCreateSymLink(xid, pTcon, full_path, symname,
  162. cifs_sb->local_nls);
  163. /* else
  164. rc = CIFSCreateReparseSymLink(xid, pTcon, fromName, toName,cifs_sb_target->local_nls); */
  165. if (rc == 0) {
  166. if (pTcon->ses->capabilities & CAP_UNIX)
  167. rc = cifs_get_inode_info_unix(&newinode, full_path,
  168. inode->i_sb,xid);
  169. else
  170. rc = cifs_get_inode_info(&newinode, full_path, NULL,
  171. inode->i_sb,xid);
  172. if (rc != 0) {
  173. cFYI(1, ("Create symlink ok, getinodeinfo fail rc = %d",
  174. rc));
  175. } else {
  176. if (pTcon->nocase)
  177. direntry->d_op = &cifs_ci_dentry_ops;
  178. else
  179. direntry->d_op = &cifs_dentry_ops;
  180. d_instantiate(direntry, newinode);
  181. }
  182. }
  183. kfree(full_path);
  184. FreeXid(xid);
  185. return rc;
  186. }
  187. int
  188. cifs_readlink(struct dentry *direntry, char __user *pBuffer, int buflen)
  189. {
  190. struct inode *inode = direntry->d_inode;
  191. int rc = -EACCES;
  192. int xid;
  193. int oplock = FALSE;
  194. struct cifs_sb_info *cifs_sb;
  195. struct cifsTconInfo *pTcon;
  196. char *full_path = NULL;
  197. char *tmp_path = NULL;
  198. char * tmpbuffer;
  199. unsigned char * referrals = NULL;
  200. int num_referrals = 0;
  201. int len;
  202. __u16 fid;
  203. xid = GetXid();
  204. cifs_sb = CIFS_SB(inode->i_sb);
  205. pTcon = cifs_sb->tcon;
  206. /* BB would it be safe against deadlock to grab this sem
  207. even though rename itself grabs the sem and calls lookup? */
  208. /* mutex_lock(&inode->i_sb->s_vfs_rename_mutex);*/
  209. full_path = build_path_from_dentry(direntry);
  210. /* mutex_unlock(&inode->i_sb->s_vfs_rename_mutex);*/
  211. if(full_path == NULL) {
  212. FreeXid(xid);
  213. return -ENOMEM;
  214. }
  215. cFYI(1,
  216. ("Full path: %s inode = 0x%p pBuffer = 0x%p buflen = %d",
  217. full_path, inode, pBuffer, buflen));
  218. if(buflen > PATH_MAX)
  219. len = PATH_MAX;
  220. else
  221. len = buflen;
  222. tmpbuffer = kmalloc(len,GFP_KERNEL);
  223. if(tmpbuffer == NULL) {
  224. kfree(full_path);
  225. FreeXid(xid);
  226. return -ENOMEM;
  227. }
  228. /* BB add read reparse point symlink code and Unix extensions symlink code here BB */
  229. if (cifs_sb->tcon->ses->capabilities & CAP_UNIX)
  230. rc = CIFSSMBUnixQuerySymLink(xid, pTcon, full_path,
  231. tmpbuffer,
  232. len - 1,
  233. cifs_sb->local_nls);
  234. else if (cifs_sb->mnt_cifs_flags & CIFS_MOUNT_UNX_EMUL) {
  235. cERROR(1,("SFU style symlinks not implemented yet"));
  236. /* add open and read as in fs/cifs/inode.c */
  237. } else {
  238. rc = CIFSSMBOpen(xid, pTcon, full_path, FILE_OPEN, GENERIC_READ,
  239. OPEN_REPARSE_POINT,&fid, &oplock, NULL,
  240. cifs_sb->local_nls,
  241. cifs_sb->mnt_cifs_flags &
  242. CIFS_MOUNT_MAP_SPECIAL_CHR);
  243. if(!rc) {
  244. rc = CIFSSMBQueryReparseLinkInfo(xid, pTcon, full_path,
  245. tmpbuffer,
  246. len - 1,
  247. fid,
  248. cifs_sb->local_nls);
  249. if(CIFSSMBClose(xid, pTcon, fid)) {
  250. cFYI(1,("Error closing junction point (open for ioctl)"));
  251. }
  252. if(rc == -EIO) {
  253. /* Query if DFS Junction */
  254. tmp_path =
  255. kmalloc(MAX_TREE_SIZE + MAX_PATHCONF + 1,
  256. GFP_KERNEL);
  257. if (tmp_path) {
  258. strncpy(tmp_path, pTcon->treeName, MAX_TREE_SIZE);
  259. strncat(tmp_path, full_path, MAX_PATHCONF);
  260. rc = get_dfs_path(xid, pTcon->ses, tmp_path,
  261. cifs_sb->local_nls,
  262. &num_referrals, &referrals,
  263. cifs_sb->mnt_cifs_flags &
  264. CIFS_MOUNT_MAP_SPECIAL_CHR);
  265. cFYI(1,("Get DFS for %s rc = %d ",tmp_path, rc));
  266. if((num_referrals == 0) && (rc == 0))
  267. rc = -EACCES;
  268. else {
  269. cFYI(1,("num referral: %d",num_referrals));
  270. if(referrals) {
  271. cFYI(1,("referral string: %s",referrals));
  272. strncpy(tmpbuffer, referrals, len-1);
  273. }
  274. }
  275. kfree(referrals);
  276. kfree(tmp_path);
  277. }
  278. /* BB add code like else decode referrals then memcpy to
  279. tmpbuffer and free referrals string array BB */
  280. }
  281. }
  282. }
  283. /* BB Anything else to do to handle recursive links? */
  284. /* BB Should we be using page ops here? */
  285. /* BB null terminate returned string in pBuffer? BB */
  286. if (rc == 0) {
  287. rc = vfs_readlink(direntry, pBuffer, len, tmpbuffer);
  288. cFYI(1,
  289. ("vfs_readlink called from cifs_readlink returned %d",
  290. rc));
  291. }
  292. kfree(tmpbuffer);
  293. kfree(full_path);
  294. FreeXid(xid);
  295. return rc;
  296. }
  297. void cifs_put_link(struct dentry *direntry, struct nameidata *nd, void *cookie)
  298. {
  299. char *p = nd_get_link(nd);
  300. if (!IS_ERR(p))
  301. kfree(p);
  302. }