itree_v2.c 1.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566
  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. if (block < 0) {
  21. printk("minix_bmap: block<0\n");
  22. } else if (block >= (minix_sb(inode->i_sb)->s_max_size/BLOCK_SIZE)) {
  23. printk("minix_bmap: block>big\n");
  24. } else if (block < 7) {
  25. offsets[n++] = block;
  26. } else if ((block -= 7) < 256) {
  27. offsets[n++] = 7;
  28. offsets[n++] = block;
  29. } else if ((block -= 256) < 256*256) {
  30. offsets[n++] = 8;
  31. offsets[n++] = block>>8;
  32. offsets[n++] = block & 255;
  33. } else {
  34. block -= 256*256;
  35. offsets[n++] = 9;
  36. offsets[n++] = block>>16;
  37. offsets[n++] = (block>>8) & 255;
  38. offsets[n++] = block & 255;
  39. }
  40. return n;
  41. }
  42. #include "itree_common.c"
  43. int V2_minix_get_block(struct inode * inode, long block,
  44. struct buffer_head *bh_result, int create)
  45. {
  46. return get_block(inode, block, bh_result, create);
  47. }
  48. void V2_minix_truncate(struct inode * inode)
  49. {
  50. truncate(inode);
  51. }
  52. unsigned V2_minix_blocks(loff_t size)
  53. {
  54. return nblocks(size);
  55. }