namei.c 4.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189
  1. /*
  2. * linux/fs/isofs/namei.c
  3. *
  4. * (C) 1992 Eric Youngdale Modified for ISO 9660 filesystem.
  5. *
  6. * (C) 1991 Linus Torvalds - minix filesystem
  7. */
  8. #include <linux/config.h> /* Joliet? */
  9. #include <linux/smp_lock.h>
  10. #include "isofs.h"
  11. /*
  12. * ok, we cannot use strncmp, as the name is not in our data space.
  13. * Thus we'll have to use isofs_match. No big problem. Match also makes
  14. * some sanity tests.
  15. */
  16. static int
  17. isofs_cmp(struct dentry * dentry, const char * compare, int dlen)
  18. {
  19. struct qstr qstr;
  20. if (!compare)
  21. return 1;
  22. /* check special "." and ".." files */
  23. if (dlen == 1) {
  24. /* "." */
  25. if (compare[0] == 0) {
  26. if (!dentry->d_name.len)
  27. return 0;
  28. compare = ".";
  29. } else if (compare[0] == 1) {
  30. compare = "..";
  31. dlen = 2;
  32. }
  33. }
  34. qstr.name = compare;
  35. qstr.len = dlen;
  36. return dentry->d_op->d_compare(dentry, &dentry->d_name, &qstr);
  37. }
  38. /*
  39. * isofs_find_entry()
  40. *
  41. * finds an entry in the specified directory with the wanted name. It
  42. * returns the inode number of the found entry, or 0 on error.
  43. */
  44. static unsigned long
  45. isofs_find_entry(struct inode *dir, struct dentry *dentry,
  46. unsigned long *block_rv, unsigned long* offset_rv,
  47. char * tmpname, struct iso_directory_record * tmpde)
  48. {
  49. unsigned long bufsize = ISOFS_BUFFER_SIZE(dir);
  50. unsigned char bufbits = ISOFS_BUFFER_BITS(dir);
  51. unsigned long block, f_pos, offset, block_saved, offset_saved;
  52. struct buffer_head * bh = NULL;
  53. struct isofs_sb_info *sbi = ISOFS_SB(dir->i_sb);
  54. if (!ISOFS_I(dir)->i_first_extent)
  55. return 0;
  56. f_pos = 0;
  57. offset = 0;
  58. block = 0;
  59. while (f_pos < dir->i_size) {
  60. struct iso_directory_record * de;
  61. int de_len, match, i, dlen;
  62. char *dpnt;
  63. if (!bh) {
  64. bh = isofs_bread(dir, block);
  65. if (!bh)
  66. return 0;
  67. }
  68. de = (struct iso_directory_record *) (bh->b_data + offset);
  69. de_len = *(unsigned char *) de;
  70. if (!de_len) {
  71. brelse(bh);
  72. bh = NULL;
  73. f_pos = (f_pos + ISOFS_BLOCK_SIZE) & ~(ISOFS_BLOCK_SIZE - 1);
  74. block = f_pos >> bufbits;
  75. offset = 0;
  76. continue;
  77. }
  78. block_saved = bh->b_blocknr;
  79. offset_saved = offset;
  80. offset += de_len;
  81. f_pos += de_len;
  82. /* Make sure we have a full directory entry */
  83. if (offset >= bufsize) {
  84. int slop = bufsize - offset + de_len;
  85. memcpy(tmpde, de, slop);
  86. offset &= bufsize - 1;
  87. block++;
  88. brelse(bh);
  89. bh = NULL;
  90. if (offset) {
  91. bh = isofs_bread(dir, block);
  92. if (!bh)
  93. return 0;
  94. memcpy((void *) tmpde + slop, bh->b_data, offset);
  95. }
  96. de = tmpde;
  97. }
  98. dlen = de->name_len[0];
  99. dpnt = de->name;
  100. if (sbi->s_rock &&
  101. ((i = get_rock_ridge_filename(de, tmpname, dir)))) {
  102. dlen = i; /* possibly -1 */
  103. dpnt = tmpname;
  104. #ifdef CONFIG_JOLIET
  105. } else if (sbi->s_joliet_level) {
  106. dlen = get_joliet_filename(de, tmpname, dir);
  107. dpnt = tmpname;
  108. #endif
  109. } else if (sbi->s_mapping == 'a') {
  110. dlen = get_acorn_filename(de, tmpname, dir);
  111. dpnt = tmpname;
  112. } else if (sbi->s_mapping == 'n') {
  113. dlen = isofs_name_translate(de, tmpname, dir);
  114. dpnt = tmpname;
  115. }
  116. /*
  117. * Skip hidden or associated files unless hide or showassoc,
  118. * respectively, is set
  119. */
  120. match = 0;
  121. if (dlen > 0 &&
  122. (sbi->s_hide =='n' ||
  123. (!(de->flags[-sbi->s_high_sierra] & 1))) &&
  124. (sbi->s_showassoc =='y' ||
  125. (!(de->flags[-sbi->s_high_sierra] & 4)))) {
  126. match = (isofs_cmp(dentry, dpnt, dlen) == 0);
  127. }
  128. if (match) {
  129. isofs_normalize_block_and_offset(de,
  130. &block_saved,
  131. &offset_saved);
  132. *block_rv = block_saved;
  133. *offset_rv = offset_saved;
  134. brelse(bh);
  135. return 1;
  136. }
  137. }
  138. brelse(bh);
  139. return 0;
  140. }
  141. struct dentry *isofs_lookup(struct inode * dir, struct dentry * dentry, struct nameidata *nd)
  142. {
  143. int found;
  144. unsigned long block, offset;
  145. struct inode *inode;
  146. struct page *page;
  147. dentry->d_op = dir->i_sb->s_root->d_op;
  148. page = alloc_page(GFP_USER);
  149. if (!page)
  150. return ERR_PTR(-ENOMEM);
  151. lock_kernel();
  152. found = isofs_find_entry(dir, dentry,
  153. &block, &offset,
  154. page_address(page),
  155. 1024 + page_address(page));
  156. __free_page(page);
  157. inode = NULL;
  158. if (found) {
  159. inode = isofs_iget(dir->i_sb, block, offset);
  160. if (!inode) {
  161. unlock_kernel();
  162. return ERR_PTR(-EACCES);
  163. }
  164. }
  165. unlock_kernel();
  166. return d_splice_alias(inode, dentry);
  167. }