fs/ubifs/scan.c

52  * @offs: offset within the logical eraseblock
58 		      int offs, int quiet)
66 		dbg_scan("hit empty space at LEB %d:%d", lnum, offs);
77 		 dbg_ntype(ch->node_type), lnum, offs);
79 	if (ubifs_check_node(c, buf, len, lnum, offs, quiet, 1))
89 		    offs + node_len + pad_len > c->leb_size) {
92 					  lnum, offs);
102 					  offs, offs + node_len + pad_len);
107 			 lnum, offs, ALIGN(offs + node_len + pad_len, 8));
119  * @offs: offset to start at (usually zero)
126 					int offs, void *sbuf)
131 	dbg_scan("scan LEB %d:%d", lnum, offs);
141 	err = ubifs_leb_read(c, lnum, sbuf + offs, offs, c->leb_size - offs, 0);
144 			  c->leb_size - offs, lnum, offs, err);
161  * @offs: offset to start at (usually zero)
164 		    int lnum, int offs)
166 	dbg_scan("stop scanning LEB %d at offset %d", lnum, offs);
167 	ubifs_assert(c, offs % c->min_io_size == 0);
169 	sleb->endpt = ALIGN(offs, c->min_io_size);
177  * @offs: offset of node on flash
182 		   void *buf, int offs)
194 	snod->offs = offs;
222  * @offs: offset of corruption
225 void ubifs_scanned_corruption(const struct ubifs_info *c, int lnum, int offs,
230 	ubifs_err(c, "corruption at LEB %d:%d", lnum, offs);
231 	len = c->leb_size - offs;
234 	ubifs_err(c, "first %d bytes from LEB %d:%d", len, lnum, offs);
242  * @offs: offset to start at (usually zero)
255 				  int offs, void *sbuf, int quiet)
257 	void *buf = sbuf + offs;
258 	int err, len = c->leb_size - offs;
261 	sleb = ubifs_start_scan(c, lnum, offs, sbuf);
270 			 lnum, offs, len);
274 		ret = ubifs_scan_a_node(c, buf, len, lnum, offs, quiet);
277 			offs += ret;
303 		err = ubifs_add_snod(c, sleb, buf, offs);
308 		offs += node_len;
313 	if (offs % c->min_io_size) {
316 				  offs);
320 	ubifs_end_scan(c, sleb, lnum, offs);
322 	for (; len > 4; offs += 4, buf = buf + 4, len -= 4)
325 	for (; len; offs++, buf++, len--)
329 					  lnum, offs);
337 		ubifs_scanned_corruption(c, lnum, offs, buf);