Blame view
fs/seq_file.c
17.9 KB
1da177e4c Linux-2.6.12-rc2 |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 |
/* * linux/fs/seq_file.c * * helper functions for making synthetic files from sequences of records. * initial implementation -- AV, Oct 2001. */ #include <linux/fs.h> #include <linux/module.h> #include <linux/seq_file.h> #include <linux/slab.h> #include <asm/uaccess.h> #include <asm/page.h> /** * seq_open - initialize sequential file * @file: file we initialize * @op: method table describing the sequence * * seq_open() sets @file, associating it with a sequence described * by @op. @op->start() sets the iterator up and returns the first * element of sequence. @op->stop() shuts it down. @op->next() * returns the next element of sequence. @op->show() prints element * into the buffer. In case of error ->start() and ->next() return * ERR_PTR(error). In the end of sequence they return %NULL. ->show() * returns 0 in case of success and negative number in case of error. |
521b5d0c4 [PATCH] teach seq... |
28 |
* Returning SEQ_SKIP means "discard this element and move on". |
1da177e4c Linux-2.6.12-rc2 |
29 |
*/ |
15ad7cdcf [PATCH] struct se... |
30 |
int seq_open(struct file *file, const struct seq_operations *op) |
1da177e4c Linux-2.6.12-rc2 |
31 |
{ |
1abe77b0f [PATCH] allow cal... |
32 33 34 35 36 37 38 39 |
struct seq_file *p = file->private_data; if (!p) { p = kmalloc(sizeof(*p), GFP_KERNEL); if (!p) return -ENOMEM; file->private_data = p; } |
1da177e4c Linux-2.6.12-rc2 |
40 |
memset(p, 0, sizeof(*p)); |
0ac1759ab [PATCH] sem2mutex... |
41 |
mutex_init(&p->lock); |
1da177e4c Linux-2.6.12-rc2 |
42 |
p->op = op; |
1da177e4c Linux-2.6.12-rc2 |
43 44 45 46 47 48 49 |
/* * Wrappers around seq_open(e.g. swaps_open) need to be * aware of this. If they set f_version themselves, they * should call seq_open first and then set f_version. */ file->f_version = 0; |
8f19d4729 seq_file: properl... |
50 51 52 53 54 55 56 57 58 59 |
/* * seq_files support lseek() and pread(). They do not implement * write() at all, but we clear FMODE_PWRITE here for historical * reasons. * * If a client of seq_files a) implements file.write() and b) wishes to * support pwrite() then that client will need to implement its own * file.open() which calls seq_open() and then sets FMODE_PWRITE. */ file->f_mode &= ~FMODE_PWRITE; |
1da177e4c Linux-2.6.12-rc2 |
60 61 62 |
return 0; } EXPORT_SYMBOL(seq_open); |
33da8892a seq_file: move tr... |
63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 |
static int traverse(struct seq_file *m, loff_t offset) { loff_t pos = 0, index; int error = 0; void *p; m->version = 0; index = 0; m->count = m->from = 0; if (!offset) { m->index = index; return 0; } if (!m->buf) { m->buf = kmalloc(m->size = PAGE_SIZE, GFP_KERNEL); if (!m->buf) return -ENOMEM; } p = m->op->start(m, &index); while (p) { error = PTR_ERR(p); if (IS_ERR(p)) break; error = m->op->show(m, p); if (error < 0) break; if (unlikely(error)) { error = 0; m->count = 0; } if (m->count == m->size) goto Eoverflow; if (pos + m->count > offset) { m->from = offset - pos; m->count -= m->from; m->index = index; break; } pos += m->count; m->count = 0; if (pos == offset) { index++; m->index = index; break; } p = m->op->next(m, p, &index); } m->op->stop(m, p); |
f01d1d546 seq_file: fix big... |
111 |
m->index = index; |
33da8892a seq_file: move tr... |
112 113 114 115 116 117 118 119 |
return error; Eoverflow: m->op->stop(m, p); kfree(m->buf); m->buf = kmalloc(m->size <<= 1, GFP_KERNEL); return !m->buf ? -ENOMEM : -EAGAIN; } |
1da177e4c Linux-2.6.12-rc2 |
120 121 |
/** * seq_read - ->read() method for sequential files. |
67be2dd1b [PATCH] DocBook: ... |
122 123 124 125 |
* @file: the file to read from * @buf: the buffer to read to * @size: the maximum number of bytes to read * @ppos: the current position in the file |
1da177e4c Linux-2.6.12-rc2 |
126 127 128 129 130 131 132 133 134 135 136 |
* * Ready-made ->f_op->read() */ ssize_t seq_read(struct file *file, char __user *buf, size_t size, loff_t *ppos) { struct seq_file *m = (struct seq_file *)file->private_data; size_t copied = 0; loff_t pos; size_t n; void *p; int err = 0; |
0ac1759ab [PATCH] sem2mutex... |
137 |
mutex_lock(&m->lock); |
8f19d4729 seq_file: properl... |
138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 |
/* Don't assume *ppos is where we left it */ if (unlikely(*ppos != m->read_pos)) { m->read_pos = *ppos; while ((err = traverse(m, *ppos)) == -EAGAIN) ; if (err) { /* With prejudice... */ m->read_pos = 0; m->version = 0; m->index = 0; m->count = 0; goto Done; } } |
1da177e4c Linux-2.6.12-rc2 |
153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 |
/* * seq_file->op->..m_start/m_stop/m_next may do special actions * or optimisations based on the file->f_version, so we want to * pass the file->f_version to those methods. * * seq_file->version is just copy of f_version, and seq_file * methods can treat it simply as file version. * It is copied in first and copied out after all operations. * It is convenient to have it as part of structure to avoid the * need of passing another argument to all the seq_file methods. */ m->version = file->f_version; /* grab buffer if we didn't have one */ if (!m->buf) { m->buf = kmalloc(m->size = PAGE_SIZE, GFP_KERNEL); if (!m->buf) goto Enomem; } /* if not empty - flush it first */ if (m->count) { n = min(m->count, size); err = copy_to_user(buf, m->buf + m->from, n); if (err) goto Efault; m->count -= n; m->from += n; size -= n; buf += n; copied += n; if (!m->count) m->index++; if (!size) goto Done; } /* we need at least one record in buffer */ |
4cdfe84b5 [PATCH] deal with... |
188 189 |
pos = m->index; p = m->op->start(m, &pos); |
1da177e4c Linux-2.6.12-rc2 |
190 |
while (1) { |
1da177e4c Linux-2.6.12-rc2 |
191 192 193 194 |
err = PTR_ERR(p); if (!p || IS_ERR(p)) break; err = m->op->show(m, p); |
521b5d0c4 [PATCH] teach seq... |
195 |
if (err < 0) |
1da177e4c Linux-2.6.12-rc2 |
196 |
break; |
521b5d0c4 [PATCH] teach seq... |
197 198 |
if (unlikely(err)) m->count = 0; |
4cdfe84b5 [PATCH] deal with... |
199 200 201 202 203 |
if (unlikely(!m->count)) { p = m->op->next(m, p, &pos); m->index = pos; continue; } |
1da177e4c Linux-2.6.12-rc2 |
204 205 206 207 208 209 210 211 212 |
if (m->count < m->size) goto Fill; m->op->stop(m, p); kfree(m->buf); m->buf = kmalloc(m->size <<= 1, GFP_KERNEL); if (!m->buf) goto Enomem; m->count = 0; m->version = 0; |
4cdfe84b5 [PATCH] deal with... |
213 214 |
pos = m->index; p = m->op->start(m, &pos); |
1da177e4c Linux-2.6.12-rc2 |
215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 |
} m->op->stop(m, p); m->count = 0; goto Done; Fill: /* they want more? let's try to get some more */ while (m->count < size) { size_t offs = m->count; loff_t next = pos; p = m->op->next(m, p, &next); if (!p || IS_ERR(p)) { err = PTR_ERR(p); break; } err = m->op->show(m, p); |
521b5d0c4 [PATCH] teach seq... |
230 |
if (m->count == m->size || err) { |
1da177e4c Linux-2.6.12-rc2 |
231 |
m->count = offs; |
521b5d0c4 [PATCH] teach seq... |
232 233 |
if (likely(err <= 0)) break; |
1da177e4c Linux-2.6.12-rc2 |
234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 |
} pos = next; } m->op->stop(m, p); n = min(m->count, size); err = copy_to_user(buf, m->buf, n); if (err) goto Efault; copied += n; m->count -= n; if (m->count) m->from = n; else pos++; m->index = pos; Done: if (!copied) copied = err; |
8f19d4729 seq_file: properl... |
252 |
else { |
1da177e4c Linux-2.6.12-rc2 |
253 |
*ppos += copied; |
8f19d4729 seq_file: properl... |
254 255 |
m->read_pos += copied; } |
1da177e4c Linux-2.6.12-rc2 |
256 |
file->f_version = m->version; |
0ac1759ab [PATCH] sem2mutex... |
257 |
mutex_unlock(&m->lock); |
1da177e4c Linux-2.6.12-rc2 |
258 259 260 261 262 263 264 265 266 |
return copied; Enomem: err = -ENOMEM; goto Done; Efault: err = -EFAULT; goto Done; } EXPORT_SYMBOL(seq_read); |
1da177e4c Linux-2.6.12-rc2 |
267 268 |
/** * seq_lseek - ->llseek() method for sequential files. |
67be2dd1b [PATCH] DocBook: ... |
269 270 271 |
* @file: the file in question * @offset: new position * @origin: 0 for absolute, 1 for relative position |
1da177e4c Linux-2.6.12-rc2 |
272 273 274 275 276 277 |
* * Ready-made ->f_op->llseek() */ loff_t seq_lseek(struct file *file, loff_t offset, int origin) { struct seq_file *m = (struct seq_file *)file->private_data; |
16abef0e9 fs: use loff_t ty... |
278 |
loff_t retval = -EINVAL; |
1da177e4c Linux-2.6.12-rc2 |
279 |
|
0ac1759ab [PATCH] sem2mutex... |
280 |
mutex_lock(&m->lock); |
1da177e4c Linux-2.6.12-rc2 |
281 282 283 284 285 286 287 288 |
m->version = file->f_version; switch (origin) { case 1: offset += file->f_pos; case 0: if (offset < 0) break; retval = offset; |
8f19d4729 seq_file: properl... |
289 |
if (offset != m->read_pos) { |
1da177e4c Linux-2.6.12-rc2 |
290 291 292 293 294 |
while ((retval=traverse(m, offset)) == -EAGAIN) ; if (retval) { /* with extreme prejudice... */ file->f_pos = 0; |
8f19d4729 seq_file: properl... |
295 |
m->read_pos = 0; |
1da177e4c Linux-2.6.12-rc2 |
296 297 298 299 |
m->version = 0; m->index = 0; m->count = 0; } else { |
8f19d4729 seq_file: properl... |
300 |
m->read_pos = offset; |
1da177e4c Linux-2.6.12-rc2 |
301 302 303 304 |
retval = file->f_pos = offset; } } } |
1da177e4c Linux-2.6.12-rc2 |
305 |
file->f_version = m->version; |
00c5746da mutex_unlock() la... |
306 |
mutex_unlock(&m->lock); |
1da177e4c Linux-2.6.12-rc2 |
307 308 309 310 311 312 313 |
return retval; } EXPORT_SYMBOL(seq_lseek); /** * seq_release - free the structures associated with sequential file. * @file: file in question |
0f7fc9e4d [PATCH] VFS: chan... |
314 |
* @inode: file->f_path.dentry->d_inode |
1da177e4c Linux-2.6.12-rc2 |
315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 |
* * Frees the structures associated with sequential file; can be used * as ->f_op->release() if you don't have private data to destroy. */ int seq_release(struct inode *inode, struct file *file) { struct seq_file *m = (struct seq_file *)file->private_data; kfree(m->buf); kfree(m); return 0; } EXPORT_SYMBOL(seq_release); /** * seq_escape - print string into buffer, escaping some characters * @m: target buffer * @s: string * @esc: set of characters that need escaping * * Puts string into buffer, replacing each occurrence of character from * @esc with usual octal escape. Returns 0 in case of success, -1 - in * case of overflow. */ int seq_escape(struct seq_file *m, const char *s, const char *esc) { char *end = m->buf + m->size; char *p; char c; for (p = m->buf + m->count; (c = *s) != '\0' && p < end; s++) { if (!strchr(esc, c)) { *p++ = c; continue; } if (p + 3 < end) { *p++ = '\\'; *p++ = '0' + ((c & 0300) >> 6); *p++ = '0' + ((c & 070) >> 3); *p++ = '0' + (c & 07); continue; } m->count = m->size; return -1; } m->count = p - m->buf; return 0; } EXPORT_SYMBOL(seq_escape); int seq_printf(struct seq_file *m, const char *f, ...) { va_list args; int len; if (m->count < m->size) { va_start(args, f); len = vsnprintf(m->buf + m->count, m->size - m->count, f, args); va_end(args); if (m->count + len < m->size) { m->count += len; return 0; } } m->count = m->size; return -1; } EXPORT_SYMBOL(seq_printf); |
74e2f334f vfs, seqfile: mak... |
382 |
/** |
958086d17 vfs, seqfile: fix... |
383 384 385 386 |
* mangle_path - mangle and copy path to buffer beginning * @s: buffer start * @p: beginning of path in above buffer * @esc: set of characters that need escaping |
74e2f334f vfs, seqfile: mak... |
387 388 389 390 391 392 393 |
* * Copy the path from @p to @s, replacing each occurrence of character from * @esc with usual octal escape. * Returns pointer past last written character in @s, or NULL in case of * failure. */ char *mangle_path(char *s, char *p, char *esc) |
6092d0481 [patch 1/7] vfs: ... |
394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 |
{ while (s <= p) { char c = *p++; if (!c) { return s; } else if (!strchr(esc, c)) { *s++ = c; } else if (s + 4 > p) { break; } else { *s++ = '\\'; *s++ = '0' + ((c & 0300) >> 6); *s++ = '0' + ((c & 070) >> 3); *s++ = '0' + (c & 07); } } return NULL; } |
604094f46 vfs, seqfile: exp... |
412 |
EXPORT_SYMBOL(mangle_path); |
6092d0481 [patch 1/7] vfs: ... |
413 |
|
52afeefb9 expand some comme... |
414 415 416 417 418 419 420 421 |
/** * seq_path - seq_file interface to print a pathname * @m: the seq_file handle * @path: the struct path to print * @esc: set of characters to escape in the output * * return the absolute path of 'path', as represented by the * dentry / mnt pair in the path parameter. |
6092d0481 [patch 1/7] vfs: ... |
422 |
*/ |
c32c2f63a d_path: Make seq_... |
423 |
int seq_path(struct seq_file *m, struct path *path, char *esc) |
1da177e4c Linux-2.6.12-rc2 |
424 |
{ |
f84398068 vfs: seq_file: ad... |
425 426 427 428 429 430 |
char *buf; size_t size = seq_get_buf(m, &buf); int res = -1; if (size) { char *p = d_path(path, buf, size); |
1da177e4c Linux-2.6.12-rc2 |
431 |
if (!IS_ERR(p)) { |
f84398068 vfs: seq_file: ad... |
432 433 434 |
char *end = mangle_path(buf, p, esc); if (end) res = end - buf; |
1da177e4c Linux-2.6.12-rc2 |
435 436 |
} } |
f84398068 vfs: seq_file: ad... |
437 438 439 |
seq_commit(m, res); return res; |
1da177e4c Linux-2.6.12-rc2 |
440 441 |
} EXPORT_SYMBOL(seq_path); |
6092d0481 [patch 1/7] vfs: ... |
442 |
/* |
9d1bc6013 [patch 2/7] vfs: ... |
443 444 445 446 447 448 449 |
* Same as seq_path, but relative to supplied root. * * root may be changed, see __d_path(). */ int seq_path_root(struct seq_file *m, struct path *path, struct path *root, char *esc) { |
f84398068 vfs: seq_file: ad... |
450 451 452 453 454 |
char *buf; size_t size = seq_get_buf(m, &buf); int res = -ENAMETOOLONG; if (size) { |
9d1bc6013 [patch 2/7] vfs: ... |
455 456 457 |
char *p; spin_lock(&dcache_lock); |
f84398068 vfs: seq_file: ad... |
458 |
p = __d_path(path, root, buf, size); |
9d1bc6013 [patch 2/7] vfs: ... |
459 |
spin_unlock(&dcache_lock); |
f84398068 vfs: seq_file: ad... |
460 |
res = PTR_ERR(p); |
9d1bc6013 [patch 2/7] vfs: ... |
461 |
if (!IS_ERR(p)) { |
f84398068 vfs: seq_file: ad... |
462 463 464 465 466 |
char *end = mangle_path(buf, p, esc); if (end) res = end - buf; else res = -ENAMETOOLONG; |
9d1bc6013 [patch 2/7] vfs: ... |
467 468 |
} } |
f84398068 vfs: seq_file: ad... |
469 470 471 |
seq_commit(m, res); return res < 0 ? res : 0; |
9d1bc6013 [patch 2/7] vfs: ... |
472 473 474 |
} /* |
6092d0481 [patch 1/7] vfs: ... |
475 476 477 478 |
* returns the path of the 'dentry' from the root of its filesystem. */ int seq_dentry(struct seq_file *m, struct dentry *dentry, char *esc) { |
f84398068 vfs: seq_file: ad... |
479 480 481 482 483 484 |
char *buf; size_t size = seq_get_buf(m, &buf); int res = -1; if (size) { char *p = dentry_path(dentry, buf, size); |
6092d0481 [patch 1/7] vfs: ... |
485 |
if (!IS_ERR(p)) { |
f84398068 vfs: seq_file: ad... |
486 487 488 |
char *end = mangle_path(buf, p, esc); if (end) res = end - buf; |
6092d0481 [patch 1/7] vfs: ... |
489 490 |
} } |
f84398068 vfs: seq_file: ad... |
491 492 493 |
seq_commit(m, res); return res; |
6092d0481 [patch 1/7] vfs: ... |
494 |
} |
cb78a0ce6 bitmap: fix seq_b... |
495 496 |
int seq_bitmap(struct seq_file *m, const unsigned long *bits, unsigned int nr_bits) |
50ac2d694 seq_file: add seq... |
497 |
{ |
85dd030ed seq_file: don't c... |
498 499 500 501 502 503 504 |
if (m->count < m->size) { int len = bitmap_scnprintf(m->buf + m->count, m->size - m->count, bits, nr_bits); if (m->count + len < m->size) { m->count += len; return 0; } |
50ac2d694 seq_file: add seq... |
505 506 507 508 |
} m->count = m->size; return -1; } |
85dd030ed seq_file: don't c... |
509 |
EXPORT_SYMBOL(seq_bitmap); |
50ac2d694 seq_file: add seq... |
510 |
|
af76aba00 cpumask: fix seq_... |
511 |
int seq_bitmap_list(struct seq_file *m, const unsigned long *bits, |
3eda20118 seq_file: add seq... |
512 513 514 515 516 517 518 519 520 521 522 523 524 525 |
unsigned int nr_bits) { if (m->count < m->size) { int len = bitmap_scnlistprintf(m->buf + m->count, m->size - m->count, bits, nr_bits); if (m->count + len < m->size) { m->count += len; return 0; } } m->count = m->size; return -1; } EXPORT_SYMBOL(seq_bitmap_list); |
1da177e4c Linux-2.6.12-rc2 |
526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 |
static void *single_start(struct seq_file *p, loff_t *pos) { return NULL + (*pos == 0); } static void *single_next(struct seq_file *p, void *v, loff_t *pos) { ++*pos; return NULL; } static void single_stop(struct seq_file *p, void *v) { } int single_open(struct file *file, int (*show)(struct seq_file *, void *), void *data) { struct seq_operations *op = kmalloc(sizeof(*op), GFP_KERNEL); int res = -ENOMEM; if (op) { op->start = single_start; op->next = single_next; op->stop = single_stop; op->show = show; res = seq_open(file, op); if (!res) ((struct seq_file *)file->private_data)->private = data; else kfree(op); } return res; } EXPORT_SYMBOL(single_open); int single_release(struct inode *inode, struct file *file) { |
15ad7cdcf [PATCH] struct se... |
564 |
const struct seq_operations *op = ((struct seq_file *)file->private_data)->op; |
1da177e4c Linux-2.6.12-rc2 |
565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 |
int res = seq_release(inode, file); kfree(op); return res; } EXPORT_SYMBOL(single_release); int seq_release_private(struct inode *inode, struct file *file) { struct seq_file *seq = file->private_data; kfree(seq->private); seq->private = NULL; return seq_release(inode, file); } EXPORT_SYMBOL(seq_release_private); |
39699037a [FS] seq_file: In... |
580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 |
void *__seq_open_private(struct file *f, const struct seq_operations *ops, int psize) { int rc; void *private; struct seq_file *seq; private = kzalloc(psize, GFP_KERNEL); if (private == NULL) goto out; rc = seq_open(f, ops); if (rc < 0) goto out_free; seq = f->private_data; seq->private = private; return private; out_free: kfree(private); out: return NULL; } EXPORT_SYMBOL(__seq_open_private); int seq_open_private(struct file *filp, const struct seq_operations *ops, int psize) { return __seq_open_private(filp, ops, psize) ? 0 : -ENOMEM; } EXPORT_SYMBOL(seq_open_private); |
1da177e4c Linux-2.6.12-rc2 |
612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 |
int seq_putc(struct seq_file *m, char c) { if (m->count < m->size) { m->buf[m->count++] = c; return 0; } return -1; } EXPORT_SYMBOL(seq_putc); int seq_puts(struct seq_file *m, const char *s) { int len = strlen(s); if (m->count + len < m->size) { memcpy(m->buf + m->count, s, len); m->count += len; return 0; } m->count = m->size; return -1; } EXPORT_SYMBOL(seq_puts); |
bcf67e162 Make common helpe... |
634 |
|
0b923606e seq_file: add fun... |
635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 |
/** * seq_write - write arbitrary data to buffer * @seq: seq_file identifying the buffer to which data should be written * @data: data address * @len: number of bytes * * Return 0 on success, non-zero otherwise. */ int seq_write(struct seq_file *seq, const void *data, size_t len) { if (seq->count + len < seq->size) { memcpy(seq->buf + seq->count, data, len); seq->count += len; return 0; } seq->count = seq->size; return -1; } EXPORT_SYMBOL(seq_write); |
bcf67e162 Make common helpe... |
654 655 656 657 658 659 660 661 662 663 |
struct list_head *seq_list_start(struct list_head *head, loff_t pos) { struct list_head *lh; list_for_each(lh, head) if (pos-- == 0) return lh; return NULL; } |
bcf67e162 Make common helpe... |
664 665 666 667 668 669 670 671 672 |
EXPORT_SYMBOL(seq_list_start); struct list_head *seq_list_start_head(struct list_head *head, loff_t pos) { if (!pos) return head; return seq_list_start(head, pos - 1); } |
bcf67e162 Make common helpe... |
673 674 675 676 677 678 679 680 681 682 |
EXPORT_SYMBOL(seq_list_start_head); struct list_head *seq_list_next(void *v, struct list_head *head, loff_t *ppos) { struct list_head *lh; lh = ((struct list_head *)v)->next; ++*ppos; return lh == head ? NULL : lh; } |
bcf67e162 Make common helpe... |
683 |
EXPORT_SYMBOL(seq_list_next); |
66655de6d seq_file: Add hel... |
684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 |
/** * seq_hlist_start - start an iteration of a hlist * @head: the head of the hlist * @pos: the start position of the sequence * * Called at seq_file->op->start(). */ struct hlist_node *seq_hlist_start(struct hlist_head *head, loff_t pos) { struct hlist_node *node; hlist_for_each(node, head) if (pos-- == 0) return node; return NULL; } EXPORT_SYMBOL(seq_hlist_start); /** * seq_hlist_start_head - start an iteration of a hlist * @head: the head of the hlist * @pos: the start position of the sequence * * Called at seq_file->op->start(). Call this function if you want to * print a header at the top of the output. */ struct hlist_node *seq_hlist_start_head(struct hlist_head *head, loff_t pos) { if (!pos) return SEQ_START_TOKEN; return seq_hlist_start(head, pos - 1); } EXPORT_SYMBOL(seq_hlist_start_head); /** * seq_hlist_next - move to the next position of the hlist * @v: the current iterator * @head: the head of the hlist |
138860b95 seq_file: fix new... |
724 |
* @ppos: the current position |
66655de6d seq_file: Add hel... |
725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 |
* * Called at seq_file->op->next(). */ struct hlist_node *seq_hlist_next(void *v, struct hlist_head *head, loff_t *ppos) { struct hlist_node *node = v; ++*ppos; if (v == SEQ_START_TOKEN) return head->first; else return node->next; } EXPORT_SYMBOL(seq_hlist_next); |
1cc523271 seq_file: add RCU... |
740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 |
/** * seq_hlist_start_rcu - start an iteration of a hlist protected by RCU * @head: the head of the hlist * @pos: the start position of the sequence * * Called at seq_file->op->start(). * * This list-traversal primitive may safely run concurrently with * the _rcu list-mutation primitives such as hlist_add_head_rcu() * as long as the traversal is guarded by rcu_read_lock(). */ struct hlist_node *seq_hlist_start_rcu(struct hlist_head *head, loff_t pos) { struct hlist_node *node; __hlist_for_each_rcu(node, head) if (pos-- == 0) return node; return NULL; } EXPORT_SYMBOL(seq_hlist_start_rcu); /** * seq_hlist_start_head_rcu - start an iteration of a hlist protected by RCU * @head: the head of the hlist * @pos: the start position of the sequence * * Called at seq_file->op->start(). Call this function if you want to * print a header at the top of the output. * * This list-traversal primitive may safely run concurrently with * the _rcu list-mutation primitives such as hlist_add_head_rcu() * as long as the traversal is guarded by rcu_read_lock(). */ struct hlist_node *seq_hlist_start_head_rcu(struct hlist_head *head, loff_t pos) { if (!pos) return SEQ_START_TOKEN; return seq_hlist_start_rcu(head, pos - 1); } EXPORT_SYMBOL(seq_hlist_start_head_rcu); /** * seq_hlist_next_rcu - move to the next position of the hlist protected by RCU * @v: the current iterator * @head: the head of the hlist |
138860b95 seq_file: fix new... |
790 |
* @ppos: the current position |
1cc523271 seq_file: add RCU... |
791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 |
* * Called at seq_file->op->next(). * * This list-traversal primitive may safely run concurrently with * the _rcu list-mutation primitives such as hlist_add_head_rcu() * as long as the traversal is guarded by rcu_read_lock(). */ struct hlist_node *seq_hlist_next_rcu(void *v, struct hlist_head *head, loff_t *ppos) { struct hlist_node *node = v; ++*ppos; if (v == SEQ_START_TOKEN) return rcu_dereference(head->first); else return rcu_dereference(node->next); } EXPORT_SYMBOL(seq_hlist_next_rcu); |