fs/orangefs/dir.c

17 	struct orangefs_dir_part *part;
40  * part and is stored in a linked list in case more than one part is
43  * The position pointer (ctx->pos) encodes the part and offset on which
44  * to begin reading at.  Bits above PART_SHIFT encode the part and bits
51  * part list.  Data is parsed from the current position as it is needed.
58  * first part of the part list.
134 	struct orangefs_dir_part *part, *new;
138 	part = od->part;
139 	while (part) {
141 		if (part->next)
142 			part = part->next;
151 	if (!od->part)
152 		od->part = new;
154 		part->next = new;
188 static int fill_from_part(struct orangefs_dir_part *part,
199 	if (i > part->len)
209 	while (i < part->len) {
210 		if (part->len < i + sizeof *len)
212 		len = (void *)part + offset + i;
219 		if (part->len < i + padlen + sizeof *khandle)
221 		s = (void *)part + offset + i + sizeof *len;
224 		khandle = (void *)part + offset + i + padlen;
231 		BUG_ON(i > part->len);
242 	struct orangefs_dir_part *part;
247 	part = od->part;
248 	while (part->next && count) {
250 		part = part->next;
258 	while (part && part->len) {
260 		r = fill_from_part(part, ctx);
269 			 * The part ran out of data.  Move to the next
270 			 * part. */
273 			part = part->next;
288 		struct orangefs_dir_part *part = od->part;
289 		while (part) {
290 			struct orangefs_dir_part *next = part->next;
291 			vfree(part);
292 			part = next;
295 		od->part = NULL;
323 	 * The seek position is in the first synthesized part but is not
371 	od->part = NULL;
380 	struct orangefs_dir_part *part = od->part;
381 	while (part) {
382 		struct orangefs_dir_part *next = part->next;
383 		vfree(part);
384 		part = next;