balloc.c 27 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942
  1. /*
  2. * linux/fs/ufs/balloc.c
  3. *
  4. * Copyright (C) 1998
  5. * Daniel Pirkl <daniel.pirkl@email.cz>
  6. * Charles University, Faculty of Mathematics and Physics
  7. *
  8. * UFS2 write support Evgeniy Dushistov <dushistov@mail.ru>, 2007
  9. */
  10. #include <linux/fs.h>
  11. #include <linux/stat.h>
  12. #include <linux/time.h>
  13. #include <linux/string.h>
  14. #include <linux/buffer_head.h>
  15. #include <linux/capability.h>
  16. #include <linux/bitops.h>
  17. #include <linux/bio.h>
  18. #include <asm/byteorder.h>
  19. #include "ufs_fs.h"
  20. #include "ufs.h"
  21. #include "swab.h"
  22. #include "util.h"
  23. #define INVBLOCK ((u64)-1L)
  24. static u64 ufs_add_fragments(struct inode *, u64, unsigned, unsigned);
  25. static u64 ufs_alloc_fragments(struct inode *, unsigned, u64, unsigned, int *);
  26. static u64 ufs_alloccg_block(struct inode *, struct ufs_cg_private_info *, u64, int *);
  27. static u64 ufs_bitmap_search (struct super_block *, struct ufs_cg_private_info *, u64, unsigned);
  28. static unsigned char ufs_fragtable_8fpb[], ufs_fragtable_other[];
  29. static void ufs_clusteracct(struct super_block *, struct ufs_cg_private_info *, unsigned, int);
  30. /*
  31. * Free 'count' fragments from fragment number 'fragment'
  32. */
  33. void ufs_free_fragments(struct inode *inode, u64 fragment, unsigned count)
  34. {
  35. struct super_block * sb;
  36. struct ufs_sb_private_info * uspi;
  37. struct ufs_cg_private_info * ucpi;
  38. struct ufs_cylinder_group * ucg;
  39. unsigned cgno, bit, end_bit, bbase, blkmap, i;
  40. u64 blkno;
  41. sb = inode->i_sb;
  42. uspi = UFS_SB(sb)->s_uspi;
  43. UFSD("ENTER, fragment %llu, count %u\n",
  44. (unsigned long long)fragment, count);
  45. if (ufs_fragnum(fragment) + count > uspi->s_fpg)
  46. ufs_error (sb, "ufs_free_fragments", "internal error");
  47. mutex_lock(&UFS_SB(sb)->s_lock);
  48. cgno = ufs_dtog(uspi, fragment);
  49. bit = ufs_dtogd(uspi, fragment);
  50. if (cgno >= uspi->s_ncg) {
  51. ufs_panic (sb, "ufs_free_fragments", "freeing blocks are outside device");
  52. goto failed;
  53. }
  54. ucpi = ufs_load_cylinder (sb, cgno);
  55. if (!ucpi)
  56. goto failed;
  57. ucg = ubh_get_ucg (UCPI_UBH(ucpi));
  58. if (!ufs_cg_chkmagic(sb, ucg)) {
  59. ufs_panic (sb, "ufs_free_fragments", "internal error, bad magic number on cg %u", cgno);
  60. goto failed;
  61. }
  62. end_bit = bit + count;
  63. bbase = ufs_blknum (bit);
  64. blkmap = ubh_blkmap (UCPI_UBH(ucpi), ucpi->c_freeoff, bbase);
  65. ufs_fragacct (sb, blkmap, ucg->cg_frsum, -1);
  66. for (i = bit; i < end_bit; i++) {
  67. if (ubh_isclr (UCPI_UBH(ucpi), ucpi->c_freeoff, i))
  68. ubh_setbit (UCPI_UBH(ucpi), ucpi->c_freeoff, i);
  69. else
  70. ufs_error (sb, "ufs_free_fragments",
  71. "bit already cleared for fragment %u", i);
  72. }
  73. fs32_add(sb, &ucg->cg_cs.cs_nffree, count);
  74. uspi->cs_total.cs_nffree += count;
  75. fs32_add(sb, &UFS_SB(sb)->fs_cs(cgno).cs_nffree, count);
  76. blkmap = ubh_blkmap (UCPI_UBH(ucpi), ucpi->c_freeoff, bbase);
  77. ufs_fragacct(sb, blkmap, ucg->cg_frsum, 1);
  78. /*
  79. * Trying to reassemble free fragments into block
  80. */
  81. blkno = ufs_fragstoblks (bbase);
  82. if (ubh_isblockset(UCPI_UBH(ucpi), ucpi->c_freeoff, blkno)) {
  83. fs32_sub(sb, &ucg->cg_cs.cs_nffree, uspi->s_fpb);
  84. uspi->cs_total.cs_nffree -= uspi->s_fpb;
  85. fs32_sub(sb, &UFS_SB(sb)->fs_cs(cgno).cs_nffree, uspi->s_fpb);
  86. if ((UFS_SB(sb)->s_flags & UFS_CG_MASK) == UFS_CG_44BSD)
  87. ufs_clusteracct (sb, ucpi, blkno, 1);
  88. fs32_add(sb, &ucg->cg_cs.cs_nbfree, 1);
  89. uspi->cs_total.cs_nbfree++;
  90. fs32_add(sb, &UFS_SB(sb)->fs_cs(cgno).cs_nbfree, 1);
  91. if (uspi->fs_magic != UFS2_MAGIC) {
  92. unsigned cylno = ufs_cbtocylno (bbase);
  93. fs16_add(sb, &ubh_cg_blks(ucpi, cylno,
  94. ufs_cbtorpos(bbase)), 1);
  95. fs32_add(sb, &ubh_cg_blktot(ucpi, cylno), 1);
  96. }
  97. }
  98. ubh_mark_buffer_dirty (USPI_UBH(uspi));
  99. ubh_mark_buffer_dirty (UCPI_UBH(ucpi));
  100. if (sb->s_flags & MS_SYNCHRONOUS)
  101. ubh_sync_block(UCPI_UBH(ucpi));
  102. ufs_mark_sb_dirty(sb);
  103. mutex_unlock(&UFS_SB(sb)->s_lock);
  104. UFSD("EXIT\n");
  105. return;
  106. failed:
  107. mutex_unlock(&UFS_SB(sb)->s_lock);
  108. UFSD("EXIT (FAILED)\n");
  109. return;
  110. }
  111. /*
  112. * Free 'count' fragments from fragment number 'fragment' (free whole blocks)
  113. */
  114. void ufs_free_blocks(struct inode *inode, u64 fragment, unsigned count)
  115. {
  116. struct super_block * sb;
  117. struct ufs_sb_private_info * uspi;
  118. struct ufs_cg_private_info * ucpi;
  119. struct ufs_cylinder_group * ucg;
  120. unsigned overflow, cgno, bit, end_bit, i;
  121. u64 blkno;
  122. sb = inode->i_sb;
  123. uspi = UFS_SB(sb)->s_uspi;
  124. UFSD("ENTER, fragment %llu, count %u\n",
  125. (unsigned long long)fragment, count);
  126. if ((fragment & uspi->s_fpbmask) || (count & uspi->s_fpbmask)) {
  127. ufs_error (sb, "ufs_free_blocks", "internal error, "
  128. "fragment %llu, count %u\n",
  129. (unsigned long long)fragment, count);
  130. goto failed;
  131. }
  132. mutex_lock(&UFS_SB(sb)->s_lock);
  133. do_more:
  134. overflow = 0;
  135. cgno = ufs_dtog(uspi, fragment);
  136. bit = ufs_dtogd(uspi, fragment);
  137. if (cgno >= uspi->s_ncg) {
  138. ufs_panic (sb, "ufs_free_blocks", "freeing blocks are outside device");
  139. goto failed_unlock;
  140. }
  141. end_bit = bit + count;
  142. if (end_bit > uspi->s_fpg) {
  143. overflow = bit + count - uspi->s_fpg;
  144. count -= overflow;
  145. end_bit -= overflow;
  146. }
  147. ucpi = ufs_load_cylinder (sb, cgno);
  148. if (!ucpi)
  149. goto failed_unlock;
  150. ucg = ubh_get_ucg (UCPI_UBH(ucpi));
  151. if (!ufs_cg_chkmagic(sb, ucg)) {
  152. ufs_panic (sb, "ufs_free_blocks", "internal error, bad magic number on cg %u", cgno);
  153. goto failed_unlock;
  154. }
  155. for (i = bit; i < end_bit; i += uspi->s_fpb) {
  156. blkno = ufs_fragstoblks(i);
  157. if (ubh_isblockset(UCPI_UBH(ucpi), ucpi->c_freeoff, blkno)) {
  158. ufs_error(sb, "ufs_free_blocks", "freeing free fragment");
  159. }
  160. ubh_setblock(UCPI_UBH(ucpi), ucpi->c_freeoff, blkno);
  161. if ((UFS_SB(sb)->s_flags & UFS_CG_MASK) == UFS_CG_44BSD)
  162. ufs_clusteracct (sb, ucpi, blkno, 1);
  163. fs32_add(sb, &ucg->cg_cs.cs_nbfree, 1);
  164. uspi->cs_total.cs_nbfree++;
  165. fs32_add(sb, &UFS_SB(sb)->fs_cs(cgno).cs_nbfree, 1);
  166. if (uspi->fs_magic != UFS2_MAGIC) {
  167. unsigned cylno = ufs_cbtocylno(i);
  168. fs16_add(sb, &ubh_cg_blks(ucpi, cylno,
  169. ufs_cbtorpos(i)), 1);
  170. fs32_add(sb, &ubh_cg_blktot(ucpi, cylno), 1);
  171. }
  172. }
  173. ubh_mark_buffer_dirty (USPI_UBH(uspi));
  174. ubh_mark_buffer_dirty (UCPI_UBH(ucpi));
  175. if (sb->s_flags & MS_SYNCHRONOUS)
  176. ubh_sync_block(UCPI_UBH(ucpi));
  177. if (overflow) {
  178. fragment += count;
  179. count = overflow;
  180. goto do_more;
  181. }
  182. ufs_mark_sb_dirty(sb);
  183. mutex_unlock(&UFS_SB(sb)->s_lock);
  184. UFSD("EXIT\n");
  185. return;
  186. failed_unlock:
  187. mutex_unlock(&UFS_SB(sb)->s_lock);
  188. failed:
  189. UFSD("EXIT (FAILED)\n");
  190. return;
  191. }
  192. /*
  193. * Modify inode page cache in such way:
  194. * have - blocks with b_blocknr equal to oldb...oldb+count-1
  195. * get - blocks with b_blocknr equal to newb...newb+count-1
  196. * also we suppose that oldb...oldb+count-1 blocks
  197. * situated at the end of file.
  198. *
  199. * We can come here from ufs_writepage or ufs_prepare_write,
  200. * locked_page is argument of these functions, so we already lock it.
  201. */
  202. static void ufs_change_blocknr(struct inode *inode, sector_t beg,
  203. unsigned int count, sector_t oldb,
  204. sector_t newb, struct page *locked_page)
  205. {
  206. const unsigned blks_per_page =
  207. 1 << (PAGE_SHIFT - inode->i_blkbits);
  208. const unsigned mask = blks_per_page - 1;
  209. struct address_space * const mapping = inode->i_mapping;
  210. pgoff_t index, cur_index, last_index;
  211. unsigned pos, j, lblock;
  212. sector_t end, i;
  213. struct page *page;
  214. struct buffer_head *head, *bh;
  215. UFSD("ENTER, ino %lu, count %u, oldb %llu, newb %llu\n",
  216. inode->i_ino, count,
  217. (unsigned long long)oldb, (unsigned long long)newb);
  218. BUG_ON(!locked_page);
  219. BUG_ON(!PageLocked(locked_page));
  220. cur_index = locked_page->index;
  221. end = count + beg;
  222. last_index = end >> (PAGE_SHIFT - inode->i_blkbits);
  223. for (i = beg; i < end; i = (i | mask) + 1) {
  224. index = i >> (PAGE_SHIFT - inode->i_blkbits);
  225. if (likely(cur_index != index)) {
  226. page = ufs_get_locked_page(mapping, index);
  227. if (!page)/* it was truncated */
  228. continue;
  229. if (IS_ERR(page)) {/* or EIO */
  230. ufs_error(inode->i_sb, __func__,
  231. "read of page %llu failed\n",
  232. (unsigned long long)index);
  233. continue;
  234. }
  235. } else
  236. page = locked_page;
  237. head = page_buffers(page);
  238. bh = head;
  239. pos = i & mask;
  240. for (j = 0; j < pos; ++j)
  241. bh = bh->b_this_page;
  242. if (unlikely(index == last_index))
  243. lblock = end & mask;
  244. else
  245. lblock = blks_per_page;
  246. do {
  247. if (j >= lblock)
  248. break;
  249. pos = (i - beg) + j;
  250. if (!buffer_mapped(bh))
  251. map_bh(bh, inode->i_sb, oldb + pos);
  252. if (!buffer_uptodate(bh)) {
  253. ll_rw_block(REQ_OP_READ, 0, 1, &bh);
  254. wait_on_buffer(bh);
  255. if (!buffer_uptodate(bh)) {
  256. ufs_error(inode->i_sb, __func__,
  257. "read of block failed\n");
  258. break;
  259. }
  260. }
  261. UFSD(" change from %llu to %llu, pos %u\n",
  262. (unsigned long long)(pos + oldb),
  263. (unsigned long long)(pos + newb), pos);
  264. bh->b_blocknr = newb + pos;
  265. clean_bdev_bh_alias(bh);
  266. mark_buffer_dirty(bh);
  267. ++j;
  268. bh = bh->b_this_page;
  269. } while (bh != head);
  270. if (likely(cur_index != index))
  271. ufs_put_locked_page(page);
  272. }
  273. UFSD("EXIT\n");
  274. }
  275. static void ufs_clear_frags(struct inode *inode, sector_t beg, unsigned int n,
  276. int sync)
  277. {
  278. struct buffer_head *bh;
  279. sector_t end = beg + n;
  280. for (; beg < end; ++beg) {
  281. bh = sb_getblk(inode->i_sb, beg);
  282. lock_buffer(bh);
  283. memset(bh->b_data, 0, inode->i_sb->s_blocksize);
  284. set_buffer_uptodate(bh);
  285. mark_buffer_dirty(bh);
  286. unlock_buffer(bh);
  287. if (IS_SYNC(inode) || sync)
  288. sync_dirty_buffer(bh);
  289. brelse(bh);
  290. }
  291. }
  292. u64 ufs_new_fragments(struct inode *inode, void *p, u64 fragment,
  293. u64 goal, unsigned count, int *err,
  294. struct page *locked_page)
  295. {
  296. struct super_block * sb;
  297. struct ufs_sb_private_info * uspi;
  298. struct ufs_super_block_first * usb1;
  299. unsigned cgno, oldcount, newcount;
  300. u64 tmp, request, result;
  301. UFSD("ENTER, ino %lu, fragment %llu, goal %llu, count %u\n",
  302. inode->i_ino, (unsigned long long)fragment,
  303. (unsigned long long)goal, count);
  304. sb = inode->i_sb;
  305. uspi = UFS_SB(sb)->s_uspi;
  306. usb1 = ubh_get_usb_first(uspi);
  307. *err = -ENOSPC;
  308. mutex_lock(&UFS_SB(sb)->s_lock);
  309. tmp = ufs_data_ptr_to_cpu(sb, p);
  310. if (count + ufs_fragnum(fragment) > uspi->s_fpb) {
  311. ufs_warning(sb, "ufs_new_fragments", "internal warning"
  312. " fragment %llu, count %u",
  313. (unsigned long long)fragment, count);
  314. count = uspi->s_fpb - ufs_fragnum(fragment);
  315. }
  316. oldcount = ufs_fragnum (fragment);
  317. newcount = oldcount + count;
  318. /*
  319. * Somebody else has just allocated our fragments
  320. */
  321. if (oldcount) {
  322. if (!tmp) {
  323. ufs_error(sb, "ufs_new_fragments", "internal error, "
  324. "fragment %llu, tmp %llu\n",
  325. (unsigned long long)fragment,
  326. (unsigned long long)tmp);
  327. mutex_unlock(&UFS_SB(sb)->s_lock);
  328. return INVBLOCK;
  329. }
  330. if (fragment < UFS_I(inode)->i_lastfrag) {
  331. UFSD("EXIT (ALREADY ALLOCATED)\n");
  332. mutex_unlock(&UFS_SB(sb)->s_lock);
  333. return 0;
  334. }
  335. }
  336. else {
  337. if (tmp) {
  338. UFSD("EXIT (ALREADY ALLOCATED)\n");
  339. mutex_unlock(&UFS_SB(sb)->s_lock);
  340. return 0;
  341. }
  342. }
  343. /*
  344. * There is not enough space for user on the device
  345. */
  346. if (!capable(CAP_SYS_RESOURCE) && ufs_freespace(uspi, UFS_MINFREE) <= 0) {
  347. mutex_unlock(&UFS_SB(sb)->s_lock);
  348. UFSD("EXIT (FAILED)\n");
  349. return 0;
  350. }
  351. if (goal >= uspi->s_size)
  352. goal = 0;
  353. if (goal == 0)
  354. cgno = ufs_inotocg (inode->i_ino);
  355. else
  356. cgno = ufs_dtog(uspi, goal);
  357. /*
  358. * allocate new fragment
  359. */
  360. if (oldcount == 0) {
  361. result = ufs_alloc_fragments (inode, cgno, goal, count, err);
  362. if (result) {
  363. ufs_clear_frags(inode, result + oldcount,
  364. newcount - oldcount, locked_page != NULL);
  365. write_seqlock(&UFS_I(inode)->meta_lock);
  366. ufs_cpu_to_data_ptr(sb, p, result);
  367. write_sequnlock(&UFS_I(inode)->meta_lock);
  368. *err = 0;
  369. UFS_I(inode)->i_lastfrag =
  370. max(UFS_I(inode)->i_lastfrag, fragment + count);
  371. }
  372. mutex_unlock(&UFS_SB(sb)->s_lock);
  373. UFSD("EXIT, result %llu\n", (unsigned long long)result);
  374. return result;
  375. }
  376. /*
  377. * resize block
  378. */
  379. result = ufs_add_fragments(inode, tmp, oldcount, newcount);
  380. if (result) {
  381. *err = 0;
  382. UFS_I(inode)->i_lastfrag = max(UFS_I(inode)->i_lastfrag,
  383. fragment + count);
  384. ufs_clear_frags(inode, result + oldcount, newcount - oldcount,
  385. locked_page != NULL);
  386. mutex_unlock(&UFS_SB(sb)->s_lock);
  387. UFSD("EXIT, result %llu\n", (unsigned long long)result);
  388. return result;
  389. }
  390. /*
  391. * allocate new block and move data
  392. */
  393. switch (fs32_to_cpu(sb, usb1->fs_optim)) {
  394. case UFS_OPTSPACE:
  395. request = newcount;
  396. if (uspi->s_minfree < 5 || uspi->cs_total.cs_nffree
  397. > uspi->s_dsize * uspi->s_minfree / (2 * 100))
  398. break;
  399. usb1->fs_optim = cpu_to_fs32(sb, UFS_OPTTIME);
  400. break;
  401. default:
  402. usb1->fs_optim = cpu_to_fs32(sb, UFS_OPTTIME);
  403. case UFS_OPTTIME:
  404. request = uspi->s_fpb;
  405. if (uspi->cs_total.cs_nffree < uspi->s_dsize *
  406. (uspi->s_minfree - 2) / 100)
  407. break;
  408. usb1->fs_optim = cpu_to_fs32(sb, UFS_OPTTIME);
  409. break;
  410. }
  411. result = ufs_alloc_fragments (inode, cgno, goal, request, err);
  412. if (result) {
  413. ufs_clear_frags(inode, result + oldcount, newcount - oldcount,
  414. locked_page != NULL);
  415. ufs_change_blocknr(inode, fragment - oldcount, oldcount,
  416. uspi->s_sbbase + tmp,
  417. uspi->s_sbbase + result, locked_page);
  418. write_seqlock(&UFS_I(inode)->meta_lock);
  419. ufs_cpu_to_data_ptr(sb, p, result);
  420. write_sequnlock(&UFS_I(inode)->meta_lock);
  421. *err = 0;
  422. UFS_I(inode)->i_lastfrag = max(UFS_I(inode)->i_lastfrag,
  423. fragment + count);
  424. mutex_unlock(&UFS_SB(sb)->s_lock);
  425. if (newcount < request)
  426. ufs_free_fragments (inode, result + newcount, request - newcount);
  427. ufs_free_fragments (inode, tmp, oldcount);
  428. UFSD("EXIT, result %llu\n", (unsigned long long)result);
  429. return result;
  430. }
  431. mutex_unlock(&UFS_SB(sb)->s_lock);
  432. UFSD("EXIT (FAILED)\n");
  433. return 0;
  434. }
  435. static u64 ufs_add_fragments(struct inode *inode, u64 fragment,
  436. unsigned oldcount, unsigned newcount)
  437. {
  438. struct super_block * sb;
  439. struct ufs_sb_private_info * uspi;
  440. struct ufs_cg_private_info * ucpi;
  441. struct ufs_cylinder_group * ucg;
  442. unsigned cgno, fragno, fragoff, count, fragsize, i;
  443. UFSD("ENTER, fragment %llu, oldcount %u, newcount %u\n",
  444. (unsigned long long)fragment, oldcount, newcount);
  445. sb = inode->i_sb;
  446. uspi = UFS_SB(sb)->s_uspi;
  447. count = newcount - oldcount;
  448. cgno = ufs_dtog(uspi, fragment);
  449. if (fs32_to_cpu(sb, UFS_SB(sb)->fs_cs(cgno).cs_nffree) < count)
  450. return 0;
  451. if ((ufs_fragnum (fragment) + newcount) > uspi->s_fpb)
  452. return 0;
  453. ucpi = ufs_load_cylinder (sb, cgno);
  454. if (!ucpi)
  455. return 0;
  456. ucg = ubh_get_ucg (UCPI_UBH(ucpi));
  457. if (!ufs_cg_chkmagic(sb, ucg)) {
  458. ufs_panic (sb, "ufs_add_fragments",
  459. "internal error, bad magic number on cg %u", cgno);
  460. return 0;
  461. }
  462. fragno = ufs_dtogd(uspi, fragment);
  463. fragoff = ufs_fragnum (fragno);
  464. for (i = oldcount; i < newcount; i++)
  465. if (ubh_isclr (UCPI_UBH(ucpi), ucpi->c_freeoff, fragno + i))
  466. return 0;
  467. /*
  468. * Block can be extended
  469. */
  470. ucg->cg_time = cpu_to_fs32(sb, get_seconds());
  471. for (i = newcount; i < (uspi->s_fpb - fragoff); i++)
  472. if (ubh_isclr (UCPI_UBH(ucpi), ucpi->c_freeoff, fragno + i))
  473. break;
  474. fragsize = i - oldcount;
  475. if (!fs32_to_cpu(sb, ucg->cg_frsum[fragsize]))
  476. ufs_panic (sb, "ufs_add_fragments",
  477. "internal error or corrupted bitmap on cg %u", cgno);
  478. fs32_sub(sb, &ucg->cg_frsum[fragsize], 1);
  479. if (fragsize != count)
  480. fs32_add(sb, &ucg->cg_frsum[fragsize - count], 1);
  481. for (i = oldcount; i < newcount; i++)
  482. ubh_clrbit (UCPI_UBH(ucpi), ucpi->c_freeoff, fragno + i);
  483. fs32_sub(sb, &ucg->cg_cs.cs_nffree, count);
  484. fs32_sub(sb, &UFS_SB(sb)->fs_cs(cgno).cs_nffree, count);
  485. uspi->cs_total.cs_nffree -= count;
  486. ubh_mark_buffer_dirty (USPI_UBH(uspi));
  487. ubh_mark_buffer_dirty (UCPI_UBH(ucpi));
  488. if (sb->s_flags & MS_SYNCHRONOUS)
  489. ubh_sync_block(UCPI_UBH(ucpi));
  490. ufs_mark_sb_dirty(sb);
  491. UFSD("EXIT, fragment %llu\n", (unsigned long long)fragment);
  492. return fragment;
  493. }
  494. #define UFS_TEST_FREE_SPACE_CG \
  495. ucg = (struct ufs_cylinder_group *) UFS_SB(sb)->s_ucg[cgno]->b_data; \
  496. if (fs32_to_cpu(sb, ucg->cg_cs.cs_nbfree)) \
  497. goto cg_found; \
  498. for (k = count; k < uspi->s_fpb; k++) \
  499. if (fs32_to_cpu(sb, ucg->cg_frsum[k])) \
  500. goto cg_found;
  501. static u64 ufs_alloc_fragments(struct inode *inode, unsigned cgno,
  502. u64 goal, unsigned count, int *err)
  503. {
  504. struct super_block * sb;
  505. struct ufs_sb_private_info * uspi;
  506. struct ufs_cg_private_info * ucpi;
  507. struct ufs_cylinder_group * ucg;
  508. unsigned oldcg, i, j, k, allocsize;
  509. u64 result;
  510. UFSD("ENTER, ino %lu, cgno %u, goal %llu, count %u\n",
  511. inode->i_ino, cgno, (unsigned long long)goal, count);
  512. sb = inode->i_sb;
  513. uspi = UFS_SB(sb)->s_uspi;
  514. oldcg = cgno;
  515. /*
  516. * 1. searching on preferred cylinder group
  517. */
  518. UFS_TEST_FREE_SPACE_CG
  519. /*
  520. * 2. quadratic rehash
  521. */
  522. for (j = 1; j < uspi->s_ncg; j *= 2) {
  523. cgno += j;
  524. if (cgno >= uspi->s_ncg)
  525. cgno -= uspi->s_ncg;
  526. UFS_TEST_FREE_SPACE_CG
  527. }
  528. /*
  529. * 3. brute force search
  530. * We start at i = 2 ( 0 is checked at 1.step, 1 at 2.step )
  531. */
  532. cgno = (oldcg + 1) % uspi->s_ncg;
  533. for (j = 2; j < uspi->s_ncg; j++) {
  534. cgno++;
  535. if (cgno >= uspi->s_ncg)
  536. cgno = 0;
  537. UFS_TEST_FREE_SPACE_CG
  538. }
  539. UFSD("EXIT (FAILED)\n");
  540. return 0;
  541. cg_found:
  542. ucpi = ufs_load_cylinder (sb, cgno);
  543. if (!ucpi)
  544. return 0;
  545. ucg = ubh_get_ucg (UCPI_UBH(ucpi));
  546. if (!ufs_cg_chkmagic(sb, ucg))
  547. ufs_panic (sb, "ufs_alloc_fragments",
  548. "internal error, bad magic number on cg %u", cgno);
  549. ucg->cg_time = cpu_to_fs32(sb, get_seconds());
  550. if (count == uspi->s_fpb) {
  551. result = ufs_alloccg_block (inode, ucpi, goal, err);
  552. if (result == INVBLOCK)
  553. return 0;
  554. goto succed;
  555. }
  556. for (allocsize = count; allocsize < uspi->s_fpb; allocsize++)
  557. if (fs32_to_cpu(sb, ucg->cg_frsum[allocsize]) != 0)
  558. break;
  559. if (allocsize == uspi->s_fpb) {
  560. result = ufs_alloccg_block (inode, ucpi, goal, err);
  561. if (result == INVBLOCK)
  562. return 0;
  563. goal = ufs_dtogd(uspi, result);
  564. for (i = count; i < uspi->s_fpb; i++)
  565. ubh_setbit (UCPI_UBH(ucpi), ucpi->c_freeoff, goal + i);
  566. i = uspi->s_fpb - count;
  567. fs32_add(sb, &ucg->cg_cs.cs_nffree, i);
  568. uspi->cs_total.cs_nffree += i;
  569. fs32_add(sb, &UFS_SB(sb)->fs_cs(cgno).cs_nffree, i);
  570. fs32_add(sb, &ucg->cg_frsum[i], 1);
  571. goto succed;
  572. }
  573. result = ufs_bitmap_search (sb, ucpi, goal, allocsize);
  574. if (result == INVBLOCK)
  575. return 0;
  576. for (i = 0; i < count; i++)
  577. ubh_clrbit (UCPI_UBH(ucpi), ucpi->c_freeoff, result + i);
  578. fs32_sub(sb, &ucg->cg_cs.cs_nffree, count);
  579. uspi->cs_total.cs_nffree -= count;
  580. fs32_sub(sb, &UFS_SB(sb)->fs_cs(cgno).cs_nffree, count);
  581. fs32_sub(sb, &ucg->cg_frsum[allocsize], 1);
  582. if (count != allocsize)
  583. fs32_add(sb, &ucg->cg_frsum[allocsize - count], 1);
  584. succed:
  585. ubh_mark_buffer_dirty (USPI_UBH(uspi));
  586. ubh_mark_buffer_dirty (UCPI_UBH(ucpi));
  587. if (sb->s_flags & MS_SYNCHRONOUS)
  588. ubh_sync_block(UCPI_UBH(ucpi));
  589. ufs_mark_sb_dirty(sb);
  590. result += cgno * uspi->s_fpg;
  591. UFSD("EXIT3, result %llu\n", (unsigned long long)result);
  592. return result;
  593. }
  594. static u64 ufs_alloccg_block(struct inode *inode,
  595. struct ufs_cg_private_info *ucpi,
  596. u64 goal, int *err)
  597. {
  598. struct super_block * sb;
  599. struct ufs_sb_private_info * uspi;
  600. struct ufs_cylinder_group * ucg;
  601. u64 result, blkno;
  602. UFSD("ENTER, goal %llu\n", (unsigned long long)goal);
  603. sb = inode->i_sb;
  604. uspi = UFS_SB(sb)->s_uspi;
  605. ucg = ubh_get_ucg(UCPI_UBH(ucpi));
  606. if (goal == 0) {
  607. goal = ucpi->c_rotor;
  608. goto norot;
  609. }
  610. goal = ufs_blknum (goal);
  611. goal = ufs_dtogd(uspi, goal);
  612. /*
  613. * If the requested block is available, use it.
  614. */
  615. if (ubh_isblockset(UCPI_UBH(ucpi), ucpi->c_freeoff, ufs_fragstoblks(goal))) {
  616. result = goal;
  617. goto gotit;
  618. }
  619. norot:
  620. result = ufs_bitmap_search (sb, ucpi, goal, uspi->s_fpb);
  621. if (result == INVBLOCK)
  622. return INVBLOCK;
  623. ucpi->c_rotor = result;
  624. gotit:
  625. blkno = ufs_fragstoblks(result);
  626. ubh_clrblock (UCPI_UBH(ucpi), ucpi->c_freeoff, blkno);
  627. if ((UFS_SB(sb)->s_flags & UFS_CG_MASK) == UFS_CG_44BSD)
  628. ufs_clusteracct (sb, ucpi, blkno, -1);
  629. fs32_sub(sb, &ucg->cg_cs.cs_nbfree, 1);
  630. uspi->cs_total.cs_nbfree--;
  631. fs32_sub(sb, &UFS_SB(sb)->fs_cs(ucpi->c_cgx).cs_nbfree, 1);
  632. if (uspi->fs_magic != UFS2_MAGIC) {
  633. unsigned cylno = ufs_cbtocylno((unsigned)result);
  634. fs16_sub(sb, &ubh_cg_blks(ucpi, cylno,
  635. ufs_cbtorpos((unsigned)result)), 1);
  636. fs32_sub(sb, &ubh_cg_blktot(ucpi, cylno), 1);
  637. }
  638. UFSD("EXIT, result %llu\n", (unsigned long long)result);
  639. return result;
  640. }
  641. static unsigned ubh_scanc(struct ufs_sb_private_info *uspi,
  642. struct ufs_buffer_head *ubh,
  643. unsigned begin, unsigned size,
  644. unsigned char *table, unsigned char mask)
  645. {
  646. unsigned rest, offset;
  647. unsigned char *cp;
  648. offset = begin & ~uspi->s_fmask;
  649. begin >>= uspi->s_fshift;
  650. for (;;) {
  651. if ((offset + size) < uspi->s_fsize)
  652. rest = size;
  653. else
  654. rest = uspi->s_fsize - offset;
  655. size -= rest;
  656. cp = ubh->bh[begin]->b_data + offset;
  657. while ((table[*cp++] & mask) == 0 && --rest)
  658. ;
  659. if (rest || !size)
  660. break;
  661. begin++;
  662. offset = 0;
  663. }
  664. return (size + rest);
  665. }
  666. /*
  667. * Find a block of the specified size in the specified cylinder group.
  668. * @sp: pointer to super block
  669. * @ucpi: pointer to cylinder group info
  670. * @goal: near which block we want find new one
  671. * @count: specified size
  672. */
  673. static u64 ufs_bitmap_search(struct super_block *sb,
  674. struct ufs_cg_private_info *ucpi,
  675. u64 goal, unsigned count)
  676. {
  677. /*
  678. * Bit patterns for identifying fragments in the block map
  679. * used as ((map & mask_arr) == want_arr)
  680. */
  681. static const int mask_arr[9] = {
  682. 0x3, 0x7, 0xf, 0x1f, 0x3f, 0x7f, 0xff, 0x1ff, 0x3ff
  683. };
  684. static const int want_arr[9] = {
  685. 0x0, 0x2, 0x6, 0xe, 0x1e, 0x3e, 0x7e, 0xfe, 0x1fe
  686. };
  687. struct ufs_sb_private_info *uspi = UFS_SB(sb)->s_uspi;
  688. unsigned start, length, loc;
  689. unsigned pos, want, blockmap, mask, end;
  690. u64 result;
  691. UFSD("ENTER, cg %u, goal %llu, count %u\n", ucpi->c_cgx,
  692. (unsigned long long)goal, count);
  693. if (goal)
  694. start = ufs_dtogd(uspi, goal) >> 3;
  695. else
  696. start = ucpi->c_frotor >> 3;
  697. length = ((uspi->s_fpg + 7) >> 3) - start;
  698. loc = ubh_scanc(uspi, UCPI_UBH(ucpi), ucpi->c_freeoff + start, length,
  699. (uspi->s_fpb == 8) ? ufs_fragtable_8fpb : ufs_fragtable_other,
  700. 1 << (count - 1 + (uspi->s_fpb & 7)));
  701. if (loc == 0) {
  702. length = start + 1;
  703. loc = ubh_scanc(uspi, UCPI_UBH(ucpi), ucpi->c_freeoff, length,
  704. (uspi->s_fpb == 8) ? ufs_fragtable_8fpb :
  705. ufs_fragtable_other,
  706. 1 << (count - 1 + (uspi->s_fpb & 7)));
  707. if (loc == 0) {
  708. ufs_error(sb, "ufs_bitmap_search",
  709. "bitmap corrupted on cg %u, start %u,"
  710. " length %u, count %u, freeoff %u\n",
  711. ucpi->c_cgx, start, length, count,
  712. ucpi->c_freeoff);
  713. return INVBLOCK;
  714. }
  715. start = 0;
  716. }
  717. result = (start + length - loc) << 3;
  718. ucpi->c_frotor = result;
  719. /*
  720. * found the byte in the map
  721. */
  722. for (end = result + 8; result < end; result += uspi->s_fpb) {
  723. blockmap = ubh_blkmap(UCPI_UBH(ucpi), ucpi->c_freeoff, result);
  724. blockmap <<= 1;
  725. mask = mask_arr[count];
  726. want = want_arr[count];
  727. for (pos = 0; pos <= uspi->s_fpb - count; pos++) {
  728. if ((blockmap & mask) == want) {
  729. UFSD("EXIT, result %llu\n",
  730. (unsigned long long)result);
  731. return result + pos;
  732. }
  733. mask <<= 1;
  734. want <<= 1;
  735. }
  736. }
  737. ufs_error(sb, "ufs_bitmap_search", "block not in map on cg %u\n",
  738. ucpi->c_cgx);
  739. UFSD("EXIT (FAILED)\n");
  740. return INVBLOCK;
  741. }
  742. static void ufs_clusteracct(struct super_block * sb,
  743. struct ufs_cg_private_info * ucpi, unsigned blkno, int cnt)
  744. {
  745. struct ufs_sb_private_info * uspi;
  746. int i, start, end, forw, back;
  747. uspi = UFS_SB(sb)->s_uspi;
  748. if (uspi->s_contigsumsize <= 0)
  749. return;
  750. if (cnt > 0)
  751. ubh_setbit(UCPI_UBH(ucpi), ucpi->c_clusteroff, blkno);
  752. else
  753. ubh_clrbit(UCPI_UBH(ucpi), ucpi->c_clusteroff, blkno);
  754. /*
  755. * Find the size of the cluster going forward.
  756. */
  757. start = blkno + 1;
  758. end = start + uspi->s_contigsumsize;
  759. if ( end >= ucpi->c_nclusterblks)
  760. end = ucpi->c_nclusterblks;
  761. i = ubh_find_next_zero_bit (UCPI_UBH(ucpi), ucpi->c_clusteroff, end, start);
  762. if (i > end)
  763. i = end;
  764. forw = i - start;
  765. /*
  766. * Find the size of the cluster going backward.
  767. */
  768. start = blkno - 1;
  769. end = start - uspi->s_contigsumsize;
  770. if (end < 0 )
  771. end = -1;
  772. i = ubh_find_last_zero_bit (UCPI_UBH(ucpi), ucpi->c_clusteroff, start, end);
  773. if ( i < end)
  774. i = end;
  775. back = start - i;
  776. /*
  777. * Account for old cluster and the possibly new forward and
  778. * back clusters.
  779. */
  780. i = back + forw + 1;
  781. if (i > uspi->s_contigsumsize)
  782. i = uspi->s_contigsumsize;
  783. fs32_add(sb, (__fs32*)ubh_get_addr(UCPI_UBH(ucpi), ucpi->c_clustersumoff + (i << 2)), cnt);
  784. if (back > 0)
  785. fs32_sub(sb, (__fs32*)ubh_get_addr(UCPI_UBH(ucpi), ucpi->c_clustersumoff + (back << 2)), cnt);
  786. if (forw > 0)
  787. fs32_sub(sb, (__fs32*)ubh_get_addr(UCPI_UBH(ucpi), ucpi->c_clustersumoff + (forw << 2)), cnt);
  788. }
  789. static unsigned char ufs_fragtable_8fpb[] = {
  790. 0x00, 0x01, 0x01, 0x02, 0x01, 0x01, 0x02, 0x04, 0x01, 0x01, 0x01, 0x03, 0x02, 0x03, 0x04, 0x08,
  791. 0x01, 0x01, 0x01, 0x03, 0x01, 0x01, 0x03, 0x05, 0x02, 0x03, 0x03, 0x02, 0x04, 0x05, 0x08, 0x10,
  792. 0x01, 0x01, 0x01, 0x03, 0x01, 0x01, 0x03, 0x05, 0x01, 0x01, 0x01, 0x03, 0x03, 0x03, 0x05, 0x09,
  793. 0x02, 0x03, 0x03, 0x02, 0x03, 0x03, 0x02, 0x06, 0x04, 0x05, 0x05, 0x06, 0x08, 0x09, 0x10, 0x20,
  794. 0x01, 0x01, 0x01, 0x03, 0x01, 0x01, 0x03, 0x05, 0x01, 0x01, 0x01, 0x03, 0x03, 0x03, 0x05, 0x09,
  795. 0x01, 0x01, 0x01, 0x03, 0x01, 0x01, 0x03, 0x05, 0x03, 0x03, 0x03, 0x03, 0x05, 0x05, 0x09, 0x11,
  796. 0x02, 0x03, 0x03, 0x02, 0x03, 0x03, 0x02, 0x06, 0x03, 0x03, 0x03, 0x03, 0x02, 0x03, 0x06, 0x0A,
  797. 0x04, 0x05, 0x05, 0x06, 0x05, 0x05, 0x06, 0x04, 0x08, 0x09, 0x09, 0x0A, 0x10, 0x11, 0x20, 0x40,
  798. 0x01, 0x01, 0x01, 0x03, 0x01, 0x01, 0x03, 0x05, 0x01, 0x01, 0x01, 0x03, 0x03, 0x03, 0x05, 0x09,
  799. 0x01, 0x01, 0x01, 0x03, 0x01, 0x01, 0x03, 0x05, 0x03, 0x03, 0x03, 0x03, 0x05, 0x05, 0x09, 0x11,
  800. 0x01, 0x01, 0x01, 0x03, 0x01, 0x01, 0x03, 0x05, 0x01, 0x01, 0x01, 0x03, 0x03, 0x03, 0x05, 0x09,
  801. 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x07, 0x05, 0x05, 0x05, 0x07, 0x09, 0x09, 0x11, 0x21,
  802. 0x02, 0x03, 0x03, 0x02, 0x03, 0x03, 0x02, 0x06, 0x03, 0x03, 0x03, 0x03, 0x02, 0x03, 0x06, 0x0A,
  803. 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x07, 0x02, 0x03, 0x03, 0x02, 0x06, 0x07, 0x0A, 0x12,
  804. 0x04, 0x05, 0x05, 0x06, 0x05, 0x05, 0x06, 0x04, 0x05, 0x05, 0x05, 0x07, 0x06, 0x07, 0x04, 0x0C,
  805. 0x08, 0x09, 0x09, 0x0A, 0x09, 0x09, 0x0A, 0x0C, 0x10, 0x11, 0x11, 0x12, 0x20, 0x21, 0x40, 0x80,
  806. };
  807. static unsigned char ufs_fragtable_other[] = {
  808. 0x00, 0x16, 0x16, 0x2A, 0x16, 0x16, 0x26, 0x4E, 0x16, 0x16, 0x16, 0x3E, 0x2A, 0x3E, 0x4E, 0x8A,
  809. 0x16, 0x16, 0x16, 0x3E, 0x16, 0x16, 0x36, 0x5E, 0x16, 0x16, 0x16, 0x3E, 0x3E, 0x3E, 0x5E, 0x9E,
  810. 0x16, 0x16, 0x16, 0x3E, 0x16, 0x16, 0x36, 0x5E, 0x16, 0x16, 0x16, 0x3E, 0x3E, 0x3E, 0x5E, 0x9E,
  811. 0x2A, 0x3E, 0x3E, 0x2A, 0x3E, 0x3E, 0x2E, 0x6E, 0x3E, 0x3E, 0x3E, 0x3E, 0x2A, 0x3E, 0x6E, 0xAA,
  812. 0x16, 0x16, 0x16, 0x3E, 0x16, 0x16, 0x36, 0x5E, 0x16, 0x16, 0x16, 0x3E, 0x3E, 0x3E, 0x5E, 0x9E,
  813. 0x16, 0x16, 0x16, 0x3E, 0x16, 0x16, 0x36, 0x5E, 0x16, 0x16, 0x16, 0x3E, 0x3E, 0x3E, 0x5E, 0x9E,
  814. 0x26, 0x36, 0x36, 0x2E, 0x36, 0x36, 0x26, 0x6E, 0x36, 0x36, 0x36, 0x3E, 0x2E, 0x3E, 0x6E, 0xAE,
  815. 0x4E, 0x5E, 0x5E, 0x6E, 0x5E, 0x5E, 0x6E, 0x4E, 0x5E, 0x5E, 0x5E, 0x7E, 0x6E, 0x7E, 0x4E, 0xCE,
  816. 0x16, 0x16, 0x16, 0x3E, 0x16, 0x16, 0x36, 0x5E, 0x16, 0x16, 0x16, 0x3E, 0x3E, 0x3E, 0x5E, 0x9E,
  817. 0x16, 0x16, 0x16, 0x3E, 0x16, 0x16, 0x36, 0x5E, 0x16, 0x16, 0x16, 0x3E, 0x3E, 0x3E, 0x5E, 0x9E,
  818. 0x16, 0x16, 0x16, 0x3E, 0x16, 0x16, 0x36, 0x5E, 0x16, 0x16, 0x16, 0x3E, 0x3E, 0x3E, 0x5E, 0x9E,
  819. 0x3E, 0x3E, 0x3E, 0x3E, 0x3E, 0x3E, 0x3E, 0x7E, 0x3E, 0x3E, 0x3E, 0x3E, 0x3E, 0x3E, 0x7E, 0xBE,
  820. 0x2A, 0x3E, 0x3E, 0x2A, 0x3E, 0x3E, 0x2E, 0x6E, 0x3E, 0x3E, 0x3E, 0x3E, 0x2A, 0x3E, 0x6E, 0xAA,
  821. 0x3E, 0x3E, 0x3E, 0x3E, 0x3E, 0x3E, 0x3E, 0x7E, 0x3E, 0x3E, 0x3E, 0x3E, 0x3E, 0x3E, 0x7E, 0xBE,
  822. 0x4E, 0x5E, 0x5E, 0x6E, 0x5E, 0x5E, 0x6E, 0x4E, 0x5E, 0x5E, 0x5E, 0x7E, 0x6E, 0x7E, 0x4E, 0xCE,
  823. 0x8A, 0x9E, 0x9E, 0xAA, 0x9E, 0x9E, 0xAE, 0xCE, 0x9E, 0x9E, 0x9E, 0xBE, 0xAA, 0xBE, 0xCE, 0x8A,
  824. };