242 	struct ubifs_scan_node *snod, *tmp;  in sort_nodes()  local
247 	list_for_each_entry_safe(snod, tmp, &sleb->nodes, list) {  in sort_nodes()
248 		ubifs_assert(snod->type == UBIFS_INO_NODE  ||  in sort_nodes()
249 			     snod->type == UBIFS_DATA_NODE ||  in sort_nodes()
250 			     snod->type == UBIFS_DENT_NODE ||  in sort_nodes()
251 			     snod->type == UBIFS_XENT_NODE ||  in sort_nodes()
252 			     snod->type == UBIFS_TRUN_NODE);  in sort_nodes()
254 		if (snod->type != UBIFS_INO_NODE  &&  in sort_nodes()
255 		    snod->type != UBIFS_DATA_NODE &&  in sort_nodes()
256 		    snod->type != UBIFS_DENT_NODE &&  in sort_nodes()
257 		    snod->type != UBIFS_XENT_NODE) {  in sort_nodes()
259 			list_del(&snod->list);  in sort_nodes()
260 			kfree(snod);  in sort_nodes()
264 		ubifs_assert(key_type(c, &snod->key) == UBIFS_DATA_KEY ||  in sort_nodes()
265 			     key_type(c, &snod->key) == UBIFS_INO_KEY  ||  in sort_nodes()
266 			     key_type(c, &snod->key) == UBIFS_DENT_KEY ||  in sort_nodes()
267 			     key_type(c, &snod->key) == UBIFS_XENT_KEY);  in sort_nodes()
269 		err = ubifs_tnc_has_node(c, &snod->key, 0, sleb->lnum,  in sort_nodes()
270 					 snod->offs, 0);  in sort_nodes()
276 			list_del(&snod->list);  in sort_nodes()
277 			kfree(snod);  in sort_nodes()
281 		if (snod->len < *min)  in sort_nodes()
282 			*min = snod->len;  in sort_nodes()
284 		if (key_type(c, &snod->key) != UBIFS_DATA_KEY)  in sort_nodes()
285 			list_move_tail(&snod->list, nondata);  in sort_nodes()
313 		     struct ubifs_scan_node *snod, struct ubifs_wbuf *wbuf)  in move_node()  argument
318 	err = ubifs_wbuf_write_nolock(wbuf, snod->node, snod->len);  in move_node()
322 	err = ubifs_tnc_replace(c, &snod->key, sleb->lnum,  in move_node()
323 				snod->offs, new_lnum, new_offs,  in move_node()
324 				snod->len);  in move_node()
325 	list_del(&snod->list);  in move_node()
326 	kfree(snod);  in move_node()
363 		struct ubifs_scan_node *snod, *tmp;  in move_nodes()  local
366 		list_for_each_entry_safe(snod, tmp, &sleb->nodes, list) {  in move_nodes()
368 			if  (snod->len > avail)  in move_nodes()
375 			err = move_node(c, sleb, snod, wbuf);  in move_nodes()
381 		list_for_each_entry_safe(snod, tmp, &nondata, list) {  in move_nodes()
386 			if  (snod->len > avail) {  in move_nodes()
394 				if (key_type(c, &snod->key) == UBIFS_DENT_KEY ||  in move_nodes()
395 				    snod->len == UBIFS_INO_NODE_SZ)  in move_nodes()
400 			err = move_node(c, sleb, snod, wbuf);  in move_nodes()
463 	struct ubifs_scan_node *snod;  in ubifs_garbage_collect_leb()  local
512 	snod = list_entry(sleb->nodes.next, struct ubifs_scan_node, list);  in ubifs_garbage_collect_leb()
514 	if (snod->type == UBIFS_IDX_NODE) {  in ubifs_garbage_collect_leb()
519 		list_for_each_entry(snod, &sleb->nodes, list) {  in ubifs_garbage_collect_leb()
520 			struct ubifs_idx_node *idx = snod->node;  in ubifs_garbage_collect_leb()
523 			ubifs_assert(snod->type == UBIFS_IDX_NODE);  in ubifs_garbage_collect_leb()
524 			key_read(c, ubifs_idx_key(c, idx), &snod->key);  in ubifs_garbage_collect_leb()
525 			err = ubifs_dirty_idx_node(c, &snod->key, level, lnum,  in ubifs_garbage_collect_leb()
526 						   snod->offs);  in ubifs_garbage_collect_leb()