bitmap.c 6.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269
  1. /*
  2. * linux/fs/minix/bitmap.c
  3. *
  4. * Copyright (C) 1991, 1992 Linus Torvalds
  5. */
  6. /*
  7. * Modified for 680x0 by Hamish Macdonald
  8. * Fixed for 680x0 by Andreas Schwab
  9. */
  10. /* bitmap.c contains the code that handles the inode and block bitmaps */
  11. #include "minix.h"
  12. #include <linux/smp_lock.h>
  13. #include <linux/buffer_head.h>
  14. #include <linux/bitops.h>
  15. static int nibblemap[] = { 4,3,3,2,3,2,2,1,3,2,2,1,2,1,1,0 };
  16. static unsigned long count_free(struct buffer_head *map[], unsigned numblocks, __u32 numbits)
  17. {
  18. unsigned i, j, sum = 0;
  19. struct buffer_head *bh;
  20. for (i=0; i<numblocks-1; i++) {
  21. if (!(bh=map[i]))
  22. return(0);
  23. for (j=0; j<BLOCK_SIZE; j++)
  24. sum += nibblemap[bh->b_data[j] & 0xf]
  25. + nibblemap[(bh->b_data[j]>>4) & 0xf];
  26. }
  27. if (numblocks==0 || !(bh=map[numblocks-1]))
  28. return(0);
  29. i = ((numbits-(numblocks-1)*BLOCK_SIZE*8)/16)*2;
  30. for (j=0; j<i; j++) {
  31. sum += nibblemap[bh->b_data[j] & 0xf]
  32. + nibblemap[(bh->b_data[j]>>4) & 0xf];
  33. }
  34. i = numbits%16;
  35. if (i!=0) {
  36. i = *(__u16 *)(&bh->b_data[j]) | ~((1<<i) - 1);
  37. sum += nibblemap[i & 0xf] + nibblemap[(i>>4) & 0xf];
  38. sum += nibblemap[(i>>8) & 0xf] + nibblemap[(i>>12) & 0xf];
  39. }
  40. return(sum);
  41. }
  42. void minix_free_block(struct inode * inode, int block)
  43. {
  44. struct super_block * sb = inode->i_sb;
  45. struct minix_sb_info * sbi = minix_sb(sb);
  46. struct buffer_head * bh;
  47. unsigned int bit,zone;
  48. if (block < sbi->s_firstdatazone || block >= sbi->s_nzones) {
  49. printk("Trying to free block not in datazone\n");
  50. return;
  51. }
  52. zone = block - sbi->s_firstdatazone + 1;
  53. bit = zone & 8191;
  54. zone >>= 13;
  55. if (zone >= sbi->s_zmap_blocks) {
  56. printk("minix_free_block: nonexistent bitmap buffer\n");
  57. return;
  58. }
  59. bh = sbi->s_zmap[zone];
  60. lock_kernel();
  61. if (!minix_test_and_clear_bit(bit,bh->b_data))
  62. printk("free_block (%s:%d): bit already cleared\n",
  63. sb->s_id, block);
  64. unlock_kernel();
  65. mark_buffer_dirty(bh);
  66. return;
  67. }
  68. int minix_new_block(struct inode * inode)
  69. {
  70. struct minix_sb_info *sbi = minix_sb(inode->i_sb);
  71. int i;
  72. for (i = 0; i < sbi->s_zmap_blocks; i++) {
  73. struct buffer_head *bh = sbi->s_zmap[i];
  74. int j;
  75. lock_kernel();
  76. if ((j = minix_find_first_zero_bit(bh->b_data, 8192)) < 8192) {
  77. minix_set_bit(j,bh->b_data);
  78. unlock_kernel();
  79. mark_buffer_dirty(bh);
  80. j += i*8192 + sbi->s_firstdatazone-1;
  81. if (j < sbi->s_firstdatazone || j >= sbi->s_nzones)
  82. break;
  83. return j;
  84. }
  85. unlock_kernel();
  86. }
  87. return 0;
  88. }
  89. unsigned long minix_count_free_blocks(struct minix_sb_info *sbi)
  90. {
  91. return (count_free(sbi->s_zmap, sbi->s_zmap_blocks,
  92. sbi->s_nzones - sbi->s_firstdatazone + 1)
  93. << sbi->s_log_zone_size);
  94. }
  95. struct minix_inode *
  96. minix_V1_raw_inode(struct super_block *sb, ino_t ino, struct buffer_head **bh)
  97. {
  98. int block;
  99. struct minix_sb_info *sbi = minix_sb(sb);
  100. struct minix_inode *p;
  101. if (!ino || ino > sbi->s_ninodes) {
  102. printk("Bad inode number on dev %s: %ld is out of range\n",
  103. sb->s_id, (long)ino);
  104. return NULL;
  105. }
  106. ino--;
  107. block = 2 + sbi->s_imap_blocks + sbi->s_zmap_blocks +
  108. ino / MINIX_INODES_PER_BLOCK;
  109. *bh = sb_bread(sb, block);
  110. if (!*bh) {
  111. printk("Unable to read inode block\n");
  112. return NULL;
  113. }
  114. p = (void *)(*bh)->b_data;
  115. return p + ino % MINIX_INODES_PER_BLOCK;
  116. }
  117. struct minix2_inode *
  118. minix_V2_raw_inode(struct super_block *sb, ino_t ino, struct buffer_head **bh)
  119. {
  120. int block;
  121. struct minix_sb_info *sbi = minix_sb(sb);
  122. struct minix2_inode *p;
  123. *bh = NULL;
  124. if (!ino || ino > sbi->s_ninodes) {
  125. printk("Bad inode number on dev %s: %ld is out of range\n",
  126. sb->s_id, (long)ino);
  127. return NULL;
  128. }
  129. ino--;
  130. block = 2 + sbi->s_imap_blocks + sbi->s_zmap_blocks +
  131. ino / MINIX2_INODES_PER_BLOCK;
  132. *bh = sb_bread(sb, block);
  133. if (!*bh) {
  134. printk("Unable to read inode block\n");
  135. return NULL;
  136. }
  137. p = (void *)(*bh)->b_data;
  138. return p + ino % MINIX2_INODES_PER_BLOCK;
  139. }
  140. /* Clear the link count and mode of a deleted inode on disk. */
  141. static void minix_clear_inode(struct inode *inode)
  142. {
  143. struct buffer_head *bh = NULL;
  144. if (INODE_VERSION(inode) == MINIX_V1) {
  145. struct minix_inode *raw_inode;
  146. raw_inode = minix_V1_raw_inode(inode->i_sb, inode->i_ino, &bh);
  147. if (raw_inode) {
  148. raw_inode->i_nlinks = 0;
  149. raw_inode->i_mode = 0;
  150. }
  151. } else {
  152. struct minix2_inode *raw_inode;
  153. raw_inode = minix_V2_raw_inode(inode->i_sb, inode->i_ino, &bh);
  154. if (raw_inode) {
  155. raw_inode->i_nlinks = 0;
  156. raw_inode->i_mode = 0;
  157. }
  158. }
  159. if (bh) {
  160. mark_buffer_dirty(bh);
  161. brelse (bh);
  162. }
  163. }
  164. void minix_free_inode(struct inode * inode)
  165. {
  166. struct minix_sb_info *sbi = minix_sb(inode->i_sb);
  167. struct buffer_head * bh;
  168. unsigned long ino;
  169. ino = inode->i_ino;
  170. if (ino < 1 || ino > sbi->s_ninodes) {
  171. printk("minix_free_inode: inode 0 or nonexistent inode\n");
  172. goto out;
  173. }
  174. if ((ino >> 13) >= sbi->s_imap_blocks) {
  175. printk("minix_free_inode: nonexistent imap in superblock\n");
  176. goto out;
  177. }
  178. minix_clear_inode(inode); /* clear on-disk copy */
  179. bh = sbi->s_imap[ino >> 13];
  180. lock_kernel();
  181. if (!minix_test_and_clear_bit(ino & 8191, bh->b_data))
  182. printk("minix_free_inode: bit %lu already cleared\n", ino);
  183. unlock_kernel();
  184. mark_buffer_dirty(bh);
  185. out:
  186. clear_inode(inode); /* clear in-memory copy */
  187. }
  188. struct inode * minix_new_inode(const struct inode * dir, int * error)
  189. {
  190. struct super_block *sb = dir->i_sb;
  191. struct minix_sb_info *sbi = minix_sb(sb);
  192. struct inode *inode = new_inode(sb);
  193. struct buffer_head * bh;
  194. int i,j;
  195. if (!inode) {
  196. *error = -ENOMEM;
  197. return NULL;
  198. }
  199. j = 8192;
  200. bh = NULL;
  201. *error = -ENOSPC;
  202. lock_kernel();
  203. for (i = 0; i < sbi->s_imap_blocks; i++) {
  204. bh = sbi->s_imap[i];
  205. if ((j = minix_find_first_zero_bit(bh->b_data, 8192)) < 8192)
  206. break;
  207. }
  208. if (!bh || j >= 8192) {
  209. unlock_kernel();
  210. iput(inode);
  211. return NULL;
  212. }
  213. if (minix_test_and_set_bit(j,bh->b_data)) { /* shouldn't happen */
  214. printk("new_inode: bit already set\n");
  215. unlock_kernel();
  216. iput(inode);
  217. return NULL;
  218. }
  219. unlock_kernel();
  220. mark_buffer_dirty(bh);
  221. j += i*8192;
  222. if (!j || j > sbi->s_ninodes) {
  223. iput(inode);
  224. return NULL;
  225. }
  226. inode->i_uid = current->fsuid;
  227. inode->i_gid = (dir->i_mode & S_ISGID) ? dir->i_gid : current->fsgid;
  228. inode->i_ino = j;
  229. inode->i_mtime = inode->i_atime = inode->i_ctime = CURRENT_TIME_SEC;
  230. inode->i_blocks = 0;
  231. memset(&minix_i(inode)->u, 0, sizeof(minix_i(inode)->u));
  232. insert_inode_hash(inode);
  233. mark_inode_dirty(inode);
  234. *error = 0;
  235. return inode;
  236. }
  237. unsigned long minix_count_free_inodes(struct minix_sb_info *sbi)
  238. {
  239. return count_free(sbi->s_imap, sbi->s_imap_blocks, sbi->s_ninodes + 1);
  240. }