node.h 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420
  1. /*
  2. * fs/f2fs/node.h
  3. *
  4. * Copyright (c) 2012 Samsung Electronics Co., Ltd.
  5. * http://www.samsung.com/
  6. *
  7. * This program is free software; you can redistribute it and/or modify
  8. * it under the terms of the GNU General Public License version 2 as
  9. * published by the Free Software Foundation.
  10. */
  11. /* start node id of a node block dedicated to the given node id */
  12. #define START_NID(nid) ((nid / NAT_ENTRY_PER_BLOCK) * NAT_ENTRY_PER_BLOCK)
  13. /* node block offset on the NAT area dedicated to the given start node id */
  14. #define NAT_BLOCK_OFFSET(start_nid) (start_nid / NAT_ENTRY_PER_BLOCK)
  15. /* # of pages to perform synchronous readahead before building free nids */
  16. #define FREE_NID_PAGES 4
  17. #define DEF_RA_NID_PAGES 4 /* # of nid pages to be readaheaded */
  18. /* maximum readahead size for node during getting data blocks */
  19. #define MAX_RA_NODE 128
  20. /* control the memory footprint threshold (10MB per 1GB ram) */
  21. #define DEF_RAM_THRESHOLD 10
  22. /* control dirty nats ratio threshold (default: 10% over max nid count) */
  23. #define DEF_DIRTY_NAT_RATIO_THRESHOLD 10
  24. /* vector size for gang look-up from nat cache that consists of radix tree */
  25. #define NATVEC_SIZE 64
  26. #define SETVEC_SIZE 32
  27. /* return value for read_node_page */
  28. #define LOCKED_PAGE 1
  29. /* For flag in struct node_info */
  30. enum {
  31. IS_CHECKPOINTED, /* is it checkpointed before? */
  32. HAS_FSYNCED_INODE, /* is the inode fsynced before? */
  33. HAS_LAST_FSYNC, /* has the latest node fsync mark? */
  34. IS_DIRTY, /* this nat entry is dirty? */
  35. };
  36. /*
  37. * For node information
  38. */
  39. struct node_info {
  40. nid_t nid; /* node id */
  41. nid_t ino; /* inode number of the node's owner */
  42. block_t blk_addr; /* block address of the node */
  43. unsigned char version; /* version of the node */
  44. unsigned char flag; /* for node information bits */
  45. };
  46. struct nat_entry {
  47. struct list_head list; /* for clean or dirty nat list */
  48. struct node_info ni; /* in-memory node information */
  49. };
  50. #define nat_get_nid(nat) (nat->ni.nid)
  51. #define nat_set_nid(nat, n) (nat->ni.nid = n)
  52. #define nat_get_blkaddr(nat) (nat->ni.blk_addr)
  53. #define nat_set_blkaddr(nat, b) (nat->ni.blk_addr = b)
  54. #define nat_get_ino(nat) (nat->ni.ino)
  55. #define nat_set_ino(nat, i) (nat->ni.ino = i)
  56. #define nat_get_version(nat) (nat->ni.version)
  57. #define nat_set_version(nat, v) (nat->ni.version = v)
  58. #define inc_node_version(version) (++version)
  59. static inline void copy_node_info(struct node_info *dst,
  60. struct node_info *src)
  61. {
  62. dst->nid = src->nid;
  63. dst->ino = src->ino;
  64. dst->blk_addr = src->blk_addr;
  65. dst->version = src->version;
  66. /* should not copy flag here */
  67. }
  68. static inline void set_nat_flag(struct nat_entry *ne,
  69. unsigned int type, bool set)
  70. {
  71. unsigned char mask = 0x01 << type;
  72. if (set)
  73. ne->ni.flag |= mask;
  74. else
  75. ne->ni.flag &= ~mask;
  76. }
  77. static inline bool get_nat_flag(struct nat_entry *ne, unsigned int type)
  78. {
  79. unsigned char mask = 0x01 << type;
  80. return ne->ni.flag & mask;
  81. }
  82. static inline void nat_reset_flag(struct nat_entry *ne)
  83. {
  84. /* these states can be set only after checkpoint was done */
  85. set_nat_flag(ne, IS_CHECKPOINTED, true);
  86. set_nat_flag(ne, HAS_FSYNCED_INODE, false);
  87. set_nat_flag(ne, HAS_LAST_FSYNC, true);
  88. }
  89. static inline void node_info_from_raw_nat(struct node_info *ni,
  90. struct f2fs_nat_entry *raw_ne)
  91. {
  92. ni->ino = le32_to_cpu(raw_ne->ino);
  93. ni->blk_addr = le32_to_cpu(raw_ne->block_addr);
  94. ni->version = raw_ne->version;
  95. }
  96. static inline void raw_nat_from_node_info(struct f2fs_nat_entry *raw_ne,
  97. struct node_info *ni)
  98. {
  99. raw_ne->ino = cpu_to_le32(ni->ino);
  100. raw_ne->block_addr = cpu_to_le32(ni->blk_addr);
  101. raw_ne->version = ni->version;
  102. }
  103. static inline bool excess_dirty_nats(struct f2fs_sb_info *sbi)
  104. {
  105. return NM_I(sbi)->dirty_nat_cnt >= NM_I(sbi)->max_nid *
  106. NM_I(sbi)->dirty_nats_ratio / 100;
  107. }
  108. enum mem_type {
  109. FREE_NIDS, /* indicates the free nid list */
  110. NAT_ENTRIES, /* indicates the cached nat entry */
  111. DIRTY_DENTS, /* indicates dirty dentry pages */
  112. INO_ENTRIES, /* indicates inode entries */
  113. EXTENT_CACHE, /* indicates extent cache */
  114. BASE_CHECK, /* check kernel status */
  115. };
  116. struct nat_entry_set {
  117. struct list_head set_list; /* link with other nat sets */
  118. struct list_head entry_list; /* link with dirty nat entries */
  119. nid_t set; /* set number*/
  120. unsigned int entry_cnt; /* the # of nat entries in set */
  121. };
  122. /*
  123. * For free nid mangement
  124. */
  125. enum nid_state {
  126. NID_NEW, /* newly added to free nid list */
  127. NID_ALLOC /* it is allocated */
  128. };
  129. struct free_nid {
  130. struct list_head list; /* for free node id list */
  131. nid_t nid; /* node id */
  132. int state; /* in use or not: NID_NEW or NID_ALLOC */
  133. };
  134. static inline void next_free_nid(struct f2fs_sb_info *sbi, nid_t *nid)
  135. {
  136. struct f2fs_nm_info *nm_i = NM_I(sbi);
  137. struct free_nid *fnid;
  138. spin_lock(&nm_i->free_nid_list_lock);
  139. if (nm_i->fcnt <= 0) {
  140. spin_unlock(&nm_i->free_nid_list_lock);
  141. return;
  142. }
  143. fnid = list_entry(nm_i->free_nid_list.next, struct free_nid, list);
  144. *nid = fnid->nid;
  145. spin_unlock(&nm_i->free_nid_list_lock);
  146. }
  147. /*
  148. * inline functions
  149. */
  150. static inline void get_nat_bitmap(struct f2fs_sb_info *sbi, void *addr)
  151. {
  152. struct f2fs_nm_info *nm_i = NM_I(sbi);
  153. memcpy(addr, nm_i->nat_bitmap, nm_i->bitmap_size);
  154. }
  155. static inline pgoff_t current_nat_addr(struct f2fs_sb_info *sbi, nid_t start)
  156. {
  157. struct f2fs_nm_info *nm_i = NM_I(sbi);
  158. pgoff_t block_off;
  159. pgoff_t block_addr;
  160. int seg_off;
  161. block_off = NAT_BLOCK_OFFSET(start);
  162. seg_off = block_off >> sbi->log_blocks_per_seg;
  163. block_addr = (pgoff_t)(nm_i->nat_blkaddr +
  164. (seg_off << sbi->log_blocks_per_seg << 1) +
  165. (block_off & (sbi->blocks_per_seg - 1)));
  166. if (f2fs_test_bit(block_off, nm_i->nat_bitmap))
  167. block_addr += sbi->blocks_per_seg;
  168. return block_addr;
  169. }
  170. static inline pgoff_t next_nat_addr(struct f2fs_sb_info *sbi,
  171. pgoff_t block_addr)
  172. {
  173. struct f2fs_nm_info *nm_i = NM_I(sbi);
  174. block_addr -= nm_i->nat_blkaddr;
  175. if ((block_addr >> sbi->log_blocks_per_seg) % 2)
  176. block_addr -= sbi->blocks_per_seg;
  177. else
  178. block_addr += sbi->blocks_per_seg;
  179. return block_addr + nm_i->nat_blkaddr;
  180. }
  181. static inline void set_to_next_nat(struct f2fs_nm_info *nm_i, nid_t start_nid)
  182. {
  183. unsigned int block_off = NAT_BLOCK_OFFSET(start_nid);
  184. f2fs_change_bit(block_off, nm_i->nat_bitmap);
  185. }
  186. static inline void fill_node_footer(struct page *page, nid_t nid,
  187. nid_t ino, unsigned int ofs, bool reset)
  188. {
  189. struct f2fs_node *rn = F2FS_NODE(page);
  190. unsigned int old_flag = 0;
  191. if (reset)
  192. memset(rn, 0, sizeof(*rn));
  193. else
  194. old_flag = le32_to_cpu(rn->footer.flag);
  195. rn->footer.nid = cpu_to_le32(nid);
  196. rn->footer.ino = cpu_to_le32(ino);
  197. /* should remain old flag bits such as COLD_BIT_SHIFT */
  198. rn->footer.flag = cpu_to_le32((ofs << OFFSET_BIT_SHIFT) |
  199. (old_flag & OFFSET_BIT_MASK));
  200. }
  201. static inline void copy_node_footer(struct page *dst, struct page *src)
  202. {
  203. struct f2fs_node *src_rn = F2FS_NODE(src);
  204. struct f2fs_node *dst_rn = F2FS_NODE(dst);
  205. memcpy(&dst_rn->footer, &src_rn->footer, sizeof(struct node_footer));
  206. }
  207. static inline void fill_node_footer_blkaddr(struct page *page, block_t blkaddr)
  208. {
  209. struct f2fs_checkpoint *ckpt = F2FS_CKPT(F2FS_P_SB(page));
  210. struct f2fs_node *rn = F2FS_NODE(page);
  211. rn->footer.cp_ver = ckpt->checkpoint_ver;
  212. rn->footer.next_blkaddr = cpu_to_le32(blkaddr);
  213. }
  214. static inline nid_t ino_of_node(struct page *node_page)
  215. {
  216. struct f2fs_node *rn = F2FS_NODE(node_page);
  217. return le32_to_cpu(rn->footer.ino);
  218. }
  219. static inline nid_t nid_of_node(struct page *node_page)
  220. {
  221. struct f2fs_node *rn = F2FS_NODE(node_page);
  222. return le32_to_cpu(rn->footer.nid);
  223. }
  224. static inline unsigned int ofs_of_node(struct page *node_page)
  225. {
  226. struct f2fs_node *rn = F2FS_NODE(node_page);
  227. unsigned flag = le32_to_cpu(rn->footer.flag);
  228. return flag >> OFFSET_BIT_SHIFT;
  229. }
  230. static inline unsigned long long cpver_of_node(struct page *node_page)
  231. {
  232. struct f2fs_node *rn = F2FS_NODE(node_page);
  233. return le64_to_cpu(rn->footer.cp_ver);
  234. }
  235. static inline block_t next_blkaddr_of_node(struct page *node_page)
  236. {
  237. struct f2fs_node *rn = F2FS_NODE(node_page);
  238. return le32_to_cpu(rn->footer.next_blkaddr);
  239. }
  240. /*
  241. * f2fs assigns the following node offsets described as (num).
  242. * N = NIDS_PER_BLOCK
  243. *
  244. * Inode block (0)
  245. * |- direct node (1)
  246. * |- direct node (2)
  247. * |- indirect node (3)
  248. * | `- direct node (4 => 4 + N - 1)
  249. * |- indirect node (4 + N)
  250. * | `- direct node (5 + N => 5 + 2N - 1)
  251. * `- double indirect node (5 + 2N)
  252. * `- indirect node (6 + 2N)
  253. * `- direct node
  254. * ......
  255. * `- indirect node ((6 + 2N) + x(N + 1))
  256. * `- direct node
  257. * ......
  258. * `- indirect node ((6 + 2N) + (N - 1)(N + 1))
  259. * `- direct node
  260. */
  261. static inline bool IS_DNODE(struct page *node_page)
  262. {
  263. unsigned int ofs = ofs_of_node(node_page);
  264. if (f2fs_has_xattr_block(ofs))
  265. return false;
  266. if (ofs == 3 || ofs == 4 + NIDS_PER_BLOCK ||
  267. ofs == 5 + 2 * NIDS_PER_BLOCK)
  268. return false;
  269. if (ofs >= 6 + 2 * NIDS_PER_BLOCK) {
  270. ofs -= 6 + 2 * NIDS_PER_BLOCK;
  271. if (!((long int)ofs % (NIDS_PER_BLOCK + 1)))
  272. return false;
  273. }
  274. return true;
  275. }
  276. static inline int set_nid(struct page *p, int off, nid_t nid, bool i)
  277. {
  278. struct f2fs_node *rn = F2FS_NODE(p);
  279. f2fs_wait_on_page_writeback(p, NODE, true);
  280. if (i)
  281. rn->i.i_nid[off - NODE_DIR1_BLOCK] = cpu_to_le32(nid);
  282. else
  283. rn->in.nid[off] = cpu_to_le32(nid);
  284. return set_page_dirty(p);
  285. }
  286. static inline nid_t get_nid(struct page *p, int off, bool i)
  287. {
  288. struct f2fs_node *rn = F2FS_NODE(p);
  289. if (i)
  290. return le32_to_cpu(rn->i.i_nid[off - NODE_DIR1_BLOCK]);
  291. return le32_to_cpu(rn->in.nid[off]);
  292. }
  293. /*
  294. * Coldness identification:
  295. * - Mark cold files in f2fs_inode_info
  296. * - Mark cold node blocks in their node footer
  297. * - Mark cold data pages in page cache
  298. */
  299. static inline int is_cold_data(struct page *page)
  300. {
  301. return PageChecked(page);
  302. }
  303. static inline void set_cold_data(struct page *page)
  304. {
  305. SetPageChecked(page);
  306. }
  307. static inline void clear_cold_data(struct page *page)
  308. {
  309. ClearPageChecked(page);
  310. }
  311. static inline int is_node(struct page *page, int type)
  312. {
  313. struct f2fs_node *rn = F2FS_NODE(page);
  314. return le32_to_cpu(rn->footer.flag) & (1 << type);
  315. }
  316. #define is_cold_node(page) is_node(page, COLD_BIT_SHIFT)
  317. #define is_fsync_dnode(page) is_node(page, FSYNC_BIT_SHIFT)
  318. #define is_dent_dnode(page) is_node(page, DENT_BIT_SHIFT)
  319. static inline int is_inline_node(struct page *page)
  320. {
  321. return PageChecked(page);
  322. }
  323. static inline void set_inline_node(struct page *page)
  324. {
  325. SetPageChecked(page);
  326. }
  327. static inline void clear_inline_node(struct page *page)
  328. {
  329. ClearPageChecked(page);
  330. }
  331. static inline void set_cold_node(struct inode *inode, struct page *page)
  332. {
  333. struct f2fs_node *rn = F2FS_NODE(page);
  334. unsigned int flag = le32_to_cpu(rn->footer.flag);
  335. if (S_ISDIR(inode->i_mode))
  336. flag &= ~(0x1 << COLD_BIT_SHIFT);
  337. else
  338. flag |= (0x1 << COLD_BIT_SHIFT);
  339. rn->footer.flag = cpu_to_le32(flag);
  340. }
  341. static inline void set_mark(struct page *page, int mark, int type)
  342. {
  343. struct f2fs_node *rn = F2FS_NODE(page);
  344. unsigned int flag = le32_to_cpu(rn->footer.flag);
  345. if (mark)
  346. flag |= (0x1 << type);
  347. else
  348. flag &= ~(0x1 << type);
  349. rn->footer.flag = cpu_to_le32(flag);
  350. }
  351. #define set_dentry_mark(page, mark) set_mark(page, mark, DENT_BIT_SHIFT)
  352. #define set_fsync_mark(page, mark) set_mark(page, mark, FSYNC_BIT_SHIFT)