recovery.c 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654
  1. /*
  2. * fs/f2fs/recovery.c
  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. #include <linux/fs.h>
  12. #include <linux/f2fs_fs.h>
  13. #include "f2fs.h"
  14. #include "node.h"
  15. #include "segment.h"
  16. /*
  17. * Roll forward recovery scenarios.
  18. *
  19. * [Term] F: fsync_mark, D: dentry_mark
  20. *
  21. * 1. inode(x) | CP | inode(x) | dnode(F)
  22. * -> Update the latest inode(x).
  23. *
  24. * 2. inode(x) | CP | inode(F) | dnode(F)
  25. * -> No problem.
  26. *
  27. * 3. inode(x) | CP | dnode(F) | inode(x)
  28. * -> Recover to the latest dnode(F), and drop the last inode(x)
  29. *
  30. * 4. inode(x) | CP | dnode(F) | inode(F)
  31. * -> No problem.
  32. *
  33. * 5. CP | inode(x) | dnode(F)
  34. * -> The inode(DF) was missing. Should drop this dnode(F).
  35. *
  36. * 6. CP | inode(DF) | dnode(F)
  37. * -> No problem.
  38. *
  39. * 7. CP | dnode(F) | inode(DF)
  40. * -> If f2fs_iget fails, then goto next to find inode(DF).
  41. *
  42. * 8. CP | dnode(F) | inode(x)
  43. * -> If f2fs_iget fails, then goto next to find inode(DF).
  44. * But it will fail due to no inode(DF).
  45. */
  46. static struct kmem_cache *fsync_entry_slab;
  47. bool space_for_roll_forward(struct f2fs_sb_info *sbi)
  48. {
  49. s64 nalloc = percpu_counter_sum_positive(&sbi->alloc_valid_block_count);
  50. if (sbi->last_valid_block_count + nalloc > sbi->user_block_count)
  51. return false;
  52. return true;
  53. }
  54. static struct fsync_inode_entry *get_fsync_inode(struct list_head *head,
  55. nid_t ino)
  56. {
  57. struct fsync_inode_entry *entry;
  58. list_for_each_entry(entry, head, list)
  59. if (entry->inode->i_ino == ino)
  60. return entry;
  61. return NULL;
  62. }
  63. static struct fsync_inode_entry *add_fsync_inode(struct list_head *head,
  64. struct inode *inode)
  65. {
  66. struct fsync_inode_entry *entry;
  67. entry = kmem_cache_alloc(fsync_entry_slab, GFP_F2FS_ZERO);
  68. if (!entry)
  69. return NULL;
  70. entry->inode = inode;
  71. list_add_tail(&entry->list, head);
  72. return entry;
  73. }
  74. static void del_fsync_inode(struct fsync_inode_entry *entry)
  75. {
  76. iput(entry->inode);
  77. list_del(&entry->list);
  78. kmem_cache_free(fsync_entry_slab, entry);
  79. }
  80. static int recover_dentry(struct inode *inode, struct page *ipage,
  81. struct list_head *dir_list)
  82. {
  83. struct f2fs_inode *raw_inode = F2FS_INODE(ipage);
  84. nid_t pino = le32_to_cpu(raw_inode->i_pino);
  85. struct f2fs_dir_entry *de;
  86. struct qstr name;
  87. struct page *page;
  88. struct inode *dir, *einode;
  89. struct fsync_inode_entry *entry;
  90. int err = 0;
  91. entry = get_fsync_inode(dir_list, pino);
  92. if (!entry) {
  93. dir = f2fs_iget(inode->i_sb, pino);
  94. if (IS_ERR(dir)) {
  95. err = PTR_ERR(dir);
  96. goto out;
  97. }
  98. entry = add_fsync_inode(dir_list, dir);
  99. if (!entry) {
  100. err = -ENOMEM;
  101. iput(dir);
  102. goto out;
  103. }
  104. }
  105. dir = entry->inode;
  106. if (file_enc_name(inode))
  107. return 0;
  108. name.len = le32_to_cpu(raw_inode->i_namelen);
  109. name.name = raw_inode->i_name;
  110. if (unlikely(name.len > F2FS_NAME_LEN)) {
  111. WARN_ON(1);
  112. err = -ENAMETOOLONG;
  113. goto out;
  114. }
  115. retry:
  116. de = f2fs_find_entry(dir, &name, &page);
  117. if (de && inode->i_ino == le32_to_cpu(de->ino))
  118. goto out_unmap_put;
  119. if (de) {
  120. einode = f2fs_iget(inode->i_sb, le32_to_cpu(de->ino));
  121. if (IS_ERR(einode)) {
  122. WARN_ON(1);
  123. err = PTR_ERR(einode);
  124. if (err == -ENOENT)
  125. err = -EEXIST;
  126. goto out_unmap_put;
  127. }
  128. err = acquire_orphan_inode(F2FS_I_SB(inode));
  129. if (err) {
  130. iput(einode);
  131. goto out_unmap_put;
  132. }
  133. f2fs_delete_entry(de, page, dir, einode);
  134. iput(einode);
  135. goto retry;
  136. }
  137. err = __f2fs_add_link(dir, &name, inode, inode->i_ino, inode->i_mode);
  138. goto out;
  139. out_unmap_put:
  140. f2fs_dentry_kunmap(dir, page);
  141. f2fs_put_page(page, 0);
  142. out:
  143. f2fs_msg(inode->i_sb, KERN_NOTICE,
  144. "%s: ino = %x, name = %s, dir = %lx, err = %d",
  145. __func__, ino_of_node(ipage), raw_inode->i_name,
  146. IS_ERR(dir) ? 0 : dir->i_ino, err);
  147. return err;
  148. }
  149. static void recover_inode(struct inode *inode, struct page *page)
  150. {
  151. struct f2fs_inode *raw = F2FS_INODE(page);
  152. char *name;
  153. inode->i_mode = le16_to_cpu(raw->i_mode);
  154. i_size_write(inode, le64_to_cpu(raw->i_size));
  155. inode->i_atime.tv_sec = le64_to_cpu(raw->i_mtime);
  156. inode->i_ctime.tv_sec = le64_to_cpu(raw->i_ctime);
  157. inode->i_mtime.tv_sec = le64_to_cpu(raw->i_mtime);
  158. inode->i_atime.tv_nsec = le32_to_cpu(raw->i_mtime_nsec);
  159. inode->i_ctime.tv_nsec = le32_to_cpu(raw->i_ctime_nsec);
  160. inode->i_mtime.tv_nsec = le32_to_cpu(raw->i_mtime_nsec);
  161. if (file_enc_name(inode))
  162. name = "<encrypted>";
  163. else
  164. name = F2FS_INODE(page)->i_name;
  165. f2fs_msg(inode->i_sb, KERN_NOTICE, "recover_inode: ino = %x, name = %s",
  166. ino_of_node(page), name);
  167. }
  168. static bool is_same_inode(struct inode *inode, struct page *ipage)
  169. {
  170. struct f2fs_inode *ri = F2FS_INODE(ipage);
  171. struct timespec disk;
  172. if (!IS_INODE(ipage))
  173. return true;
  174. disk.tv_sec = le64_to_cpu(ri->i_ctime);
  175. disk.tv_nsec = le32_to_cpu(ri->i_ctime_nsec);
  176. if (timespec_compare(&inode->i_ctime, &disk) > 0)
  177. return false;
  178. disk.tv_sec = le64_to_cpu(ri->i_atime);
  179. disk.tv_nsec = le32_to_cpu(ri->i_atime_nsec);
  180. if (timespec_compare(&inode->i_atime, &disk) > 0)
  181. return false;
  182. disk.tv_sec = le64_to_cpu(ri->i_mtime);
  183. disk.tv_nsec = le32_to_cpu(ri->i_mtime_nsec);
  184. if (timespec_compare(&inode->i_mtime, &disk) > 0)
  185. return false;
  186. return true;
  187. }
  188. static int find_fsync_dnodes(struct f2fs_sb_info *sbi, struct list_head *head)
  189. {
  190. unsigned long long cp_ver = cur_cp_version(F2FS_CKPT(sbi));
  191. struct curseg_info *curseg;
  192. struct inode *inode;
  193. struct page *page = NULL;
  194. block_t blkaddr;
  195. int err = 0;
  196. /* get node pages in the current segment */
  197. curseg = CURSEG_I(sbi, CURSEG_WARM_NODE);
  198. blkaddr = NEXT_FREE_BLKADDR(sbi, curseg);
  199. while (1) {
  200. struct fsync_inode_entry *entry;
  201. if (!is_valid_blkaddr(sbi, blkaddr, META_POR))
  202. return 0;
  203. page = get_tmp_page(sbi, blkaddr);
  204. if (cp_ver != cpver_of_node(page))
  205. break;
  206. if (!is_fsync_dnode(page))
  207. goto next;
  208. entry = get_fsync_inode(head, ino_of_node(page));
  209. if (entry) {
  210. if (!is_same_inode(entry->inode, page))
  211. goto next;
  212. } else {
  213. if (IS_INODE(page) && is_dent_dnode(page)) {
  214. err = recover_inode_page(sbi, page);
  215. if (err)
  216. break;
  217. }
  218. /*
  219. * CP | dnode(F) | inode(DF)
  220. * For this case, we should not give up now.
  221. */
  222. inode = f2fs_iget(sbi->sb, ino_of_node(page));
  223. if (IS_ERR(inode)) {
  224. err = PTR_ERR(inode);
  225. if (err == -ENOENT) {
  226. err = 0;
  227. goto next;
  228. }
  229. break;
  230. }
  231. /* add this fsync inode to the list */
  232. entry = add_fsync_inode(head, inode);
  233. if (!entry) {
  234. err = -ENOMEM;
  235. iput(inode);
  236. break;
  237. }
  238. }
  239. entry->blkaddr = blkaddr;
  240. if (IS_INODE(page) && is_dent_dnode(page))
  241. entry->last_dentry = blkaddr;
  242. next:
  243. /* check next segment */
  244. blkaddr = next_blkaddr_of_node(page);
  245. f2fs_put_page(page, 1);
  246. ra_meta_pages_cond(sbi, blkaddr);
  247. }
  248. f2fs_put_page(page, 1);
  249. return err;
  250. }
  251. static void destroy_fsync_dnodes(struct list_head *head)
  252. {
  253. struct fsync_inode_entry *entry, *tmp;
  254. list_for_each_entry_safe(entry, tmp, head, list)
  255. del_fsync_inode(entry);
  256. }
  257. static int check_index_in_prev_nodes(struct f2fs_sb_info *sbi,
  258. block_t blkaddr, struct dnode_of_data *dn)
  259. {
  260. struct seg_entry *sentry;
  261. unsigned int segno = GET_SEGNO(sbi, blkaddr);
  262. unsigned short blkoff = GET_BLKOFF_FROM_SEG0(sbi, blkaddr);
  263. struct f2fs_summary_block *sum_node;
  264. struct f2fs_summary sum;
  265. struct page *sum_page, *node_page;
  266. struct dnode_of_data tdn = *dn;
  267. nid_t ino, nid;
  268. struct inode *inode;
  269. unsigned int offset;
  270. block_t bidx;
  271. int i;
  272. sentry = get_seg_entry(sbi, segno);
  273. if (!f2fs_test_bit(blkoff, sentry->cur_valid_map))
  274. return 0;
  275. /* Get the previous summary */
  276. for (i = CURSEG_WARM_DATA; i <= CURSEG_COLD_DATA; i++) {
  277. struct curseg_info *curseg = CURSEG_I(sbi, i);
  278. if (curseg->segno == segno) {
  279. sum = curseg->sum_blk->entries[blkoff];
  280. goto got_it;
  281. }
  282. }
  283. sum_page = get_sum_page(sbi, segno);
  284. sum_node = (struct f2fs_summary_block *)page_address(sum_page);
  285. sum = sum_node->entries[blkoff];
  286. f2fs_put_page(sum_page, 1);
  287. got_it:
  288. /* Use the locked dnode page and inode */
  289. nid = le32_to_cpu(sum.nid);
  290. if (dn->inode->i_ino == nid) {
  291. tdn.nid = nid;
  292. if (!dn->inode_page_locked)
  293. lock_page(dn->inode_page);
  294. tdn.node_page = dn->inode_page;
  295. tdn.ofs_in_node = le16_to_cpu(sum.ofs_in_node);
  296. goto truncate_out;
  297. } else if (dn->nid == nid) {
  298. tdn.ofs_in_node = le16_to_cpu(sum.ofs_in_node);
  299. goto truncate_out;
  300. }
  301. /* Get the node page */
  302. node_page = get_node_page(sbi, nid);
  303. if (IS_ERR(node_page))
  304. return PTR_ERR(node_page);
  305. offset = ofs_of_node(node_page);
  306. ino = ino_of_node(node_page);
  307. f2fs_put_page(node_page, 1);
  308. if (ino != dn->inode->i_ino) {
  309. /* Deallocate previous index in the node page */
  310. inode = f2fs_iget(sbi->sb, ino);
  311. if (IS_ERR(inode))
  312. return PTR_ERR(inode);
  313. } else {
  314. inode = dn->inode;
  315. }
  316. bidx = start_bidx_of_node(offset, inode) + le16_to_cpu(sum.ofs_in_node);
  317. /*
  318. * if inode page is locked, unlock temporarily, but its reference
  319. * count keeps alive.
  320. */
  321. if (ino == dn->inode->i_ino && dn->inode_page_locked)
  322. unlock_page(dn->inode_page);
  323. set_new_dnode(&tdn, inode, NULL, NULL, 0);
  324. if (get_dnode_of_data(&tdn, bidx, LOOKUP_NODE))
  325. goto out;
  326. if (tdn.data_blkaddr == blkaddr)
  327. truncate_data_blocks_range(&tdn, 1);
  328. f2fs_put_dnode(&tdn);
  329. out:
  330. if (ino != dn->inode->i_ino)
  331. iput(inode);
  332. else if (dn->inode_page_locked)
  333. lock_page(dn->inode_page);
  334. return 0;
  335. truncate_out:
  336. if (datablock_addr(tdn.node_page, tdn.ofs_in_node) == blkaddr)
  337. truncate_data_blocks_range(&tdn, 1);
  338. if (dn->inode->i_ino == nid && !dn->inode_page_locked)
  339. unlock_page(dn->inode_page);
  340. return 0;
  341. }
  342. static int do_recover_data(struct f2fs_sb_info *sbi, struct inode *inode,
  343. struct page *page, block_t blkaddr)
  344. {
  345. struct dnode_of_data dn;
  346. struct node_info ni;
  347. unsigned int start, end;
  348. int err = 0, recovered = 0;
  349. /* step 1: recover xattr */
  350. if (IS_INODE(page)) {
  351. recover_inline_xattr(inode, page);
  352. } else if (f2fs_has_xattr_block(ofs_of_node(page))) {
  353. /*
  354. * Deprecated; xattr blocks should be found from cold log.
  355. * But, we should remain this for backward compatibility.
  356. */
  357. recover_xattr_data(inode, page, blkaddr);
  358. goto out;
  359. }
  360. /* step 2: recover inline data */
  361. if (recover_inline_data(inode, page))
  362. goto out;
  363. /* step 3: recover data indices */
  364. start = start_bidx_of_node(ofs_of_node(page), inode);
  365. end = start + ADDRS_PER_PAGE(page, inode);
  366. set_new_dnode(&dn, inode, NULL, NULL, 0);
  367. err = get_dnode_of_data(&dn, start, ALLOC_NODE);
  368. if (err)
  369. goto out;
  370. f2fs_wait_on_page_writeback(dn.node_page, NODE, true);
  371. get_node_info(sbi, dn.nid, &ni);
  372. f2fs_bug_on(sbi, ni.ino != ino_of_node(page));
  373. f2fs_bug_on(sbi, ofs_of_node(dn.node_page) != ofs_of_node(page));
  374. for (; start < end; start++, dn.ofs_in_node++) {
  375. block_t src, dest;
  376. src = datablock_addr(dn.node_page, dn.ofs_in_node);
  377. dest = datablock_addr(page, dn.ofs_in_node);
  378. /* skip recovering if dest is the same as src */
  379. if (src == dest)
  380. continue;
  381. /* dest is invalid, just invalidate src block */
  382. if (dest == NULL_ADDR) {
  383. truncate_data_blocks_range(&dn, 1);
  384. continue;
  385. }
  386. /*
  387. * dest is reserved block, invalidate src block
  388. * and then reserve one new block in dnode page.
  389. */
  390. if (dest == NEW_ADDR) {
  391. truncate_data_blocks_range(&dn, 1);
  392. reserve_new_block(&dn);
  393. continue;
  394. }
  395. /* dest is valid block, try to recover from src to dest */
  396. if (is_valid_blkaddr(sbi, dest, META_POR)) {
  397. if (src == NULL_ADDR) {
  398. err = reserve_new_block(&dn);
  399. #ifdef CONFIG_F2FS_FAULT_INJECTION
  400. while (err)
  401. err = reserve_new_block(&dn);
  402. #endif
  403. /* We should not get -ENOSPC */
  404. f2fs_bug_on(sbi, err);
  405. }
  406. /* Check the previous node page having this index */
  407. err = check_index_in_prev_nodes(sbi, dest, &dn);
  408. if (err)
  409. goto err;
  410. /* write dummy data page */
  411. f2fs_replace_block(sbi, &dn, src, dest,
  412. ni.version, false, false);
  413. recovered++;
  414. }
  415. }
  416. if (IS_INODE(dn.node_page))
  417. sync_inode_page(&dn);
  418. copy_node_footer(dn.node_page, page);
  419. fill_node_footer(dn.node_page, dn.nid, ni.ino,
  420. ofs_of_node(page), false);
  421. set_page_dirty(dn.node_page);
  422. err:
  423. f2fs_put_dnode(&dn);
  424. out:
  425. f2fs_msg(sbi->sb, KERN_NOTICE,
  426. "recover_data: ino = %lx, recovered = %d blocks, err = %d",
  427. inode->i_ino, recovered, err);
  428. return err;
  429. }
  430. static int recover_data(struct f2fs_sb_info *sbi, struct list_head *inode_list,
  431. struct list_head *dir_list)
  432. {
  433. unsigned long long cp_ver = cur_cp_version(F2FS_CKPT(sbi));
  434. struct curseg_info *curseg;
  435. struct page *page = NULL;
  436. int err = 0;
  437. block_t blkaddr;
  438. /* get node pages in the current segment */
  439. curseg = CURSEG_I(sbi, CURSEG_WARM_NODE);
  440. blkaddr = NEXT_FREE_BLKADDR(sbi, curseg);
  441. while (1) {
  442. struct fsync_inode_entry *entry;
  443. if (!is_valid_blkaddr(sbi, blkaddr, META_POR))
  444. break;
  445. ra_meta_pages_cond(sbi, blkaddr);
  446. page = get_tmp_page(sbi, blkaddr);
  447. if (cp_ver != cpver_of_node(page)) {
  448. f2fs_put_page(page, 1);
  449. break;
  450. }
  451. entry = get_fsync_inode(inode_list, ino_of_node(page));
  452. if (!entry)
  453. goto next;
  454. /*
  455. * inode(x) | CP | inode(x) | dnode(F)
  456. * In this case, we can lose the latest inode(x).
  457. * So, call recover_inode for the inode update.
  458. */
  459. if (IS_INODE(page))
  460. recover_inode(entry->inode, page);
  461. if (entry->last_dentry == blkaddr) {
  462. err = recover_dentry(entry->inode, page, dir_list);
  463. if (err) {
  464. f2fs_put_page(page, 1);
  465. break;
  466. }
  467. }
  468. err = do_recover_data(sbi, entry->inode, page, blkaddr);
  469. if (err) {
  470. f2fs_put_page(page, 1);
  471. break;
  472. }
  473. if (entry->blkaddr == blkaddr)
  474. del_fsync_inode(entry);
  475. next:
  476. /* check next segment */
  477. blkaddr = next_blkaddr_of_node(page);
  478. f2fs_put_page(page, 1);
  479. }
  480. if (!err)
  481. allocate_new_segments(sbi);
  482. return err;
  483. }
  484. int recover_fsync_data(struct f2fs_sb_info *sbi, bool check_only)
  485. {
  486. struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_WARM_NODE);
  487. struct list_head inode_list;
  488. struct list_head dir_list;
  489. block_t blkaddr;
  490. int err;
  491. int ret = 0;
  492. bool need_writecp = false;
  493. fsync_entry_slab = f2fs_kmem_cache_create("f2fs_fsync_inode_entry",
  494. sizeof(struct fsync_inode_entry));
  495. if (!fsync_entry_slab)
  496. return -ENOMEM;
  497. INIT_LIST_HEAD(&inode_list);
  498. INIT_LIST_HEAD(&dir_list);
  499. /* prevent checkpoint */
  500. mutex_lock(&sbi->cp_mutex);
  501. blkaddr = NEXT_FREE_BLKADDR(sbi, curseg);
  502. /* step #1: find fsynced inode numbers */
  503. err = find_fsync_dnodes(sbi, &inode_list);
  504. if (err || list_empty(&inode_list))
  505. goto out;
  506. if (check_only) {
  507. ret = 1;
  508. goto out;
  509. }
  510. need_writecp = true;
  511. /* step #2: recover data */
  512. err = recover_data(sbi, &inode_list, &dir_list);
  513. if (!err)
  514. f2fs_bug_on(sbi, !list_empty(&inode_list));
  515. out:
  516. destroy_fsync_dnodes(&inode_list);
  517. /* truncate meta pages to be used by the recovery */
  518. truncate_inode_pages_range(META_MAPPING(sbi),
  519. (loff_t)MAIN_BLKADDR(sbi) << PAGE_SHIFT, -1);
  520. if (err) {
  521. truncate_inode_pages_final(NODE_MAPPING(sbi));
  522. truncate_inode_pages_final(META_MAPPING(sbi));
  523. }
  524. clear_sbi_flag(sbi, SBI_POR_DOING);
  525. if (err) {
  526. bool invalidate = false;
  527. if (discard_next_dnode(sbi, blkaddr))
  528. invalidate = true;
  529. /* Flush all the NAT/SIT pages */
  530. while (get_pages(sbi, F2FS_DIRTY_META))
  531. sync_meta_pages(sbi, META, LONG_MAX);
  532. /* invalidate temporary meta page */
  533. if (invalidate)
  534. invalidate_mapping_pages(META_MAPPING(sbi),
  535. blkaddr, blkaddr);
  536. set_ckpt_flags(sbi->ckpt, CP_ERROR_FLAG);
  537. mutex_unlock(&sbi->cp_mutex);
  538. } else if (need_writecp) {
  539. struct cp_control cpc = {
  540. .reason = CP_RECOVERY,
  541. };
  542. mutex_unlock(&sbi->cp_mutex);
  543. err = write_checkpoint(sbi, &cpc);
  544. } else {
  545. mutex_unlock(&sbi->cp_mutex);
  546. }
  547. destroy_fsync_dnodes(&dir_list);
  548. kmem_cache_destroy(fsync_entry_slab);
  549. return ret ? ret: err;
  550. }