181 static int trun_remove_range(struct ubifs_info *c, struct replay_entry *r)  in trun_remove_range()  argument
187 	min_blk = r->new_size / UBIFS_BLOCK_SIZE;  in trun_remove_range()
188 	if (r->new_size & (UBIFS_BLOCK_SIZE - 1))  in trun_remove_range()
191 	max_blk = r->old_size / UBIFS_BLOCK_SIZE;  in trun_remove_range()
192 	if ((r->old_size & (UBIFS_BLOCK_SIZE - 1)) == 0)  in trun_remove_range()
195 	ino = key_inum(c, &r->key);  in trun_remove_range()
215 	struct replay_entry *r;  in inode_still_linked()  local
224 	list_for_each_entry_reverse(r, &c->replay_list, list) {  in inode_still_linked()
225 		ubifs_assert(c, r->sqnum >= rino->sqnum);  in inode_still_linked()
226 		if (key_inum(c, &r->key) == key_inum(c, &rino->key))  in inode_still_linked()
227 			return r->deletion == 0;  in inode_still_linked()
242 static int apply_replay_entry(struct ubifs_info *c, struct replay_entry *r)  in apply_replay_entry()  argument
246 	dbg_mntk(&r->key, "LEB %d:%d len %d deletion %d sqnum %llu key ",  in apply_replay_entry()
247 		 r->lnum, r->offs, r->len, r->deletion, r->sqnum);  in apply_replay_entry()
249 	if (is_hash_key(c, &r->key)) {  in apply_replay_entry()
250 		if (r->deletion)  in apply_replay_entry()
251 			err = ubifs_tnc_remove_nm(c, &r->key, &r->nm);  in apply_replay_entry()
253 			err = ubifs_tnc_add_nm(c, &r->key, r->lnum, r->offs,  in apply_replay_entry()
254 					       r->len, r->hash, &r->nm);  in apply_replay_entry()
256 		if (r->deletion)  in apply_replay_entry()
257 			switch (key_type(c, &r->key)) {  in apply_replay_entry()
260 				ino_t inum = key_inum(c, &r->key);  in apply_replay_entry()
262 				if (inode_still_linked(c, r)) {  in apply_replay_entry()
271 				err = trun_remove_range(c, r);  in apply_replay_entry()
274 				err = ubifs_tnc_remove(c, &r->key);  in apply_replay_entry()
278 			err = ubifs_tnc_add(c, &r->key, r->lnum, r->offs,  in apply_replay_entry()
279 					    r->len, r->hash);  in apply_replay_entry()
284 			err = ubifs_recover_size_accum(c, &r->key, r->deletion,  in apply_replay_entry()
285 						       r->new_size);  in apply_replay_entry()
328 	struct replay_entry *r;  in apply_replay_list()  local
333 	list_for_each_entry(r, &c->replay_list, list) {  in apply_replay_list()
336 		err = apply_replay_entry(c, r);  in apply_replay_list()
352 	struct replay_entry *r, *tmp;  in destroy_replay_list()  local
354 	list_for_each_entry_safe(r, tmp, &c->replay_list, list) {  in destroy_replay_list()
355 		if (is_hash_key(c, &r->key))  in destroy_replay_list()
356 			kfree(fname_name(&r->nm));  in destroy_replay_list()
357 		list_del(&r->list);  in destroy_replay_list()
358 		kfree(r);  in destroy_replay_list()
387 	struct replay_entry *r;  in insert_node()  local
394 	r = kzalloc(sizeof(struct replay_entry), GFP_KERNEL);  in insert_node()
395 	if (!r)  in insert_node()
400 	r->lnum = lnum;  in insert_node()
401 	r->offs = offs;  in insert_node()
402 	r->len = len;  in insert_node()
403 	ubifs_copy_hash(c, hash, r->hash);  in insert_node()
404 	r->deletion = !!deletion;  in insert_node()
405 	r->sqnum = sqnum;  in insert_node()
406 	key_copy(c, key, &r->key);  in insert_node()
407 	r->old_size = old_size;  in insert_node()
408 	r->new_size = new_size;  in insert_node()
410 	list_add_tail(&r->list, &c->replay_list);  in insert_node()
436 	struct replay_entry *r;  in insert_dent()  local
443 	r = kzalloc(sizeof(struct replay_entry), GFP_KERNEL);  in insert_dent()
444 	if (!r)  in insert_dent()
449 		kfree(r);  in insert_dent()
455 	r->lnum = lnum;  in insert_dent()
456 	r->offs = offs;  in insert_dent()
457 	r->len = len;  in insert_dent()
458 	ubifs_copy_hash(c, hash, r->hash);  in insert_dent()
459 	r->deletion = !!deletion;  in insert_dent()
460 	r->sqnum = sqnum;  in insert_dent()
461 	key_copy(c, key, &r->key);  in insert_dent()
462 	fname_len(&r->nm) = nlen;  in insert_dent()
465 	fname_name(&r->nm) = nbuf;  in insert_dent()
467 	list_add_tail(&r->list, &c->replay_list);  in insert_dent()