dir.c 6.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249
  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) < 0) {
  77. unlock_kernel();
  78. return 0;
  79. }
  80. filp->f_pos++;
  81. }
  82. result = do_udf_readdir(dir, filp, filldir, dirent);
  83. unlock_kernel();
  84. return result;
  85. }
  86. static int
  87. do_udf_readdir(struct inode *dir, struct file *filp, filldir_t filldir,
  88. void *dirent)
  89. {
  90. struct udf_fileident_bh fibh;
  91. struct fileIdentDesc *fi = NULL;
  92. struct fileIdentDesc cfi;
  93. int block, iblock;
  94. loff_t nf_pos = filp->f_pos - 1;
  95. int flen;
  96. char fname[UDF_NAME_LEN];
  97. char *nameptr;
  98. uint16_t liu;
  99. uint8_t lfi;
  100. loff_t size = (udf_ext0_offset(dir) + dir->i_size) >> 2;
  101. struct buffer_head *tmp, *bha[16];
  102. kernel_lb_addr eloc;
  103. uint32_t elen;
  104. sector_t offset;
  105. int i, num;
  106. unsigned int dt_type;
  107. struct extent_position epos = { NULL, 0, {0, 0} };
  108. struct udf_inode_info *iinfo;
  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 = (nf_pos & ((dir->i_sb->s_blocksize - 1) >> 2)) << 2;
  114. iinfo = UDF_I(dir);
  115. if (iinfo->i_alloc_type == 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, &offset) == (EXT_RECORDED_ALLOCATED >> 30)) {
  119. block = udf_get_lb_pblock(dir->i_sb, eloc, offset);
  120. if ((++offset << dir->i_sb->s_blocksize_bits) < elen) {
  121. if (iinfo->i_alloc_type == ICBTAG_FLAG_AD_SHORT)
  122. epos.offset -= sizeof(short_ad);
  123. else if (iinfo->i_alloc_type ==
  124. ICBTAG_FLAG_AD_LONG)
  125. epos.offset -= sizeof(long_ad);
  126. } else {
  127. offset = 0;
  128. }
  129. if (!(fibh.sbh = fibh.ebh = udf_tread(dir->i_sb, block))) {
  130. brelse(epos.bh);
  131. return -EIO;
  132. }
  133. if (!(offset & ((16 >> (dir->i_sb->s_blocksize_bits - 9)) - 1))) {
  134. i = 16 >> (dir->i_sb->s_blocksize_bits - 9);
  135. if (i + offset > (elen >> dir->i_sb->s_blocksize_bits))
  136. i = (elen >> dir->i_sb->s_blocksize_bits) - offset;
  137. for (num = 0; i > 0; i--) {
  138. block = udf_get_lb_pblock(dir->i_sb, eloc, offset + i);
  139. tmp = udf_tgetblk(dir->i_sb, block);
  140. if (tmp && !buffer_uptodate(tmp) && !buffer_locked(tmp))
  141. bha[num++] = tmp;
  142. else
  143. brelse(tmp);
  144. }
  145. if (num) {
  146. ll_rw_block(READA, num, bha);
  147. for (i = 0; i < num; i++)
  148. brelse(bha[i]);
  149. }
  150. }
  151. } else {
  152. brelse(epos.bh);
  153. return -ENOENT;
  154. }
  155. while (nf_pos < size) {
  156. filp->f_pos = nf_pos + 1;
  157. fi = udf_fileident_read(dir, &nf_pos, &fibh, &cfi, &epos, &eloc,
  158. &elen, &offset);
  159. if (!fi) {
  160. if (fibh.sbh != fibh.ebh)
  161. brelse(fibh.ebh);
  162. brelse(fibh.sbh);
  163. brelse(epos.bh);
  164. return 0;
  165. }
  166. liu = le16_to_cpu(cfi.lengthOfImpUse);
  167. lfi = cfi.lengthFileIdent;
  168. if (fibh.sbh == fibh.ebh) {
  169. nameptr = fi->fileIdent + liu;
  170. } else {
  171. int poffset; /* Unpaded ending offset */
  172. poffset = fibh.soffset + sizeof(struct fileIdentDesc) + liu + lfi;
  173. if (poffset >= lfi) {
  174. nameptr = (char *)(fibh.ebh->b_data + poffset - lfi);
  175. } else {
  176. nameptr = fname;
  177. memcpy(nameptr, fi->fileIdent + liu,
  178. lfi - poffset);
  179. memcpy(nameptr + lfi - poffset,
  180. fibh.ebh->b_data, poffset);
  181. }
  182. }
  183. if ((cfi.fileCharacteristics & FID_FILE_CHAR_DELETED) != 0) {
  184. if (!UDF_QUERY_FLAG(dir->i_sb, UDF_FLAG_UNDELETE))
  185. continue;
  186. }
  187. if ((cfi.fileCharacteristics & FID_FILE_CHAR_HIDDEN) != 0) {
  188. if (!UDF_QUERY_FLAG(dir->i_sb, UDF_FLAG_UNHIDE))
  189. continue;
  190. }
  191. if (cfi.fileCharacteristics & FID_FILE_CHAR_PARENT) {
  192. iblock = parent_ino(filp->f_path.dentry);
  193. flen = 2;
  194. memcpy(fname, "..", flen);
  195. dt_type = DT_DIR;
  196. } else {
  197. kernel_lb_addr tloc = lelb_to_cpu(cfi.icb.extLocation);
  198. iblock = udf_get_lb_pblock(dir->i_sb, tloc, 0);
  199. flen = udf_get_filename(dir->i_sb, nameptr, fname, lfi);
  200. dt_type = DT_UNKNOWN;
  201. }
  202. if (flen) {
  203. if (filldir(dirent, fname, flen, filp->f_pos, iblock, dt_type) < 0) {
  204. if (fibh.sbh != fibh.ebh)
  205. brelse(fibh.ebh);
  206. brelse(fibh.sbh);
  207. brelse(epos.bh);
  208. return 0;
  209. }
  210. }
  211. } /* end while */
  212. filp->f_pos = nf_pos + 1;
  213. if (fibh.sbh != fibh.ebh)
  214. brelse(fibh.ebh);
  215. brelse(fibh.sbh);
  216. brelse(epos.bh);
  217. return 0;
  218. }