itree_v1.c 1.2 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
  1. #include <linux/buffer_head.h>
  2. #include "minix.h"
  3. enum {DEPTH = 3, DIRECT = 7}; /* Only double indirect */
  4. typedef u16 block_t; /* 16 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.i1_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) < 512) {
  27. offsets[n++] = 7;
  28. offsets[n++] = block;
  29. } else {
  30. block -= 512;
  31. offsets[n++] = 8;
  32. offsets[n++] = block>>9;
  33. offsets[n++] = block & 511;
  34. }
  35. return n;
  36. }
  37. #include "itree_common.c"
  38. int V1_minix_get_block(struct inode * inode, long block,
  39. struct buffer_head *bh_result, int create)
  40. {
  41. return get_block(inode, block, bh_result, create);
  42. }
  43. void V1_minix_truncate(struct inode * inode)
  44. {
  45. truncate(inode);
  46. }
  47. unsigned V1_minix_blocks(loff_t size, struct super_block *sb)
  48. {
  49. return nblocks(size, sb);
  50. }