link.c 8.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338
  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. down(&inode->i_sb->s_vfs_rename_sem);
  47. fromName = build_path_from_dentry(old_file);
  48. toName = build_path_from_dentry(direntry);
  49. up(&inode->i_sb->s_vfs_rename_sem);
  50. if((fromName == NULL) || (toName == NULL)) {
  51. rc = -ENOMEM;
  52. goto cifs_hl_exit;
  53. }
  54. if (cifs_sb_target->tcon->ses->capabilities & CAP_UNIX)
  55. rc = CIFSUnixCreateHardLink(xid, pTcon, fromName, toName,
  56. cifs_sb_target->local_nls,
  57. cifs_sb_target->mnt_cifs_flags &
  58. CIFS_MOUNT_MAP_SPECIAL_CHR);
  59. else {
  60. rc = CIFSCreateHardLink(xid, pTcon, fromName, toName,
  61. cifs_sb_target->local_nls,
  62. cifs_sb_target->mnt_cifs_flags &
  63. CIFS_MOUNT_MAP_SPECIAL_CHR);
  64. if(rc == -EIO)
  65. rc = -EOPNOTSUPP;
  66. }
  67. /* if (!rc) */
  68. {
  69. /* renew_parental_timestamps(old_file);
  70. inode->i_nlink++;
  71. mark_inode_dirty(inode);
  72. d_instantiate(direntry, inode); */
  73. /* BB add call to either mark inode dirty or refresh its data and timestamp to current time */
  74. }
  75. d_drop(direntry); /* force new lookup from server */
  76. cifsInode = CIFS_I(old_file->d_inode);
  77. cifsInode->time = 0; /* will force revalidate to go get info when needed */
  78. cifs_hl_exit:
  79. if (fromName)
  80. kfree(fromName);
  81. if (toName)
  82. kfree(toName);
  83. FreeXid(xid);
  84. return rc;
  85. }
  86. void *
  87. cifs_follow_link(struct dentry *direntry, struct nameidata *nd)
  88. {
  89. struct inode *inode = direntry->d_inode;
  90. int rc = -EACCES;
  91. int xid;
  92. char *full_path = NULL;
  93. char * target_path = ERR_PTR(-ENOMEM);
  94. struct cifs_sb_info *cifs_sb;
  95. struct cifsTconInfo *pTcon;
  96. xid = GetXid();
  97. down(&direntry->d_sb->s_vfs_rename_sem);
  98. full_path = build_path_from_dentry(direntry);
  99. up(&direntry->d_sb->s_vfs_rename_sem);
  100. if (!full_path)
  101. goto out_no_free;
  102. cFYI(1, ("Full path: %s inode = 0x%p", full_path, inode));
  103. cifs_sb = CIFS_SB(inode->i_sb);
  104. pTcon = cifs_sb->tcon;
  105. target_path = kmalloc(PATH_MAX, GFP_KERNEL);
  106. if (!target_path) {
  107. target_path = ERR_PTR(-ENOMEM);
  108. goto out;
  109. }
  110. /* BB add read reparse point symlink code and Unix extensions symlink code here BB */
  111. if (pTcon->ses->capabilities & CAP_UNIX)
  112. rc = CIFSSMBUnixQuerySymLink(xid, pTcon, full_path,
  113. target_path,
  114. PATH_MAX-1,
  115. cifs_sb->local_nls);
  116. else {
  117. /* rc = CIFSSMBQueryReparseLinkInfo */
  118. /* BB Add code to Query ReparsePoint info */
  119. /* BB Add MAC style xsymlink check here if enabled */
  120. }
  121. if (rc == 0) {
  122. /* BB Add special case check for Samba DFS symlinks */
  123. target_path[PATH_MAX-1] = 0;
  124. } else {
  125. kfree(target_path);
  126. target_path = ERR_PTR(rc);
  127. }
  128. out:
  129. kfree(full_path);
  130. out_no_free:
  131. FreeXid(xid);
  132. nd_set_link(nd, target_path);
  133. return NULL; /* No cookie */
  134. }
  135. int
  136. cifs_symlink(struct inode *inode, struct dentry *direntry, const char *symname)
  137. {
  138. int rc = -EOPNOTSUPP;
  139. int xid;
  140. struct cifs_sb_info *cifs_sb;
  141. struct cifsTconInfo *pTcon;
  142. char *full_path = NULL;
  143. struct inode *newinode = NULL;
  144. xid = GetXid();
  145. cifs_sb = CIFS_SB(inode->i_sb);
  146. pTcon = cifs_sb->tcon;
  147. down(&inode->i_sb->s_vfs_rename_sem);
  148. full_path = build_path_from_dentry(direntry);
  149. up(&inode->i_sb->s_vfs_rename_sem);
  150. if(full_path == NULL) {
  151. FreeXid(xid);
  152. return -ENOMEM;
  153. }
  154. cFYI(1, ("Full path: %s ", full_path));
  155. cFYI(1, ("symname is %s", symname));
  156. /* BB what if DFS and this volume is on different share? BB */
  157. if (cifs_sb->tcon->ses->capabilities & CAP_UNIX)
  158. rc = CIFSUnixCreateSymLink(xid, pTcon, full_path, symname,
  159. cifs_sb->local_nls);
  160. /* else
  161. rc = CIFSCreateReparseSymLink(xid, pTcon, fromName, toName,cifs_sb_target->local_nls); */
  162. if (rc == 0) {
  163. if (pTcon->ses->capabilities & CAP_UNIX)
  164. rc = cifs_get_inode_info_unix(&newinode, full_path,
  165. inode->i_sb,xid);
  166. else
  167. rc = cifs_get_inode_info(&newinode, full_path, NULL,
  168. inode->i_sb,xid);
  169. if (rc != 0) {
  170. cFYI(1,
  171. ("Create symlink worked but get_inode_info failed with rc = %d ",
  172. rc));
  173. } else {
  174. direntry->d_op = &cifs_dentry_ops;
  175. d_instantiate(direntry, newinode);
  176. }
  177. }
  178. if (full_path)
  179. kfree(full_path);
  180. FreeXid(xid);
  181. return rc;
  182. }
  183. int
  184. cifs_readlink(struct dentry *direntry, char __user *pBuffer, int buflen)
  185. {
  186. struct inode *inode = direntry->d_inode;
  187. int rc = -EACCES;
  188. int xid;
  189. int oplock = FALSE;
  190. struct cifs_sb_info *cifs_sb;
  191. struct cifsTconInfo *pTcon;
  192. char *full_path = NULL;
  193. char *tmp_path = NULL;
  194. char * tmpbuffer;
  195. unsigned char * referrals = NULL;
  196. int num_referrals = 0;
  197. int len;
  198. __u16 fid;
  199. xid = GetXid();
  200. cifs_sb = CIFS_SB(inode->i_sb);
  201. pTcon = cifs_sb->tcon;
  202. /* BB would it be safe against deadlock to grab this sem
  203. even though rename itself grabs the sem and calls lookup? */
  204. /* down(&inode->i_sb->s_vfs_rename_sem);*/
  205. full_path = build_path_from_dentry(direntry);
  206. /* up(&inode->i_sb->s_vfs_rename_sem);*/
  207. if(full_path == NULL) {
  208. FreeXid(xid);
  209. return -ENOMEM;
  210. }
  211. cFYI(1,
  212. ("Full path: %s inode = 0x%p pBuffer = 0x%p buflen = %d",
  213. full_path, inode, pBuffer, buflen));
  214. if(buflen > PATH_MAX)
  215. len = PATH_MAX;
  216. else
  217. len = buflen;
  218. tmpbuffer = kmalloc(len,GFP_KERNEL);
  219. if(tmpbuffer == NULL) {
  220. if (full_path)
  221. kfree(full_path);
  222. FreeXid(xid);
  223. return -ENOMEM;
  224. }
  225. /* BB add read reparse point symlink code and Unix extensions symlink code here BB */
  226. if (cifs_sb->tcon->ses->capabilities & CAP_UNIX)
  227. rc = CIFSSMBUnixQuerySymLink(xid, pTcon, full_path,
  228. tmpbuffer,
  229. len - 1,
  230. cifs_sb->local_nls);
  231. else {
  232. rc = CIFSSMBOpen(xid, pTcon, full_path, FILE_OPEN, GENERIC_READ,
  233. OPEN_REPARSE_POINT,&fid, &oplock, NULL,
  234. cifs_sb->local_nls,
  235. cifs_sb->mnt_cifs_flags &
  236. CIFS_MOUNT_MAP_SPECIAL_CHR);
  237. if(!rc) {
  238. rc = CIFSSMBQueryReparseLinkInfo(xid, pTcon, full_path,
  239. tmpbuffer,
  240. len - 1,
  241. fid,
  242. cifs_sb->local_nls);
  243. if(CIFSSMBClose(xid, pTcon, fid)) {
  244. cFYI(1,("Error closing junction point (open for ioctl)"));
  245. }
  246. if(rc == -EIO) {
  247. /* Query if DFS Junction */
  248. tmp_path =
  249. kmalloc(MAX_TREE_SIZE + MAX_PATHCONF + 1,
  250. GFP_KERNEL);
  251. if (tmp_path) {
  252. strncpy(tmp_path, pTcon->treeName, MAX_TREE_SIZE);
  253. strncat(tmp_path, full_path, MAX_PATHCONF);
  254. rc = get_dfs_path(xid, pTcon->ses, tmp_path,
  255. cifs_sb->local_nls,
  256. &num_referrals, &referrals,
  257. cifs_sb->mnt_cifs_flags &
  258. CIFS_MOUNT_MAP_SPECIAL_CHR);
  259. cFYI(1,("Get DFS for %s rc = %d ",tmp_path, rc));
  260. if((num_referrals == 0) && (rc == 0))
  261. rc = -EACCES;
  262. else {
  263. cFYI(1,("num referral: %d",num_referrals));
  264. if(referrals) {
  265. cFYI(1,("referral string: %s ",referrals));
  266. strncpy(tmpbuffer, referrals, len-1);
  267. }
  268. }
  269. if(referrals)
  270. kfree(referrals);
  271. kfree(tmp_path);
  272. }
  273. /* BB add code like else decode referrals then memcpy to
  274. tmpbuffer and free referrals string array BB */
  275. }
  276. }
  277. }
  278. /* BB Anything else to do to handle recursive links? */
  279. /* BB Should we be using page ops here? */
  280. /* BB null terminate returned string in pBuffer? BB */
  281. if (rc == 0) {
  282. rc = vfs_readlink(direntry, pBuffer, len, tmpbuffer);
  283. cFYI(1,
  284. ("vfs_readlink called from cifs_readlink returned %d",
  285. rc));
  286. }
  287. if (tmpbuffer) {
  288. kfree(tmpbuffer);
  289. }
  290. if (full_path) {
  291. kfree(full_path);
  292. }
  293. FreeXid(xid);
  294. return rc;
  295. }
  296. void cifs_put_link(struct dentry *direntry, struct nameidata *nd, void *cookie)
  297. {
  298. char *p = nd_get_link(nd);
  299. if (!IS_ERR(p))
  300. kfree(p);
  301. }