63 static void shrink_liability(struct ubifs_info *c, int nr_to_write)  in shrink_liability()  argument
65 	down_read(&c->vfs_sb->s_umount);  in shrink_liability()
66 	writeback_inodes_sb(c->vfs_sb, WB_REASON_FS_FREE_SPACE);  in shrink_liability()
67 	up_read(&c->vfs_sb->s_umount);  in shrink_liability()
78 static int run_gc(struct ubifs_info *c)  in run_gc()  argument
83 	down_read(&c->commit_sem);  in run_gc()
84 	lnum = ubifs_garbage_collect(c, 1);  in run_gc()
85 	up_read(&c->commit_sem);  in run_gc()
91 	err = ubifs_return_leb(c, lnum);  in run_gc()
104 static long long get_liability(struct ubifs_info *c)  in get_liability()  argument
108 	spin_lock(&c->space_lock);  in get_liability()
109 	liab = c->bi.idx_growth + c->bi.data_growth + c->bi.dd_growth;  in get_liability()
110 	spin_unlock(&c->space_lock);  in get_liability()
132 static int make_free_space(struct ubifs_info *c)  in make_free_space()  argument
138 		liab1 = get_liability(c);  in make_free_space()
144 		shrink_liability(c, NR_TO_WRITE);  in make_free_space()
146 		liab2 = get_liability(c);  in make_free_space()
154 		err = run_gc(c);  in make_free_space()
163 		err = ubifs_run_commit(c);  in make_free_space()
178 int ubifs_calc_min_idx_lebs(struct ubifs_info *c)  in ubifs_calc_min_idx_lebs()  argument
183 	idx_size = c->bi.old_idx_sz + c->bi.idx_growth + c->bi.uncommitted_idx;  in ubifs_calc_min_idx_lebs()
191 	idx_lebs = div_u64(idx_size + c->idx_leb_size - 1, c->idx_leb_size);  in ubifs_calc_min_idx_lebs()
209 long long ubifs_calc_available(const struct ubifs_info *c, int min_idx_lebs)  in ubifs_calc_available()  argument
214 	available = c->main_bytes - c->lst.total_used;  in ubifs_calc_available()
231 	subtract_lebs += c->jhead_cnt - 1;  in ubifs_calc_available()
236 	available -= (long long)subtract_lebs * c->leb_size;  in ubifs_calc_available()
239 	available -= c->lst.total_dead;  in ubifs_calc_available()
247 	available -= c->lst.total_dark;  in ubifs_calc_available()
255 	if (c->lst.idx_lebs > min_idx_lebs) {  in ubifs_calc_available()
256 		subtract_lebs = c->lst.idx_lebs - min_idx_lebs;  in ubifs_calc_available()
257 		available -= subtract_lebs * c->dark_wm;  in ubifs_calc_available()
273 static int can_use_rp(struct ubifs_info *c)  in can_use_rp()  argument
275 	if (uid_eq(current_fsuid(), c->rp_uid) || capable(CAP_SYS_RESOURCE) ||  in can_use_rp()
276 	    (!gid_eq(c->rp_gid, GLOBAL_ROOT_GID) && in_group_p(c->rp_gid)))  in can_use_rp()
306 static int do_budget_space(struct ubifs_info *c)  in do_budget_space()  argument
312 	min_idx_lebs = ubifs_calc_min_idx_lebs(c);  in do_budget_space()
315 	if (min_idx_lebs > c->lst.idx_lebs)  in do_budget_space()
316 		rsvd_idx_lebs = min_idx_lebs - c->lst.idx_lebs;  in do_budget_space()
342 	lebs = c->lst.empty_lebs + c->freeable_cnt + c->idx_gc_cnt -  in do_budget_space()
343 	       c->lst.taken_empty_lebs;  in do_budget_space()
346 			 min_idx_lebs, c->bi.min_idx_lebs, rsvd_idx_lebs);  in do_budget_space()
350 	available = ubifs_calc_available(c, min_idx_lebs);  in do_budget_space()
351 	outstanding = c->bi.data_growth + c->bi.dd_growth;  in do_budget_space()
359 	if (available - outstanding <= c->rp_size && !can_use_rp(c))  in do_budget_space()
362 	c->bi.min_idx_lebs = min_idx_lebs;  in do_budget_space()
374 static int calc_idx_growth(const struct ubifs_info *c,  in calc_idx_growth()  argument
381 	return znodes * c->max_idx_node_sz;  in calc_idx_growth()
390 static int calc_data_growth(const struct ubifs_info *c,  in calc_data_growth()  argument
395 	data_growth = req->new_ino  ? c->bi.inode_budget : 0;  in calc_data_growth()
397 		data_growth += c->bi.page_budget;  in calc_data_growth()
399 		data_growth += c->bi.dent_budget;  in calc_data_growth()
410 static int calc_dd_growth(const struct ubifs_info *c,  in calc_dd_growth()  argument
415 	dd_growth = req->dirtied_page ? c->bi.page_budget : 0;  in calc_dd_growth()
418 		dd_growth += c->bi.inode_budget << (req->dirtied_ino - 1);  in calc_dd_growth()
420 		dd_growth += c->bi.dent_budget;  in calc_dd_growth()
438 int ubifs_budget_space(struct ubifs_info *c, struct ubifs_budget_req *req)  in ubifs_budget_space()  argument
453 	data_growth = calc_data_growth(c, req);  in ubifs_budget_space()
454 	dd_growth = calc_dd_growth(c, req);  in ubifs_budget_space()
457 	idx_growth = calc_idx_growth(c, req);  in ubifs_budget_space()
460 	spin_lock(&c->space_lock);  in ubifs_budget_space()
461 	ubifs_assert(c->bi.idx_growth >= 0);  in ubifs_budget_space()
462 	ubifs_assert(c->bi.data_growth >= 0);  in ubifs_budget_space()
463 	ubifs_assert(c->bi.dd_growth >= 0);  in ubifs_budget_space()
465 	if (unlikely(c->bi.nospace) && (c->bi.nospace_rp || !can_use_rp(c))) {  in ubifs_budget_space()
467 		spin_unlock(&c->space_lock);  in ubifs_budget_space()
471 	c->bi.idx_growth += idx_growth;  in ubifs_budget_space()
472 	c->bi.data_growth += data_growth;  in ubifs_budget_space()
473 	c->bi.dd_growth += dd_growth;  in ubifs_budget_space()
475 	err = do_budget_space(c);  in ubifs_budget_space()
480 		spin_unlock(&c->space_lock);  in ubifs_budget_space()
485 	c->bi.idx_growth -= idx_growth;  in ubifs_budget_space()
486 	c->bi.data_growth -= data_growth;  in ubifs_budget_space()
487 	c->bi.dd_growth -= dd_growth;  in ubifs_budget_space()
488 	spin_unlock(&c->space_lock);  in ubifs_budget_space()
495 	err = make_free_space(c);  in ubifs_budget_space()
507 		c->bi.nospace = 1;  in ubifs_budget_space()
508 		if (can_use_rp(c) || c->rp_size == 0)  in ubifs_budget_space()
509 			c->bi.nospace_rp = 1;  in ubifs_budget_space()
512 		ubifs_err(c, "cannot budget space, error %d", err);  in ubifs_budget_space()
527 void ubifs_release_budget(struct ubifs_info *c, struct ubifs_budget_req *req)  in ubifs_release_budget()  argument
546 		req->data_growth = calc_data_growth(c, req);  in ubifs_release_budget()
547 		req->dd_growth = calc_dd_growth(c, req);  in ubifs_release_budget()
548 		req->idx_growth = calc_idx_growth(c, req);  in ubifs_release_budget()
554 	c->bi.nospace = c->bi.nospace_rp = 0;  in ubifs_release_budget()
557 	spin_lock(&c->space_lock);  in ubifs_release_budget()
558 	c->bi.idx_growth -= req->idx_growth;  in ubifs_release_budget()
559 	c->bi.uncommitted_idx += req->idx_growth;  in ubifs_release_budget()
560 	c->bi.data_growth -= req->data_growth;  in ubifs_release_budget()
561 	c->bi.dd_growth -= req->dd_growth;  in ubifs_release_budget()
562 	c->bi.min_idx_lebs = ubifs_calc_min_idx_lebs(c);  in ubifs_release_budget()
564 	ubifs_assert(c->bi.idx_growth >= 0);  in ubifs_release_budget()
565 	ubifs_assert(c->bi.data_growth >= 0);  in ubifs_release_budget()
566 	ubifs_assert(c->bi.dd_growth >= 0);  in ubifs_release_budget()
567 	ubifs_assert(c->bi.min_idx_lebs < c->main_lebs);  in ubifs_release_budget()
568 	ubifs_assert(!(c->bi.idx_growth & 7));  in ubifs_release_budget()
569 	ubifs_assert(!(c->bi.data_growth & 7));  in ubifs_release_budget()
570 	ubifs_assert(!(c->bi.dd_growth & 7));  in ubifs_release_budget()
571 	spin_unlock(&c->space_lock);  in ubifs_release_budget()
583 void ubifs_convert_page_budget(struct ubifs_info *c)  in ubifs_convert_page_budget()  argument
585 	spin_lock(&c->space_lock);  in ubifs_convert_page_budget()
587 	c->bi.idx_growth -= c->max_idx_node_sz << UBIFS_BLOCKS_PER_PAGE_SHIFT;  in ubifs_convert_page_budget()
589 	c->bi.data_growth -= c->bi.page_budget;  in ubifs_convert_page_budget()
591 	c->bi.dd_growth += c->bi.page_budget;  in ubifs_convert_page_budget()
593 	c->bi.min_idx_lebs = ubifs_calc_min_idx_lebs(c);  in ubifs_convert_page_budget()
594 	spin_unlock(&c->space_lock);  in ubifs_convert_page_budget()
606 void ubifs_release_dirty_inode_budget(struct ubifs_info *c,  in ubifs_release_dirty_inode_budget()  argument
613 	req.dd_growth = c->bi.inode_budget + ALIGN(ui->data_len, 8);  in ubifs_release_dirty_inode_budget()
614 	ubifs_release_budget(c, &req);  in ubifs_release_dirty_inode_budget()
637 long long ubifs_reported_space(const struct ubifs_info *c, long long free)  in ubifs_reported_space()  argument
654 	f = c->fanout > 3 ? c->fanout >> 1 : 2;  in ubifs_reported_space()
657 	divisor += (c->max_idx_node_sz * 3) / (f - 1);  in ubifs_reported_space()
678 long long ubifs_get_free_space_nolock(struct ubifs_info *c)  in ubifs_get_free_space_nolock()  argument
683 	ubifs_assert(c->bi.min_idx_lebs == ubifs_calc_min_idx_lebs(c));  in ubifs_get_free_space_nolock()
684 	outstanding = c->bi.data_growth + c->bi.dd_growth;  in ubifs_get_free_space_nolock()
685 	available = ubifs_calc_available(c, c->bi.min_idx_lebs);  in ubifs_get_free_space_nolock()
698 	if (c->bi.min_idx_lebs > c->lst.idx_lebs)  in ubifs_get_free_space_nolock()
699 		rsvd_idx_lebs = c->bi.min_idx_lebs - c->lst.idx_lebs;  in ubifs_get_free_space_nolock()
702 	lebs = c->lst.empty_lebs + c->freeable_cnt + c->idx_gc_cnt -  in ubifs_get_free_space_nolock()
703 	       c->lst.taken_empty_lebs;  in ubifs_get_free_space_nolock()
705 	available += lebs * (c->dark_wm - c->leb_overhead);  in ubifs_get_free_space_nolock()
708 		free = ubifs_reported_space(c, available - outstanding);  in ubifs_get_free_space_nolock()
721 long long ubifs_get_free_space(struct ubifs_info *c)  in ubifs_get_free_space()  argument
725 	spin_lock(&c->space_lock);  in ubifs_get_free_space()
726 	free = ubifs_get_free_space_nolock(c);  in ubifs_get_free_space()
727 	spin_unlock(&c->space_lock);  in ubifs_get_free_space()