190 static int trun_remove_range(struct ubifs_info *c, struct replay_entry *r)  in trun_remove_range()  argument
196 	min_blk = r->new_size / UBIFS_BLOCK_SIZE;  in trun_remove_range()
197 	if (r->new_size & (UBIFS_BLOCK_SIZE - 1))  in trun_remove_range()
200 	max_blk = r->old_size / UBIFS_BLOCK_SIZE;  in trun_remove_range()
201 	if ((r->old_size & (UBIFS_BLOCK_SIZE - 1)) == 0)  in trun_remove_range()
204 	ino = key_inum(c, &r->key);  in trun_remove_range()
219 static int apply_replay_entry(struct ubifs_info *c, struct replay_entry *r)  in apply_replay_entry()  argument
223 	dbg_mntk(&r->key, "LEB %d:%d len %d deletion %d sqnum %llu key ",  in apply_replay_entry()
224 		 r->lnum, r->offs, r->len, r->deletion, r->sqnum);  in apply_replay_entry()
227 	c->replay_sqnum = r->sqnum;  in apply_replay_entry()
229 	if (is_hash_key(c, &r->key)) {  in apply_replay_entry()
230 		if (r->deletion)  in apply_replay_entry()
231 			err = ubifs_tnc_remove_nm(c, &r->key, &r->nm);  in apply_replay_entry()
233 			err = ubifs_tnc_add_nm(c, &r->key, r->lnum, r->offs,  in apply_replay_entry()
234 					       r->len, &r->nm);  in apply_replay_entry()
236 		if (r->deletion)  in apply_replay_entry()
237 			switch (key_type(c, &r->key)) {  in apply_replay_entry()
240 				ino_t inum = key_inum(c, &r->key);  in apply_replay_entry()
246 				err = trun_remove_range(c, r);  in apply_replay_entry()
249 				err = ubifs_tnc_remove(c, &r->key);  in apply_replay_entry()
253 			err = ubifs_tnc_add(c, &r->key, r->lnum, r->offs,  in apply_replay_entry()
254 					    r->len);  in apply_replay_entry()
259 			err = ubifs_recover_size_accum(c, &r->key, r->deletion,  in apply_replay_entry()
260 						       r->new_size);  in apply_replay_entry()
302 	struct replay_entry *r;  in apply_replay_list()  local
307 	list_for_each_entry(r, &c->replay_list, list) {  in apply_replay_list()
310 		err = apply_replay_entry(c, r);  in apply_replay_list()
326 	struct replay_entry *r, *tmp;  in destroy_replay_list()  local
328 	list_for_each_entry_safe(r, tmp, &c->replay_list, list) {  in destroy_replay_list()
329 		if (is_hash_key(c, &r->key))  in destroy_replay_list()
330 			kfree(r->nm.name);  in destroy_replay_list()
331 		list_del(&r->list);  in destroy_replay_list()
332 		kfree(r);  in destroy_replay_list()
361 	struct replay_entry *r;  in insert_node()  local
368 	r = kzalloc(sizeof(struct replay_entry), GFP_KERNEL);  in insert_node()
369 	if (!r)  in insert_node()
374 	r->lnum = lnum;  in insert_node()
375 	r->offs = offs;  in insert_node()
376 	r->len = len;  in insert_node()
377 	r->deletion = !!deletion;  in insert_node()
378 	r->sqnum = sqnum;  in insert_node()
379 	key_copy(c, key, &r->key);  in insert_node()
380 	r->old_size = old_size;  in insert_node()
381 	r->new_size = new_size;  in insert_node()
383 	list_add_tail(&r->list, &c->replay_list);  in insert_node()
408 	struct replay_entry *r;  in insert_dent()  local
415 	r = kzalloc(sizeof(struct replay_entry), GFP_KERNEL);  in insert_dent()
416 	if (!r)  in insert_dent()
421 		kfree(r);  in insert_dent()
427 	r->lnum = lnum;  in insert_dent()
428 	r->offs = offs;  in insert_dent()
429 	r->len = len;  in insert_dent()
430 	r->deletion = !!deletion;  in insert_dent()
431 	r->sqnum = sqnum;  in insert_dent()
432 	key_copy(c, key, &r->key);  in insert_dent()
433 	r->nm.len = nlen;  in insert_dent()
436 	r->nm.name = nbuf;  in insert_dent()
438 	list_add_tail(&r->list, &c->replay_list);  in insert_dent()