Lines Matching refs:snod
227 struct ubifs_scan_node *snod, *tmp;
232 list_for_each_entry_safe(snod, tmp, &sleb->nodes, list) {
235 ubifs_assert(snod->type != UBIFS_IDX_NODE);
236 ubifs_assert(snod->type != UBIFS_REF_NODE);
237 ubifs_assert(snod->type != UBIFS_CS_NODE);
239 err = ubifs_tnc_has_node(c, &snod->key, 0, sleb->lnum,
240 snod->offs, 0);
246 list_del(&snod->list);
247 kfree(snod);
251 if (snod->len < *min)
252 *min = snod->len;
254 if (key_type(c, &snod->key) != UBIFS_DATA_KEY)
255 list_move_tail(&snod->list, nondata);
268 * @snod: the mode to move
271 * This function moves node @snod to @wbuf, changes TNC correspondingly, and
272 * destroys @snod. Returns zero in case of success and a negative error code in
276 struct ubifs_scan_node *snod, struct ubifs_wbuf *wbuf)
281 err = ubifs_wbuf_write_nolock(wbuf, snod->node, snod->len);
285 err = ubifs_tnc_replace(c, &snod->key, sleb->lnum,
286 snod->offs, new_lnum, new_offs,
287 snod->len);
288 list_del(&snod->list);
289 kfree(snod);
326 struct ubifs_scan_node *snod, *tmp;
329 list_for_each_entry_safe(snod, tmp, &sleb->nodes, list) {
331 if (snod->len > avail)
338 err = move_node(c, sleb, snod, wbuf);
344 list_for_each_entry_safe(snod, tmp, &nondata, list) {
349 if (snod->len > avail) {
357 if (key_type(c, &snod->key) == UBIFS_DENT_KEY ||
358 snod->len == UBIFS_INO_NODE_SZ)
363 err = move_node(c, sleb, snod, wbuf);
426 struct ubifs_scan_node *snod;
444 snod = list_entry(sleb->nodes.next, struct ubifs_scan_node, list);
446 if (snod->type == UBIFS_IDX_NODE) {
451 list_for_each_entry(snod, &sleb->nodes, list) {
452 struct ubifs_idx_node *idx = snod->node;
455 ubifs_assert(snod->type == UBIFS_IDX_NODE);
456 key_read(c, ubifs_idx_key(c, idx), &snod->key);
457 err = ubifs_dirty_idx_node(c, &snod->key, level, lnum,
458 snod->offs);