itree_v2.c 1.4 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667
  1. #include <linux/buffer_head.h>
  2. #include "minix.h"
  3. enum {DIRECT = 7, DEPTH = 4}; /* Have triple indirect */
  4. typedef u32 block_t; /* 32 bit, host order */
  5. static inline unsigned long block_to_cpu(block_t n)
  6. {
  7. return n;
  8. }
  9. static inline block_t cpu_to_block(unsigned long n)
  10. {
  11. return n;
  12. }
  13. static inline block_t *i_data(struct inode *inode)
  14. {
  15. return (block_t *)minix_i(inode)->u.i2_data;
  16. }
  17. static int block_to_path(struct inode * inode, long block, int offsets[DEPTH])
  18. {
  19. int n = 0;
  20. struct super_block *sb = inode->i_sb;
  21. if (block < 0) {
  22. printk("minix_bmap: block<0\n");
  23. } else if (block >= (minix_sb(inode->i_sb)->s_max_size/sb->s_blocksize)) {
  24. printk("minix_bmap: block>big\n");
  25. } else if (block < 7) {
  26. offsets[n++] = block;
  27. } else if ((block -= 7) < 256) {
  28. offsets[n++] = 7;
  29. offsets[n++] = block;
  30. } else if ((block -= 256) < 256*256) {
  31. offsets[n++] = 8;
  32. offsets[n++] = block>>8;
  33. offsets[n++] = block & 255;
  34. } else {
  35. block -= 256*256;
  36. offsets[n++] = 9;
  37. offsets[n++] = block>>16;
  38. offsets[n++] = (block>>8) & 255;
  39. offsets[n++] = block & 255;
  40. }
  41. return n;
  42. }
  43. #include "itree_common.c"
  44. int V2_minix_get_block(struct inode * inode, long block,
  45. struct buffer_head *bh_result, int create)
  46. {
  47. return get_block(inode, block, bh_result, create);
  48. }
  49. void V2_minix_truncate(struct inode * inode)
  50. {
  51. truncate(inode);
  52. }
  53. unsigned V2_minix_blocks(loff_t size, struct super_block *sb)
  54. {
  55. return nblocks(size, sb);
  56. }