231 	struct ubifs_scan_node *snod, *tmp;  in sort_nodes()  local
236 	list_for_each_entry_safe(snod, tmp, &sleb->nodes, list) {  in sort_nodes()
237 		ubifs_assert(c, snod->type == UBIFS_INO_NODE  ||  in sort_nodes()
238 			     snod->type == UBIFS_DATA_NODE ||  in sort_nodes()
239 			     snod->type == UBIFS_DENT_NODE ||  in sort_nodes()
240 			     snod->type == UBIFS_XENT_NODE ||  in sort_nodes()
241 			     snod->type == UBIFS_TRUN_NODE ||  in sort_nodes()
242 			     snod->type == UBIFS_AUTH_NODE);  in sort_nodes()
244 		if (snod->type != UBIFS_INO_NODE  &&  in sort_nodes()
245 		    snod->type != UBIFS_DATA_NODE &&  in sort_nodes()
246 		    snod->type != UBIFS_DENT_NODE &&  in sort_nodes()
247 		    snod->type != UBIFS_XENT_NODE) {  in sort_nodes()
249 			list_del(&snod->list);  in sort_nodes()
250 			kfree(snod);  in sort_nodes()
254 		ubifs_assert(c, key_type(c, &snod->key) == UBIFS_DATA_KEY ||  in sort_nodes()
255 			     key_type(c, &snod->key) == UBIFS_INO_KEY  ||  in sort_nodes()
256 			     key_type(c, &snod->key) == UBIFS_DENT_KEY ||  in sort_nodes()
257 			     key_type(c, &snod->key) == UBIFS_XENT_KEY);  in sort_nodes()
259 		err = ubifs_tnc_has_node(c, &snod->key, 0, sleb->lnum,  in sort_nodes()
260 					 snod->offs, 0);  in sort_nodes()
266 			list_del(&snod->list);  in sort_nodes()
267 			kfree(snod);  in sort_nodes()
271 		if (snod->len < *min)  in sort_nodes()
272 			*min = snod->len;  in sort_nodes()
274 		if (key_type(c, &snod->key) != UBIFS_DATA_KEY)  in sort_nodes()
275 			list_move_tail(&snod->list, nondata);  in sort_nodes()
303 		     struct ubifs_scan_node *snod, struct ubifs_wbuf *wbuf)  in move_node()  argument
308 	err = ubifs_wbuf_write_nolock(wbuf, snod->node, snod->len);  in move_node()
312 	err = ubifs_tnc_replace(c, &snod->key, sleb->lnum,  in move_node()
313 				snod->offs, new_lnum, new_offs,  in move_node()
314 				snod->len);  in move_node()
315 	list_del(&snod->list);  in move_node()
316 	kfree(snod);  in move_node()
353 		struct ubifs_scan_node *snod, *tmp;  in move_nodes()  local
356 		list_for_each_entry_safe(snod, tmp, &sleb->nodes, list) {  in move_nodes()
359 			if  (snod->len > avail)  in move_nodes()
367 						 snod->node, snod->len);  in move_nodes()
371 			err = move_node(c, sleb, snod, wbuf);  in move_nodes()
378 		list_for_each_entry_safe(snod, tmp, &nondata, list) {  in move_nodes()
384 			if  (snod->len > avail) {  in move_nodes()
392 				if (key_type(c, &snod->key) == UBIFS_DENT_KEY ||  in move_nodes()
393 				    snod->len == UBIFS_INO_NODE_SZ)  in move_nodes()
399 						 snod->node, snod->len);  in move_nodes()
403 			err = move_node(c, sleb, snod, wbuf);  in move_nodes()
493 	struct ubifs_scan_node *snod;  in ubifs_garbage_collect_leb()  local
542 	snod = list_entry(sleb->nodes.next, struct ubifs_scan_node, list);  in ubifs_garbage_collect_leb()
544 	if (snod->type == UBIFS_IDX_NODE) {  in ubifs_garbage_collect_leb()
549 		list_for_each_entry(snod, &sleb->nodes, list) {  in ubifs_garbage_collect_leb()
550 			struct ubifs_idx_node *idx = snod->node;  in ubifs_garbage_collect_leb()
553 			ubifs_assert(c, snod->type == UBIFS_IDX_NODE);  in ubifs_garbage_collect_leb()
554 			key_read(c, ubifs_idx_key(c, idx), &snod->key);  in ubifs_garbage_collect_leb()
555 			err = ubifs_dirty_idx_node(c, &snod->key, level, lnum,  in ubifs_garbage_collect_leb()
556 						   snod->offs);  in ubifs_garbage_collect_leb()