dir.c 6.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258
  1. /*
  2. * dir.c
  3. *
  4. * PURPOSE
  5. * Directory handling routines for the OSTA-UDF(tm) filesystem.
  6. *
  7. * COPYRIGHT
  8. * This file is distributed under the terms of the GNU General Public
  9. * License (GPL). Copies of the GPL can be obtained from:
  10. * ftp://prep.ai.mit.edu/pub/gnu/GPL
  11. * Each contributing author retains all rights to their own work.
  12. *
  13. * (C) 1998-2004 Ben Fennema
  14. *
  15. * HISTORY
  16. *
  17. * 10/05/98 dgb Split directory operations into its own file
  18. * Implemented directory reads via do_udf_readdir
  19. * 10/06/98 Made directory operations work!
  20. * 11/17/98 Rewrote directory to support ICBTAG_FLAG_AD_LONG
  21. * 11/25/98 blf Rewrote directory handling (readdir+lookup) to support reading
  22. * across blocks.
  23. * 12/12/98 Split out the lookup code to namei.c. bulk of directory
  24. * code now in directory.c:udf_fileident_read.
  25. */
  26. #include "udfdecl.h"
  27. #include <linux/string.h>
  28. #include <linux/errno.h>
  29. #include <linux/mm.h>
  30. #include <linux/slab.h>
  31. #include <linux/smp_lock.h>
  32. #include <linux/buffer_head.h>
  33. #include "udf_i.h"
  34. #include "udf_sb.h"
  35. /* Prototypes for file operations */
  36. static int udf_readdir(struct file *, void *, filldir_t);
  37. static int do_udf_readdir(struct inode *, struct file *, filldir_t, void *);
  38. /* readdir and lookup functions */
  39. const struct file_operations udf_dir_operations = {
  40. .read = generic_read_dir,
  41. .readdir = udf_readdir,
  42. .ioctl = udf_ioctl,
  43. .fsync = udf_fsync_file,
  44. };
  45. /*
  46. * udf_readdir
  47. *
  48. * PURPOSE
  49. * Read a directory entry.
  50. *
  51. * DESCRIPTION
  52. * Optional - sys_getdents() will return -ENOTDIR if this routine is not
  53. * available.
  54. *
  55. * Refer to sys_getdents() in fs/readdir.c
  56. * sys_getdents() -> .
  57. *
  58. * PRE-CONDITIONS
  59. * filp Pointer to directory file.
  60. * buf Pointer to directory entry buffer.
  61. * filldir Pointer to filldir function.
  62. *
  63. * POST-CONDITIONS
  64. * <return> >=0 on success.
  65. *
  66. * HISTORY
  67. * July 1, 1997 - Andrew E. Mileski
  68. * Written, tested, and released.
  69. */
  70. int udf_readdir(struct file *filp, void *dirent, filldir_t filldir)
  71. {
  72. struct inode *dir = filp->f_path.dentry->d_inode;
  73. int result;
  74. lock_kernel();
  75. if (filp->f_pos == 0) {
  76. if (filldir(dirent, ".", 1, filp->f_pos, dir->i_ino, DT_DIR) <
  77. 0) {
  78. unlock_kernel();
  79. return 0;
  80. }
  81. filp->f_pos++;
  82. }
  83. result = do_udf_readdir(dir, filp, filldir, dirent);
  84. unlock_kernel();
  85. return result;
  86. }
  87. static int
  88. do_udf_readdir(struct inode *dir, struct file *filp, filldir_t filldir,
  89. void *dirent)
  90. {
  91. struct udf_fileident_bh fibh;
  92. struct fileIdentDesc *fi = NULL;
  93. struct fileIdentDesc cfi;
  94. int block, iblock;
  95. loff_t nf_pos = filp->f_pos - 1;
  96. int flen;
  97. char fname[UDF_NAME_LEN];
  98. char *nameptr;
  99. uint16_t liu;
  100. uint8_t lfi;
  101. loff_t size = (udf_ext0_offset(dir) + dir->i_size) >> 2;
  102. struct buffer_head *tmp, *bha[16];
  103. kernel_lb_addr eloc;
  104. uint32_t elen;
  105. sector_t offset;
  106. int i, num;
  107. unsigned int dt_type;
  108. struct extent_position epos = { NULL, 0, {0, 0} };
  109. if (nf_pos >= size)
  110. return 0;
  111. if (nf_pos == 0)
  112. nf_pos = (udf_ext0_offset(dir) >> 2);
  113. fibh.soffset = fibh.eoffset =
  114. (nf_pos & ((dir->i_sb->s_blocksize - 1) >> 2)) << 2;
  115. if (UDF_I_ALLOCTYPE(dir) == ICBTAG_FLAG_AD_IN_ICB)
  116. fibh.sbh = fibh.ebh = NULL;
  117. else if (inode_bmap(dir, nf_pos >> (dir->i_sb->s_blocksize_bits - 2),
  118. &epos, &eloc, &elen,
  119. &offset) == (EXT_RECORDED_ALLOCATED >> 30)) {
  120. block = udf_get_lb_pblock(dir->i_sb, eloc, offset);
  121. if ((++offset << dir->i_sb->s_blocksize_bits) < elen) {
  122. if (UDF_I_ALLOCTYPE(dir) == ICBTAG_FLAG_AD_SHORT)
  123. epos.offset -= sizeof(short_ad);
  124. else if (UDF_I_ALLOCTYPE(dir) == ICBTAG_FLAG_AD_LONG)
  125. epos.offset -= sizeof(long_ad);
  126. } else
  127. offset = 0;
  128. if (!(fibh.sbh = fibh.ebh = udf_tread(dir->i_sb, block))) {
  129. brelse(epos.bh);
  130. return -EIO;
  131. }
  132. if (!(offset & ((16 >> (dir->i_sb->s_blocksize_bits - 9)) - 1))) {
  133. i = 16 >> (dir->i_sb->s_blocksize_bits - 9);
  134. if (i + offset > (elen >> dir->i_sb->s_blocksize_bits))
  135. i = (elen >> dir->i_sb->s_blocksize_bits) -
  136. offset;
  137. for (num = 0; i > 0; i--) {
  138. block =
  139. udf_get_lb_pblock(dir->i_sb, eloc,
  140. offset + i);
  141. tmp = udf_tgetblk(dir->i_sb, block);
  142. if (tmp && !buffer_uptodate(tmp)
  143. && !buffer_locked(tmp))
  144. bha[num++] = tmp;
  145. else
  146. brelse(tmp);
  147. }
  148. if (num) {
  149. ll_rw_block(READA, num, bha);
  150. for (i = 0; i < num; i++)
  151. brelse(bha[i]);
  152. }
  153. }
  154. } else {
  155. brelse(epos.bh);
  156. return -ENOENT;
  157. }
  158. while (nf_pos < size) {
  159. filp->f_pos = nf_pos + 1;
  160. fi = udf_fileident_read(dir, &nf_pos, &fibh, &cfi, &epos, &eloc,
  161. &elen, &offset);
  162. if (!fi) {
  163. if (fibh.sbh != fibh.ebh)
  164. brelse(fibh.ebh);
  165. brelse(fibh.sbh);
  166. brelse(epos.bh);
  167. return 0;
  168. }
  169. liu = le16_to_cpu(cfi.lengthOfImpUse);
  170. lfi = cfi.lengthFileIdent;
  171. if (fibh.sbh == fibh.ebh)
  172. nameptr = fi->fileIdent + liu;
  173. else {
  174. int poffset; /* Unpaded ending offset */
  175. poffset =
  176. fibh.soffset + sizeof(struct fileIdentDesc) + liu +
  177. lfi;
  178. if (poffset >= lfi)
  179. nameptr =
  180. (char *)(fibh.ebh->b_data + poffset - lfi);
  181. else {
  182. nameptr = fname;
  183. memcpy(nameptr, fi->fileIdent + liu,
  184. lfi - poffset);
  185. memcpy(nameptr + lfi - poffset,
  186. fibh.ebh->b_data, poffset);
  187. }
  188. }
  189. if ((cfi.fileCharacteristics & FID_FILE_CHAR_DELETED) != 0) {
  190. if (!UDF_QUERY_FLAG(dir->i_sb, UDF_FLAG_UNDELETE))
  191. continue;
  192. }
  193. if ((cfi.fileCharacteristics & FID_FILE_CHAR_HIDDEN) != 0) {
  194. if (!UDF_QUERY_FLAG(dir->i_sb, UDF_FLAG_UNHIDE))
  195. continue;
  196. }
  197. if (cfi.fileCharacteristics & FID_FILE_CHAR_PARENT) {
  198. iblock = parent_ino(filp->f_path.dentry);
  199. flen = 2;
  200. memcpy(fname, "..", flen);
  201. dt_type = DT_DIR;
  202. } else {
  203. kernel_lb_addr tloc = lelb_to_cpu(cfi.icb.extLocation);
  204. iblock = udf_get_lb_pblock(dir->i_sb, tloc, 0);
  205. flen = udf_get_filename(dir->i_sb, nameptr, fname, lfi);
  206. dt_type = DT_UNKNOWN;
  207. }
  208. if (flen) {
  209. if (filldir
  210. (dirent, fname, flen, filp->f_pos, iblock,
  211. dt_type) < 0) {
  212. if (fibh.sbh != fibh.ebh)
  213. brelse(fibh.ebh);
  214. brelse(fibh.sbh);
  215. brelse(epos.bh);
  216. return 0;
  217. }
  218. }
  219. } /* end while */
  220. filp->f_pos = nf_pos + 1;
  221. if (fibh.sbh != fibh.ebh)
  222. brelse(fibh.ebh);
  223. brelse(fibh.sbh);
  224. brelse(epos.bh);
  225. return 0;
  226. }