1 // SPDX-License-Identifier: GPL-2.0 1 // SPDX-License-Identifier: GPL-2.0
2 /* 2 /*
3 * linux/fs/seq_file.c 3 * linux/fs/seq_file.c
4 * 4 *
5 * helper functions for making synthetic files 5 * helper functions for making synthetic files from sequences of records.
6 * initial implementation -- AV, Oct 2001. 6 * initial implementation -- AV, Oct 2001.
7 */ 7 */
8 8
9 #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt 9 #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
10 10
11 #include <linux/cache.h> 11 #include <linux/cache.h>
12 #include <linux/fs.h> 12 #include <linux/fs.h>
13 #include <linux/export.h> 13 #include <linux/export.h>
14 #include <linux/seq_file.h> 14 #include <linux/seq_file.h>
15 #include <linux/vmalloc.h> 15 #include <linux/vmalloc.h>
16 #include <linux/slab.h> 16 #include <linux/slab.h>
17 #include <linux/cred.h> 17 #include <linux/cred.h>
18 #include <linux/mm.h> 18 #include <linux/mm.h>
19 #include <linux/printk.h> 19 #include <linux/printk.h>
20 #include <linux/string_helpers.h> 20 #include <linux/string_helpers.h>
21 #include <linux/uio.h> 21 #include <linux/uio.h>
22 22
23 #include <linux/uaccess.h> 23 #include <linux/uaccess.h>
24 #include <asm/page.h> 24 #include <asm/page.h>
25 25
26 static struct kmem_cache *seq_file_cache __ro_ 26 static struct kmem_cache *seq_file_cache __ro_after_init;
27 27
28 static void seq_set_overflow(struct seq_file * 28 static void seq_set_overflow(struct seq_file *m)
29 { 29 {
30 m->count = m->size; 30 m->count = m->size;
31 } 31 }
32 32
33 static void *seq_buf_alloc(unsigned long size) 33 static void *seq_buf_alloc(unsigned long size)
34 { 34 {
35 if (unlikely(size > MAX_RW_COUNT)) 35 if (unlikely(size > MAX_RW_COUNT))
36 return NULL; 36 return NULL;
37 37
38 return kvmalloc(size, GFP_KERNEL_ACCOU 38 return kvmalloc(size, GFP_KERNEL_ACCOUNT);
39 } 39 }
40 40
41 /** 41 /**
42 * seq_open - initialize sequential 42 * seq_open - initialize sequential file
43 * @file: file we initialize 43 * @file: file we initialize
44 * @op: method table describing the seque 44 * @op: method table describing the sequence
45 * 45 *
46 * seq_open() sets @file, associating it 46 * seq_open() sets @file, associating it with a sequence described
47 * by @op. @op->start() sets the iterato 47 * by @op. @op->start() sets the iterator up and returns the first
48 * element of sequence. @op->stop() shuts 48 * element of sequence. @op->stop() shuts it down. @op->next()
49 * returns the next element of sequence. 49 * returns the next element of sequence. @op->show() prints element
50 * into the buffer. In case of error ->s 50 * into the buffer. In case of error ->start() and ->next() return
51 * ERR_PTR(error). In the end of sequenc 51 * ERR_PTR(error). In the end of sequence they return %NULL. ->show()
52 * returns 0 in case of success and negat 52 * returns 0 in case of success and negative number in case of error.
53 * Returning SEQ_SKIP means "discard this 53 * Returning SEQ_SKIP means "discard this element and move on".
54 * Note: seq_open() will allocate a struc 54 * Note: seq_open() will allocate a struct seq_file and store its
55 * pointer in @file->private_data. This p 55 * pointer in @file->private_data. This pointer should not be modified.
56 */ 56 */
57 int seq_open(struct file *file, const struct s 57 int seq_open(struct file *file, const struct seq_operations *op)
58 { 58 {
59 struct seq_file *p; 59 struct seq_file *p;
60 60
61 WARN_ON(file->private_data); 61 WARN_ON(file->private_data);
62 62
63 p = kmem_cache_zalloc(seq_file_cache, 63 p = kmem_cache_zalloc(seq_file_cache, GFP_KERNEL);
64 if (!p) 64 if (!p)
65 return -ENOMEM; 65 return -ENOMEM;
66 66
67 file->private_data = p; 67 file->private_data = p;
68 68
69 mutex_init(&p->lock); 69 mutex_init(&p->lock);
70 p->op = op; 70 p->op = op;
71 71
72 // No refcounting: the lifetime of 'p' 72 // No refcounting: the lifetime of 'p' is constrained
73 // to the lifetime of the file. 73 // to the lifetime of the file.
74 p->file = file; 74 p->file = file;
75 75
76 /* 76 /*
77 * seq_files support lseek() and pread 77 * seq_files support lseek() and pread(). They do not implement
78 * write() at all, but we clear FMODE_ 78 * write() at all, but we clear FMODE_PWRITE here for historical
79 * reasons. 79 * reasons.
80 * 80 *
81 * If a client of seq_files a) impleme 81 * If a client of seq_files a) implements file.write() and b) wishes to
82 * support pwrite() then that client w 82 * support pwrite() then that client will need to implement its own
83 * file.open() which calls seq_open() 83 * file.open() which calls seq_open() and then sets FMODE_PWRITE.
84 */ 84 */
85 file->f_mode &= ~FMODE_PWRITE; 85 file->f_mode &= ~FMODE_PWRITE;
86 return 0; 86 return 0;
87 } 87 }
88 EXPORT_SYMBOL(seq_open); 88 EXPORT_SYMBOL(seq_open);
89 89
90 static int traverse(struct seq_file *m, loff_t 90 static int traverse(struct seq_file *m, loff_t offset)
91 { 91 {
92 loff_t pos = 0; 92 loff_t pos = 0;
93 int error = 0; 93 int error = 0;
94 void *p; 94 void *p;
95 95
96 m->index = 0; 96 m->index = 0;
97 m->count = m->from = 0; 97 m->count = m->from = 0;
98 if (!offset) 98 if (!offset)
99 return 0; 99 return 0;
100 100
101 if (!m->buf) { 101 if (!m->buf) {
102 m->buf = seq_buf_alloc(m->size 102 m->buf = seq_buf_alloc(m->size = PAGE_SIZE);
103 if (!m->buf) 103 if (!m->buf)
104 return -ENOMEM; 104 return -ENOMEM;
105 } 105 }
106 p = m->op->start(m, &m->index); 106 p = m->op->start(m, &m->index);
107 while (p) { 107 while (p) {
108 error = PTR_ERR(p); 108 error = PTR_ERR(p);
109 if (IS_ERR(p)) 109 if (IS_ERR(p))
110 break; 110 break;
111 error = m->op->show(m, p); 111 error = m->op->show(m, p);
112 if (error < 0) 112 if (error < 0)
113 break; 113 break;
114 if (unlikely(error)) { 114 if (unlikely(error)) {
115 error = 0; 115 error = 0;
116 m->count = 0; 116 m->count = 0;
117 } 117 }
118 if (seq_has_overflowed(m)) 118 if (seq_has_overflowed(m))
119 goto Eoverflow; 119 goto Eoverflow;
120 p = m->op->next(m, p, &m->inde 120 p = m->op->next(m, p, &m->index);
121 if (pos + m->count > offset) { 121 if (pos + m->count > offset) {
122 m->from = offset - pos 122 m->from = offset - pos;
123 m->count -= m->from; 123 m->count -= m->from;
124 break; 124 break;
125 } 125 }
126 pos += m->count; 126 pos += m->count;
127 m->count = 0; 127 m->count = 0;
128 if (pos == offset) 128 if (pos == offset)
129 break; 129 break;
130 } 130 }
131 m->op->stop(m, p); 131 m->op->stop(m, p);
132 return error; 132 return error;
133 133
134 Eoverflow: 134 Eoverflow:
135 m->op->stop(m, p); 135 m->op->stop(m, p);
136 kvfree(m->buf); 136 kvfree(m->buf);
137 m->count = 0; 137 m->count = 0;
138 m->buf = seq_buf_alloc(m->size <<= 1); 138 m->buf = seq_buf_alloc(m->size <<= 1);
139 return !m->buf ? -ENOMEM : -EAGAIN; 139 return !m->buf ? -ENOMEM : -EAGAIN;
140 } 140 }
141 141
142 /** 142 /**
143 * seq_read - ->read() method for se 143 * seq_read - ->read() method for sequential files.
144 * @file: the file to read from 144 * @file: the file to read from
145 * @buf: the buffer to read to 145 * @buf: the buffer to read to
146 * @size: the maximum number of bytes to 146 * @size: the maximum number of bytes to read
147 * @ppos: the current position in the fil 147 * @ppos: the current position in the file
148 * 148 *
149 * Ready-made ->f_op->read() 149 * Ready-made ->f_op->read()
150 */ 150 */
151 ssize_t seq_read(struct file *file, char __use 151 ssize_t seq_read(struct file *file, char __user *buf, size_t size, loff_t *ppos)
152 { 152 {
153 struct iovec iov = { .iov_base = buf, 153 struct iovec iov = { .iov_base = buf, .iov_len = size};
154 struct kiocb kiocb; 154 struct kiocb kiocb;
155 struct iov_iter iter; 155 struct iov_iter iter;
156 ssize_t ret; 156 ssize_t ret;
157 157
158 init_sync_kiocb(&kiocb, file); 158 init_sync_kiocb(&kiocb, file);
159 iov_iter_init(&iter, ITER_DEST, &iov, !! 159 iov_iter_init(&iter, READ, &iov, 1, size);
160 160
161 kiocb.ki_pos = *ppos; 161 kiocb.ki_pos = *ppos;
162 ret = seq_read_iter(&kiocb, &iter); 162 ret = seq_read_iter(&kiocb, &iter);
163 *ppos = kiocb.ki_pos; 163 *ppos = kiocb.ki_pos;
164 return ret; 164 return ret;
165 } 165 }
166 EXPORT_SYMBOL(seq_read); 166 EXPORT_SYMBOL(seq_read);
167 167
168 /* 168 /*
169 * Ready-made ->f_op->read_iter() 169 * Ready-made ->f_op->read_iter()
170 */ 170 */
171 ssize_t seq_read_iter(struct kiocb *iocb, stru 171 ssize_t seq_read_iter(struct kiocb *iocb, struct iov_iter *iter)
172 { 172 {
173 struct seq_file *m = iocb->ki_filp->pr 173 struct seq_file *m = iocb->ki_filp->private_data;
174 size_t copied = 0; 174 size_t copied = 0;
175 size_t n; 175 size_t n;
176 void *p; 176 void *p;
177 int err = 0; 177 int err = 0;
178 178
179 if (!iov_iter_count(iter)) 179 if (!iov_iter_count(iter))
180 return 0; 180 return 0;
181 181
182 mutex_lock(&m->lock); 182 mutex_lock(&m->lock);
183 183
184 /* 184 /*
185 * if request is to read from zero off 185 * if request is to read from zero offset, reset iterator to first
186 * record as it might have been alread 186 * record as it might have been already advanced by previous requests
187 */ 187 */
188 if (iocb->ki_pos == 0) { 188 if (iocb->ki_pos == 0) {
189 m->index = 0; 189 m->index = 0;
190 m->count = 0; 190 m->count = 0;
191 } 191 }
192 192
193 /* Don't assume ki_pos is where we lef 193 /* Don't assume ki_pos is where we left it */
194 if (unlikely(iocb->ki_pos != m->read_p 194 if (unlikely(iocb->ki_pos != m->read_pos)) {
195 while ((err = traverse(m, iocb 195 while ((err = traverse(m, iocb->ki_pos)) == -EAGAIN)
196 ; 196 ;
197 if (err) { 197 if (err) {
198 /* With prejudice... * 198 /* With prejudice... */
199 m->read_pos = 0; 199 m->read_pos = 0;
200 m->index = 0; 200 m->index = 0;
201 m->count = 0; 201 m->count = 0;
202 goto Done; 202 goto Done;
203 } else { 203 } else {
204 m->read_pos = iocb->ki 204 m->read_pos = iocb->ki_pos;
205 } 205 }
206 } 206 }
207 207
208 /* grab buffer if we didn't have one * 208 /* grab buffer if we didn't have one */
209 if (!m->buf) { 209 if (!m->buf) {
210 m->buf = seq_buf_alloc(m->size 210 m->buf = seq_buf_alloc(m->size = PAGE_SIZE);
211 if (!m->buf) 211 if (!m->buf)
212 goto Enomem; 212 goto Enomem;
213 } 213 }
214 // something left in the buffer - copy 214 // something left in the buffer - copy it out first
215 if (m->count) { 215 if (m->count) {
216 n = copy_to_iter(m->buf + m->f 216 n = copy_to_iter(m->buf + m->from, m->count, iter);
217 m->count -= n; 217 m->count -= n;
218 m->from += n; 218 m->from += n;
219 copied += n; 219 copied += n;
220 if (m->count) // hadn't mana 220 if (m->count) // hadn't managed to copy everything
221 goto Done; 221 goto Done;
222 } 222 }
223 // get a non-empty record in the buffe 223 // get a non-empty record in the buffer
224 m->from = 0; 224 m->from = 0;
225 p = m->op->start(m, &m->index); 225 p = m->op->start(m, &m->index);
226 while (1) { 226 while (1) {
227 err = PTR_ERR(p); 227 err = PTR_ERR(p);
228 if (!p || IS_ERR(p)) // EOF 228 if (!p || IS_ERR(p)) // EOF or an error
229 break; 229 break;
230 err = m->op->show(m, p); 230 err = m->op->show(m, p);
231 if (err < 0) // har 231 if (err < 0) // hard error
232 break; 232 break;
233 if (unlikely(err)) // ->s 233 if (unlikely(err)) // ->show() says "skip it"
234 m->count = 0; 234 m->count = 0;
235 if (unlikely(!m->count)) { // 235 if (unlikely(!m->count)) { // empty record
236 p = m->op->next(m, p, 236 p = m->op->next(m, p, &m->index);
237 continue; 237 continue;
238 } 238 }
239 if (!seq_has_overflowed(m)) // 239 if (!seq_has_overflowed(m)) // got it
240 goto Fill; 240 goto Fill;
241 // need a bigger buffer 241 // need a bigger buffer
242 m->op->stop(m, p); 242 m->op->stop(m, p);
243 kvfree(m->buf); 243 kvfree(m->buf);
244 m->count = 0; 244 m->count = 0;
245 m->buf = seq_buf_alloc(m->size 245 m->buf = seq_buf_alloc(m->size <<= 1);
246 if (!m->buf) 246 if (!m->buf)
247 goto Enomem; 247 goto Enomem;
248 p = m->op->start(m, &m->index) 248 p = m->op->start(m, &m->index);
249 } 249 }
250 // EOF or an error 250 // EOF or an error
251 m->op->stop(m, p); 251 m->op->stop(m, p);
252 m->count = 0; 252 m->count = 0;
253 goto Done; 253 goto Done;
254 Fill: 254 Fill:
255 // one non-empty record is in the buff 255 // one non-empty record is in the buffer; if they want more,
256 // try to fit more in, but in any case 256 // try to fit more in, but in any case we need to advance
257 // the iterator once for every record 257 // the iterator once for every record shown.
258 while (1) { 258 while (1) {
259 size_t offs = m->count; 259 size_t offs = m->count;
260 loff_t pos = m->index; 260 loff_t pos = m->index;
261 261
262 p = m->op->next(m, p, &m->inde 262 p = m->op->next(m, p, &m->index);
263 if (pos == m->index) { 263 if (pos == m->index) {
264 pr_info_ratelimited("b 264 pr_info_ratelimited("buggy .next function %ps did not update position index\n",
265 m- 265 m->op->next);
266 m->index++; 266 m->index++;
267 } 267 }
268 if (!p || IS_ERR(p)) // no 268 if (!p || IS_ERR(p)) // no next record for us
269 break; 269 break;
270 if (m->count >= iov_iter_count 270 if (m->count >= iov_iter_count(iter))
271 break; 271 break;
272 err = m->op->show(m, p); 272 err = m->op->show(m, p);
273 if (err > 0) { // ->s 273 if (err > 0) { // ->show() says "skip it"
274 m->count = offs; 274 m->count = offs;
275 } else if (err || seq_has_over 275 } else if (err || seq_has_overflowed(m)) {
276 m->count = offs; 276 m->count = offs;
277 break; 277 break;
278 } 278 }
279 } 279 }
280 m->op->stop(m, p); 280 m->op->stop(m, p);
281 n = copy_to_iter(m->buf, m->count, ite 281 n = copy_to_iter(m->buf, m->count, iter);
282 copied += n; 282 copied += n;
283 m->count -= n; 283 m->count -= n;
284 m->from = n; 284 m->from = n;
285 Done: 285 Done:
286 if (unlikely(!copied)) { 286 if (unlikely(!copied)) {
287 copied = m->count ? -EFAULT : 287 copied = m->count ? -EFAULT : err;
288 } else { 288 } else {
289 iocb->ki_pos += copied; 289 iocb->ki_pos += copied;
290 m->read_pos += copied; 290 m->read_pos += copied;
291 } 291 }
292 mutex_unlock(&m->lock); 292 mutex_unlock(&m->lock);
293 return copied; 293 return copied;
294 Enomem: 294 Enomem:
295 err = -ENOMEM; 295 err = -ENOMEM;
296 goto Done; 296 goto Done;
297 } 297 }
298 EXPORT_SYMBOL(seq_read_iter); 298 EXPORT_SYMBOL(seq_read_iter);
299 299
300 /** 300 /**
301 * seq_lseek - ->llseek() method for 301 * seq_lseek - ->llseek() method for sequential files.
302 * @file: the file in question 302 * @file: the file in question
303 * @offset: new position 303 * @offset: new position
304 * @whence: 0 for absolute, 1 for relativ 304 * @whence: 0 for absolute, 1 for relative position
305 * 305 *
306 * Ready-made ->f_op->llseek() 306 * Ready-made ->f_op->llseek()
307 */ 307 */
308 loff_t seq_lseek(struct file *file, loff_t off 308 loff_t seq_lseek(struct file *file, loff_t offset, int whence)
309 { 309 {
310 struct seq_file *m = file->private_dat 310 struct seq_file *m = file->private_data;
311 loff_t retval = -EINVAL; 311 loff_t retval = -EINVAL;
312 312
313 mutex_lock(&m->lock); 313 mutex_lock(&m->lock);
314 switch (whence) { 314 switch (whence) {
315 case SEEK_CUR: 315 case SEEK_CUR:
316 offset += file->f_pos; 316 offset += file->f_pos;
317 fallthrough; 317 fallthrough;
318 case SEEK_SET: 318 case SEEK_SET:
319 if (offset < 0) 319 if (offset < 0)
320 break; 320 break;
321 retval = offset; 321 retval = offset;
322 if (offset != m->read_pos) { 322 if (offset != m->read_pos) {
323 while ((retval = trave 323 while ((retval = traverse(m, offset)) == -EAGAIN)
324 ; 324 ;
325 if (retval) { 325 if (retval) {
326 /* with extrem 326 /* with extreme prejudice... */
327 file->f_pos = 327 file->f_pos = 0;
328 m->read_pos = 328 m->read_pos = 0;
329 m->index = 0; 329 m->index = 0;
330 m->count = 0; 330 m->count = 0;
331 } else { 331 } else {
332 m->read_pos = 332 m->read_pos = offset;
333 retval = file- 333 retval = file->f_pos = offset;
334 } 334 }
335 } else { 335 } else {
336 file->f_pos = offset; 336 file->f_pos = offset;
337 } 337 }
338 } 338 }
339 mutex_unlock(&m->lock); 339 mutex_unlock(&m->lock);
340 return retval; 340 return retval;
341 } 341 }
342 EXPORT_SYMBOL(seq_lseek); 342 EXPORT_SYMBOL(seq_lseek);
343 343
344 /** 344 /**
345 * seq_release - free the structures as 345 * seq_release - free the structures associated with sequential file.
346 * @file: file in question 346 * @file: file in question
347 * @inode: its inode 347 * @inode: its inode
348 * 348 *
349 * Frees the structures associated with s 349 * Frees the structures associated with sequential file; can be used
350 * as ->f_op->release() if you don't have 350 * as ->f_op->release() if you don't have private data to destroy.
351 */ 351 */
352 int seq_release(struct inode *inode, struct fi 352 int seq_release(struct inode *inode, struct file *file)
353 { 353 {
354 struct seq_file *m = file->private_dat 354 struct seq_file *m = file->private_data;
355 kvfree(m->buf); 355 kvfree(m->buf);
356 kmem_cache_free(seq_file_cache, m); 356 kmem_cache_free(seq_file_cache, m);
357 return 0; 357 return 0;
358 } 358 }
359 EXPORT_SYMBOL(seq_release); 359 EXPORT_SYMBOL(seq_release);
360 360
361 /** 361 /**
362 * seq_escape_mem - print data into buffer, es 362 * seq_escape_mem - print data into buffer, escaping some characters
363 * @m: target buffer 363 * @m: target buffer
364 * @src: source buffer 364 * @src: source buffer
365 * @len: size of source buffer 365 * @len: size of source buffer
366 * @flags: flags to pass to string_escape_mem( 366 * @flags: flags to pass to string_escape_mem()
367 * @esc: set of characters that need escaping 367 * @esc: set of characters that need escaping
368 * 368 *
369 * Puts data into buffer, replacing each occur 369 * Puts data into buffer, replacing each occurrence of character from
370 * given class (defined by @flags and @esc) wi 370 * given class (defined by @flags and @esc) with printable escaped sequence.
371 * 371 *
372 * Use seq_has_overflowed() to check for error 372 * Use seq_has_overflowed() to check for errors.
373 */ 373 */
374 void seq_escape_mem(struct seq_file *m, const 374 void seq_escape_mem(struct seq_file *m, const char *src, size_t len,
375 unsigned int flags, const 375 unsigned int flags, const char *esc)
376 { 376 {
377 char *buf; 377 char *buf;
378 size_t size = seq_get_buf(m, &buf); 378 size_t size = seq_get_buf(m, &buf);
379 int ret; 379 int ret;
380 380
381 ret = string_escape_mem(src, len, buf, 381 ret = string_escape_mem(src, len, buf, size, flags, esc);
382 seq_commit(m, ret < size ? ret : -1); 382 seq_commit(m, ret < size ? ret : -1);
383 } 383 }
384 EXPORT_SYMBOL(seq_escape_mem); 384 EXPORT_SYMBOL(seq_escape_mem);
385 385
386 void seq_vprintf(struct seq_file *m, const cha 386 void seq_vprintf(struct seq_file *m, const char *f, va_list args)
387 { 387 {
388 int len; 388 int len;
389 389
390 if (m->count < m->size) { 390 if (m->count < m->size) {
391 len = vsnprintf(m->buf + m->co 391 len = vsnprintf(m->buf + m->count, m->size - m->count, f, args);
392 if (m->count + len < m->size) 392 if (m->count + len < m->size) {
393 m->count += len; 393 m->count += len;
394 return; 394 return;
395 } 395 }
396 } 396 }
397 seq_set_overflow(m); 397 seq_set_overflow(m);
398 } 398 }
399 EXPORT_SYMBOL(seq_vprintf); 399 EXPORT_SYMBOL(seq_vprintf);
400 400
401 void seq_printf(struct seq_file *m, const char 401 void seq_printf(struct seq_file *m, const char *f, ...)
402 { 402 {
403 va_list args; 403 va_list args;
404 404
405 va_start(args, f); 405 va_start(args, f);
406 seq_vprintf(m, f, args); 406 seq_vprintf(m, f, args);
407 va_end(args); 407 va_end(args);
408 } 408 }
409 EXPORT_SYMBOL(seq_printf); 409 EXPORT_SYMBOL(seq_printf);
410 410
411 #ifdef CONFIG_BINARY_PRINTF 411 #ifdef CONFIG_BINARY_PRINTF
412 void seq_bprintf(struct seq_file *m, const cha 412 void seq_bprintf(struct seq_file *m, const char *f, const u32 *binary)
413 { 413 {
414 int len; 414 int len;
415 415
416 if (m->count < m->size) { 416 if (m->count < m->size) {
417 len = bstr_printf(m->buf + m-> 417 len = bstr_printf(m->buf + m->count, m->size - m->count, f,
418 binary); 418 binary);
419 if (m->count + len < m->size) 419 if (m->count + len < m->size) {
420 m->count += len; 420 m->count += len;
421 return; 421 return;
422 } 422 }
423 } 423 }
424 seq_set_overflow(m); 424 seq_set_overflow(m);
425 } 425 }
426 EXPORT_SYMBOL(seq_bprintf); 426 EXPORT_SYMBOL(seq_bprintf);
427 #endif /* CONFIG_BINARY_PRINTF */ 427 #endif /* CONFIG_BINARY_PRINTF */
428 428
429 /** 429 /**
430 * mangle_path - mangle and copy path t 430 * mangle_path - mangle and copy path to buffer beginning
431 * @s: buffer start 431 * @s: buffer start
432 * @p: beginning of path in above buffer 432 * @p: beginning of path in above buffer
433 * @esc: set of characters that need esca 433 * @esc: set of characters that need escaping
434 * 434 *
435 * Copy the path from @p to @s, replacing 435 * Copy the path from @p to @s, replacing each occurrence of character from
436 * @esc with usual octal escape. 436 * @esc with usual octal escape.
437 * Returns pointer past last written char 437 * Returns pointer past last written character in @s, or NULL in case of
438 * failure. 438 * failure.
439 */ 439 */
440 char *mangle_path(char *s, const char *p, cons 440 char *mangle_path(char *s, const char *p, const char *esc)
441 { 441 {
442 while (s <= p) { 442 while (s <= p) {
443 char c = *p++; 443 char c = *p++;
444 if (!c) { 444 if (!c) {
445 return s; 445 return s;
446 } else if (!strchr(esc, c)) { 446 } else if (!strchr(esc, c)) {
447 *s++ = c; 447 *s++ = c;
448 } else if (s + 4 > p) { 448 } else if (s + 4 > p) {
449 break; 449 break;
450 } else { 450 } else {
451 *s++ = '\\'; 451 *s++ = '\\';
452 *s++ = '' + ((c & 0300 452 *s++ = '' + ((c & 0300) >> 6);
453 *s++ = '' + ((c & 070) 453 *s++ = '' + ((c & 070) >> 3);
454 *s++ = '' + (c & 07); 454 *s++ = '' + (c & 07);
455 } 455 }
456 } 456 }
457 return NULL; 457 return NULL;
458 } 458 }
459 EXPORT_SYMBOL(mangle_path); 459 EXPORT_SYMBOL(mangle_path);
460 460
461 /** 461 /**
462 * seq_path - seq_file interface to print a pa 462 * seq_path - seq_file interface to print a pathname
463 * @m: the seq_file handle 463 * @m: the seq_file handle
464 * @path: the struct path to print 464 * @path: the struct path to print
465 * @esc: set of characters to escape in the ou 465 * @esc: set of characters to escape in the output
466 * 466 *
467 * return the absolute path of 'path', as repr 467 * return the absolute path of 'path', as represented by the
468 * dentry / mnt pair in the path parameter. 468 * dentry / mnt pair in the path parameter.
469 */ 469 */
470 int seq_path(struct seq_file *m, const struct 470 int seq_path(struct seq_file *m, const struct path *path, const char *esc)
471 { 471 {
472 char *buf; 472 char *buf;
473 size_t size = seq_get_buf(m, &buf); 473 size_t size = seq_get_buf(m, &buf);
474 int res = -1; 474 int res = -1;
475 475
476 if (size) { 476 if (size) {
477 char *p = d_path(path, buf, si 477 char *p = d_path(path, buf, size);
478 if (!IS_ERR(p)) { 478 if (!IS_ERR(p)) {
479 char *end = mangle_pat 479 char *end = mangle_path(buf, p, esc);
480 if (end) 480 if (end)
481 res = end - bu 481 res = end - buf;
482 } 482 }
483 } 483 }
484 seq_commit(m, res); 484 seq_commit(m, res);
485 485
486 return res; 486 return res;
487 } 487 }
488 EXPORT_SYMBOL(seq_path); 488 EXPORT_SYMBOL(seq_path);
489 489
490 /** 490 /**
491 * seq_file_path - seq_file interface to print 491 * seq_file_path - seq_file interface to print a pathname of a file
492 * @m: the seq_file handle 492 * @m: the seq_file handle
493 * @file: the struct file to print 493 * @file: the struct file to print
494 * @esc: set of characters to escape in the ou 494 * @esc: set of characters to escape in the output
495 * 495 *
496 * return the absolute path to the file. 496 * return the absolute path to the file.
497 */ 497 */
498 int seq_file_path(struct seq_file *m, struct f 498 int seq_file_path(struct seq_file *m, struct file *file, const char *esc)
499 { 499 {
500 return seq_path(m, &file->f_path, esc) 500 return seq_path(m, &file->f_path, esc);
501 } 501 }
502 EXPORT_SYMBOL(seq_file_path); 502 EXPORT_SYMBOL(seq_file_path);
503 503
504 /* 504 /*
505 * Same as seq_path, but relative to supplied 505 * Same as seq_path, but relative to supplied root.
506 */ 506 */
507 int seq_path_root(struct seq_file *m, const st 507 int seq_path_root(struct seq_file *m, const struct path *path,
508 const struct path *root, con 508 const struct path *root, const char *esc)
509 { 509 {
510 char *buf; 510 char *buf;
511 size_t size = seq_get_buf(m, &buf); 511 size_t size = seq_get_buf(m, &buf);
512 int res = -ENAMETOOLONG; 512 int res = -ENAMETOOLONG;
513 513
514 if (size) { 514 if (size) {
515 char *p; 515 char *p;
516 516
517 p = __d_path(path, root, buf, 517 p = __d_path(path, root, buf, size);
518 if (!p) 518 if (!p)
519 return SEQ_SKIP; 519 return SEQ_SKIP;
520 res = PTR_ERR(p); 520 res = PTR_ERR(p);
521 if (!IS_ERR(p)) { 521 if (!IS_ERR(p)) {
522 char *end = mangle_pat 522 char *end = mangle_path(buf, p, esc);
523 if (end) 523 if (end)
524 res = end - bu 524 res = end - buf;
525 else 525 else
526 res = -ENAMETO 526 res = -ENAMETOOLONG;
527 } 527 }
528 } 528 }
529 seq_commit(m, res); 529 seq_commit(m, res);
530 530
531 return res < 0 && res != -ENAMETOOLONG 531 return res < 0 && res != -ENAMETOOLONG ? res : 0;
532 } 532 }
533 533
534 /* 534 /*
535 * returns the path of the 'dentry' from the r 535 * returns the path of the 'dentry' from the root of its filesystem.
536 */ 536 */
537 int seq_dentry(struct seq_file *m, struct dent 537 int seq_dentry(struct seq_file *m, struct dentry *dentry, const char *esc)
538 { 538 {
539 char *buf; 539 char *buf;
540 size_t size = seq_get_buf(m, &buf); 540 size_t size = seq_get_buf(m, &buf);
541 int res = -1; 541 int res = -1;
542 542
543 if (size) { 543 if (size) {
544 char *p = dentry_path(dentry, 544 char *p = dentry_path(dentry, buf, size);
545 if (!IS_ERR(p)) { 545 if (!IS_ERR(p)) {
546 char *end = mangle_pat 546 char *end = mangle_path(buf, p, esc);
547 if (end) 547 if (end)
548 res = end - bu 548 res = end - buf;
549 } 549 }
550 } 550 }
551 seq_commit(m, res); 551 seq_commit(m, res);
552 552
553 return res; 553 return res;
554 } 554 }
555 EXPORT_SYMBOL(seq_dentry); 555 EXPORT_SYMBOL(seq_dentry);
556 556
557 void *single_start(struct seq_file *p, loff_t 557 void *single_start(struct seq_file *p, loff_t *pos)
558 { 558 {
559 return *pos ? NULL : SEQ_START_TOKEN; 559 return *pos ? NULL : SEQ_START_TOKEN;
560 } 560 }
561 561
562 static void *single_next(struct seq_file *p, v 562 static void *single_next(struct seq_file *p, void *v, loff_t *pos)
563 { 563 {
564 ++*pos; 564 ++*pos;
565 return NULL; 565 return NULL;
566 } 566 }
567 567
568 static void single_stop(struct seq_file *p, vo 568 static void single_stop(struct seq_file *p, void *v)
569 { 569 {
570 } 570 }
571 571
572 int single_open(struct file *file, int (*show) 572 int single_open(struct file *file, int (*show)(struct seq_file *, void *),
573 void *data) 573 void *data)
574 { 574 {
575 struct seq_operations *op = kmalloc(si 575 struct seq_operations *op = kmalloc(sizeof(*op), GFP_KERNEL_ACCOUNT);
576 int res = -ENOMEM; 576 int res = -ENOMEM;
577 577
578 if (op) { 578 if (op) {
579 op->start = single_start; 579 op->start = single_start;
580 op->next = single_next; 580 op->next = single_next;
581 op->stop = single_stop; 581 op->stop = single_stop;
582 op->show = show; 582 op->show = show;
583 res = seq_open(file, op); 583 res = seq_open(file, op);
584 if (!res) 584 if (!res)
585 ((struct seq_file *)fi 585 ((struct seq_file *)file->private_data)->private = data;
586 else 586 else
587 kfree(op); 587 kfree(op);
588 } 588 }
589 return res; 589 return res;
590 } 590 }
591 EXPORT_SYMBOL(single_open); 591 EXPORT_SYMBOL(single_open);
592 592
593 int single_open_size(struct file *file, int (* 593 int single_open_size(struct file *file, int (*show)(struct seq_file *, void *),
594 void *data, size_t size) 594 void *data, size_t size)
595 { 595 {
596 char *buf = seq_buf_alloc(size); 596 char *buf = seq_buf_alloc(size);
597 int ret; 597 int ret;
598 if (!buf) 598 if (!buf)
599 return -ENOMEM; 599 return -ENOMEM;
600 ret = single_open(file, show, data); 600 ret = single_open(file, show, data);
601 if (ret) { 601 if (ret) {
602 kvfree(buf); 602 kvfree(buf);
603 return ret; 603 return ret;
604 } 604 }
605 ((struct seq_file *)file->private_data 605 ((struct seq_file *)file->private_data)->buf = buf;
606 ((struct seq_file *)file->private_data 606 ((struct seq_file *)file->private_data)->size = size;
607 return 0; 607 return 0;
608 } 608 }
609 EXPORT_SYMBOL(single_open_size); 609 EXPORT_SYMBOL(single_open_size);
610 610
611 int single_release(struct inode *inode, struct 611 int single_release(struct inode *inode, struct file *file)
612 { 612 {
613 const struct seq_operations *op = ((st 613 const struct seq_operations *op = ((struct seq_file *)file->private_data)->op;
614 int res = seq_release(inode, file); 614 int res = seq_release(inode, file);
615 kfree(op); 615 kfree(op);
616 return res; 616 return res;
617 } 617 }
618 EXPORT_SYMBOL(single_release); 618 EXPORT_SYMBOL(single_release);
619 619
620 int seq_release_private(struct inode *inode, s 620 int seq_release_private(struct inode *inode, struct file *file)
621 { 621 {
622 struct seq_file *seq = file->private_d 622 struct seq_file *seq = file->private_data;
623 623
624 kfree(seq->private); 624 kfree(seq->private);
625 seq->private = NULL; 625 seq->private = NULL;
626 return seq_release(inode, file); 626 return seq_release(inode, file);
627 } 627 }
628 EXPORT_SYMBOL(seq_release_private); 628 EXPORT_SYMBOL(seq_release_private);
629 629
630 void *__seq_open_private(struct file *f, const 630 void *__seq_open_private(struct file *f, const struct seq_operations *ops,
631 int psize) 631 int psize)
632 { 632 {
633 int rc; 633 int rc;
634 void *private; 634 void *private;
635 struct seq_file *seq; 635 struct seq_file *seq;
636 636
637 private = kzalloc(psize, GFP_KERNEL_AC 637 private = kzalloc(psize, GFP_KERNEL_ACCOUNT);
638 if (private == NULL) 638 if (private == NULL)
639 goto out; 639 goto out;
640 640
641 rc = seq_open(f, ops); 641 rc = seq_open(f, ops);
642 if (rc < 0) 642 if (rc < 0)
643 goto out_free; 643 goto out_free;
644 644
645 seq = f->private_data; 645 seq = f->private_data;
646 seq->private = private; 646 seq->private = private;
647 return private; 647 return private;
648 648
649 out_free: 649 out_free:
650 kfree(private); 650 kfree(private);
651 out: 651 out:
652 return NULL; 652 return NULL;
653 } 653 }
654 EXPORT_SYMBOL(__seq_open_private); 654 EXPORT_SYMBOL(__seq_open_private);
655 655
656 int seq_open_private(struct file *filp, const 656 int seq_open_private(struct file *filp, const struct seq_operations *ops,
657 int psize) 657 int psize)
658 { 658 {
659 return __seq_open_private(filp, ops, p 659 return __seq_open_private(filp, ops, psize) ? 0 : -ENOMEM;
660 } 660 }
661 EXPORT_SYMBOL(seq_open_private); 661 EXPORT_SYMBOL(seq_open_private);
662 662
663 void seq_putc(struct seq_file *m, char c) 663 void seq_putc(struct seq_file *m, char c)
664 { 664 {
665 if (m->count >= m->size) 665 if (m->count >= m->size)
666 return; 666 return;
667 667
668 m->buf[m->count++] = c; 668 m->buf[m->count++] = c;
669 } 669 }
670 EXPORT_SYMBOL(seq_putc); 670 EXPORT_SYMBOL(seq_putc);
671 671
672 void __seq_puts(struct seq_file *m, const char !! 672 void seq_puts(struct seq_file *m, const char *s)
673 { 673 {
674 seq_write(m, s, strlen(s)); !! 674 int len = strlen(s);
>> 675
>> 676 if (m->count + len >= m->size) {
>> 677 seq_set_overflow(m);
>> 678 return;
>> 679 }
>> 680 memcpy(m->buf + m->count, s, len);
>> 681 m->count += len;
675 } 682 }
676 EXPORT_SYMBOL(__seq_puts); !! 683 EXPORT_SYMBOL(seq_puts);
677 684
678 /** 685 /**
679 * seq_put_decimal_ull_width - A helper routin 686 * seq_put_decimal_ull_width - A helper routine for putting decimal numbers
680 * without rich fo 687 * without rich format of printf().
681 * only 'unsigned long long' is supported. 688 * only 'unsigned long long' is supported.
682 * @m: seq_file identifying the buffer to whic 689 * @m: seq_file identifying the buffer to which data should be written
683 * @delimiter: a string which is printed befor 690 * @delimiter: a string which is printed before the number
684 * @num: the number 691 * @num: the number
685 * @width: a minimum field width 692 * @width: a minimum field width
686 * 693 *
687 * This routine will put strlen(delimiter) + n 694 * This routine will put strlen(delimiter) + number into seq_filed.
688 * This routine is very quick when you show lo 695 * This routine is very quick when you show lots of numbers.
689 * In usual cases, it will be better to use se 696 * In usual cases, it will be better to use seq_printf(). It's easier to read.
690 */ 697 */
691 void seq_put_decimal_ull_width(struct seq_file 698 void seq_put_decimal_ull_width(struct seq_file *m, const char *delimiter,
692 unsigned long long nu 699 unsigned long long num, unsigned int width)
693 { 700 {
694 int len; 701 int len;
695 702
696 if (m->count + 2 >= m->size) /* we'll 703 if (m->count + 2 >= m->size) /* we'll write 2 bytes at least */
697 goto overflow; 704 goto overflow;
698 705
699 if (delimiter && delimiter[0]) { 706 if (delimiter && delimiter[0]) {
700 if (delimiter[1] == 0) 707 if (delimiter[1] == 0)
701 seq_putc(m, delimiter[ 708 seq_putc(m, delimiter[0]);
702 else 709 else
703 seq_puts(m, delimiter) 710 seq_puts(m, delimiter);
704 } 711 }
705 712
706 if (!width) 713 if (!width)
707 width = 1; 714 width = 1;
708 715
709 if (m->count + width >= m->size) 716 if (m->count + width >= m->size)
710 goto overflow; 717 goto overflow;
711 718
712 len = num_to_str(m->buf + m->count, m- 719 len = num_to_str(m->buf + m->count, m->size - m->count, num, width);
713 if (!len) 720 if (!len)
714 goto overflow; 721 goto overflow;
715 722
716 m->count += len; 723 m->count += len;
717 return; 724 return;
718 725
719 overflow: 726 overflow:
720 seq_set_overflow(m); 727 seq_set_overflow(m);
721 } 728 }
722 729
723 void seq_put_decimal_ull(struct seq_file *m, c 730 void seq_put_decimal_ull(struct seq_file *m, const char *delimiter,
724 unsigned long long nu 731 unsigned long long num)
725 { 732 {
726 return seq_put_decimal_ull_width(m, de 733 return seq_put_decimal_ull_width(m, delimiter, num, 0);
727 } 734 }
728 EXPORT_SYMBOL(seq_put_decimal_ull); 735 EXPORT_SYMBOL(seq_put_decimal_ull);
729 736
730 /** 737 /**
731 * seq_put_hex_ll - put a number in hexadecima 738 * seq_put_hex_ll - put a number in hexadecimal notation
732 * @m: seq_file identifying the buffer to whic 739 * @m: seq_file identifying the buffer to which data should be written
733 * @delimiter: a string which is printed befor 740 * @delimiter: a string which is printed before the number
734 * @v: the number 741 * @v: the number
735 * @width: a minimum field width 742 * @width: a minimum field width
736 * 743 *
737 * seq_put_hex_ll(m, "", v, 8) is equal to seq 744 * seq_put_hex_ll(m, "", v, 8) is equal to seq_printf(m, "%08llx", v)
738 * 745 *
739 * This routine is very quick when you show lo 746 * This routine is very quick when you show lots of numbers.
740 * In usual cases, it will be better to use se 747 * In usual cases, it will be better to use seq_printf(). It's easier to read.
741 */ 748 */
742 void seq_put_hex_ll(struct seq_file *m, const 749 void seq_put_hex_ll(struct seq_file *m, const char *delimiter,
743 unsigned long 750 unsigned long long v, unsigned int width)
744 { 751 {
745 unsigned int len; 752 unsigned int len;
746 int i; 753 int i;
747 754
748 if (delimiter && delimiter[0]) { 755 if (delimiter && delimiter[0]) {
749 if (delimiter[1] == 0) 756 if (delimiter[1] == 0)
750 seq_putc(m, delimiter[ 757 seq_putc(m, delimiter[0]);
751 else 758 else
752 seq_puts(m, delimiter) 759 seq_puts(m, delimiter);
753 } 760 }
754 761
755 /* If x is 0, the result of __builtin_ 762 /* If x is 0, the result of __builtin_clzll is undefined */
756 if (v == 0) 763 if (v == 0)
757 len = 1; 764 len = 1;
758 else 765 else
759 len = (sizeof(v) * 8 - __built 766 len = (sizeof(v) * 8 - __builtin_clzll(v) + 3) / 4;
760 767
761 if (len < width) 768 if (len < width)
762 len = width; 769 len = width;
763 770
764 if (m->count + len > m->size) { 771 if (m->count + len > m->size) {
765 seq_set_overflow(m); 772 seq_set_overflow(m);
766 return; 773 return;
767 } 774 }
768 775
769 for (i = len - 1; i >= 0; i--) { 776 for (i = len - 1; i >= 0; i--) {
770 m->buf[m->count + i] = hex_asc 777 m->buf[m->count + i] = hex_asc[0xf & v];
771 v = v >> 4; 778 v = v >> 4;
772 } 779 }
773 m->count += len; 780 m->count += len;
774 } 781 }
775 782
776 void seq_put_decimal_ll(struct seq_file *m, co 783 void seq_put_decimal_ll(struct seq_file *m, const char *delimiter, long long num)
777 { 784 {
778 int len; 785 int len;
779 786
780 if (m->count + 3 >= m->size) /* we'll 787 if (m->count + 3 >= m->size) /* we'll write 2 bytes at least */
781 goto overflow; 788 goto overflow;
782 789
783 if (delimiter && delimiter[0]) { 790 if (delimiter && delimiter[0]) {
784 if (delimiter[1] == 0) 791 if (delimiter[1] == 0)
785 seq_putc(m, delimiter[ 792 seq_putc(m, delimiter[0]);
786 else 793 else
787 seq_puts(m, delimiter) 794 seq_puts(m, delimiter);
788 } 795 }
789 796
790 if (m->count + 2 >= m->size) 797 if (m->count + 2 >= m->size)
791 goto overflow; 798 goto overflow;
792 799
793 if (num < 0) { 800 if (num < 0) {
794 m->buf[m->count++] = '-'; 801 m->buf[m->count++] = '-';
795 num = -num; 802 num = -num;
796 } 803 }
797 804
798 if (num < 10) { 805 if (num < 10) {
799 m->buf[m->count++] = num + ''; 806 m->buf[m->count++] = num + '';
800 return; 807 return;
801 } 808 }
802 809
803 len = num_to_str(m->buf + m->count, m- 810 len = num_to_str(m->buf + m->count, m->size - m->count, num, 0);
804 if (!len) 811 if (!len)
805 goto overflow; 812 goto overflow;
806 813
807 m->count += len; 814 m->count += len;
808 return; 815 return;
809 816
810 overflow: 817 overflow:
811 seq_set_overflow(m); 818 seq_set_overflow(m);
812 } 819 }
813 EXPORT_SYMBOL(seq_put_decimal_ll); 820 EXPORT_SYMBOL(seq_put_decimal_ll);
814 821
815 /** 822 /**
816 * seq_write - write arbitrary data to buffer 823 * seq_write - write arbitrary data to buffer
817 * @seq: seq_file identifying the buffer to wh 824 * @seq: seq_file identifying the buffer to which data should be written
818 * @data: data address 825 * @data: data address
819 * @len: number of bytes 826 * @len: number of bytes
820 * 827 *
821 * Return 0 on success, non-zero otherwise. 828 * Return 0 on success, non-zero otherwise.
822 */ 829 */
823 int seq_write(struct seq_file *seq, const void 830 int seq_write(struct seq_file *seq, const void *data, size_t len)
824 { 831 {
825 if (seq->count + len < seq->size) { 832 if (seq->count + len < seq->size) {
826 memcpy(seq->buf + seq->count, 833 memcpy(seq->buf + seq->count, data, len);
827 seq->count += len; 834 seq->count += len;
828 return 0; 835 return 0;
829 } 836 }
830 seq_set_overflow(seq); 837 seq_set_overflow(seq);
831 return -1; 838 return -1;
832 } 839 }
833 EXPORT_SYMBOL(seq_write); 840 EXPORT_SYMBOL(seq_write);
834 841
835 /** 842 /**
836 * seq_pad - write padding spaces to buffer 843 * seq_pad - write padding spaces to buffer
837 * @m: seq_file identifying the buffer to whic 844 * @m: seq_file identifying the buffer to which data should be written
838 * @c: the byte to append after padding if non 845 * @c: the byte to append after padding if non-zero
839 */ 846 */
840 void seq_pad(struct seq_file *m, char c) 847 void seq_pad(struct seq_file *m, char c)
841 { 848 {
842 int size = m->pad_until - m->count; 849 int size = m->pad_until - m->count;
843 if (size > 0) { 850 if (size > 0) {
844 if (size + m->count > m->size) 851 if (size + m->count > m->size) {
845 seq_set_overflow(m); 852 seq_set_overflow(m);
846 return; 853 return;
847 } 854 }
848 memset(m->buf + m->count, ' ', 855 memset(m->buf + m->count, ' ', size);
849 m->count += size; 856 m->count += size;
850 } 857 }
851 if (c) 858 if (c)
852 seq_putc(m, c); 859 seq_putc(m, c);
853 } 860 }
854 EXPORT_SYMBOL(seq_pad); 861 EXPORT_SYMBOL(seq_pad);
855 862
856 /* A complete analogue of print_hex_dump() */ 863 /* A complete analogue of print_hex_dump() */
857 void seq_hex_dump(struct seq_file *m, const ch 864 void seq_hex_dump(struct seq_file *m, const char *prefix_str, int prefix_type,
858 int rowsize, int groupsize, 865 int rowsize, int groupsize, const void *buf, size_t len,
859 bool ascii) 866 bool ascii)
860 { 867 {
861 const u8 *ptr = buf; 868 const u8 *ptr = buf;
862 int i, linelen, remaining = len; 869 int i, linelen, remaining = len;
863 char *buffer; 870 char *buffer;
864 size_t size; 871 size_t size;
865 int ret; 872 int ret;
866 873
867 if (rowsize != 16 && rowsize != 32) 874 if (rowsize != 16 && rowsize != 32)
868 rowsize = 16; 875 rowsize = 16;
869 876
870 for (i = 0; i < len && !seq_has_overfl 877 for (i = 0; i < len && !seq_has_overflowed(m); i += rowsize) {
871 linelen = min(remaining, rowsi 878 linelen = min(remaining, rowsize);
872 remaining -= rowsize; 879 remaining -= rowsize;
873 880
874 switch (prefix_type) { 881 switch (prefix_type) {
875 case DUMP_PREFIX_ADDRESS: 882 case DUMP_PREFIX_ADDRESS:
876 seq_printf(m, "%s%p: " 883 seq_printf(m, "%s%p: ", prefix_str, ptr + i);
877 break; 884 break;
878 case DUMP_PREFIX_OFFSET: 885 case DUMP_PREFIX_OFFSET:
879 seq_printf(m, "%s%.8x: 886 seq_printf(m, "%s%.8x: ", prefix_str, i);
880 break; 887 break;
881 default: 888 default:
882 seq_printf(m, "%s", pr 889 seq_printf(m, "%s", prefix_str);
883 break; 890 break;
884 } 891 }
885 892
886 size = seq_get_buf(m, &buffer) 893 size = seq_get_buf(m, &buffer);
887 ret = hex_dump_to_buffer(ptr + 894 ret = hex_dump_to_buffer(ptr + i, linelen, rowsize, groupsize,
888 buffe 895 buffer, size, ascii);
889 seq_commit(m, ret < size ? ret 896 seq_commit(m, ret < size ? ret : -1);
890 897
891 seq_putc(m, '\n'); 898 seq_putc(m, '\n');
892 } 899 }
893 } 900 }
894 EXPORT_SYMBOL(seq_hex_dump); 901 EXPORT_SYMBOL(seq_hex_dump);
895 902
896 struct list_head *seq_list_start(struct list_h 903 struct list_head *seq_list_start(struct list_head *head, loff_t pos)
897 { 904 {
898 struct list_head *lh; 905 struct list_head *lh;
899 906
900 list_for_each(lh, head) 907 list_for_each(lh, head)
901 if (pos-- == 0) 908 if (pos-- == 0)
902 return lh; 909 return lh;
903 910
904 return NULL; 911 return NULL;
905 } 912 }
906 EXPORT_SYMBOL(seq_list_start); 913 EXPORT_SYMBOL(seq_list_start);
907 914
908 struct list_head *seq_list_start_head(struct l 915 struct list_head *seq_list_start_head(struct list_head *head, loff_t pos)
909 { 916 {
910 if (!pos) 917 if (!pos)
911 return head; 918 return head;
912 919
913 return seq_list_start(head, pos - 1); 920 return seq_list_start(head, pos - 1);
914 } 921 }
915 EXPORT_SYMBOL(seq_list_start_head); 922 EXPORT_SYMBOL(seq_list_start_head);
916 923
917 struct list_head *seq_list_next(void *v, struc 924 struct list_head *seq_list_next(void *v, struct list_head *head, loff_t *ppos)
918 { 925 {
919 struct list_head *lh; 926 struct list_head *lh;
920 927
921 lh = ((struct list_head *)v)->next; 928 lh = ((struct list_head *)v)->next;
922 ++*ppos; 929 ++*ppos;
923 return lh == head ? NULL : lh; 930 return lh == head ? NULL : lh;
924 } 931 }
925 EXPORT_SYMBOL(seq_list_next); 932 EXPORT_SYMBOL(seq_list_next);
926 933
927 struct list_head *seq_list_start_rcu(struct li 934 struct list_head *seq_list_start_rcu(struct list_head *head, loff_t pos)
928 { 935 {
929 struct list_head *lh; 936 struct list_head *lh;
930 937
931 list_for_each_rcu(lh, head) 938 list_for_each_rcu(lh, head)
932 if (pos-- == 0) 939 if (pos-- == 0)
933 return lh; 940 return lh;
934 941
935 return NULL; 942 return NULL;
936 } 943 }
937 EXPORT_SYMBOL(seq_list_start_rcu); 944 EXPORT_SYMBOL(seq_list_start_rcu);
938 945
939 struct list_head *seq_list_start_head_rcu(stru 946 struct list_head *seq_list_start_head_rcu(struct list_head *head, loff_t pos)
940 { 947 {
941 if (!pos) 948 if (!pos)
942 return head; 949 return head;
943 950
944 return seq_list_start_rcu(head, pos - 951 return seq_list_start_rcu(head, pos - 1);
945 } 952 }
946 EXPORT_SYMBOL(seq_list_start_head_rcu); 953 EXPORT_SYMBOL(seq_list_start_head_rcu);
947 954
948 struct list_head *seq_list_next_rcu(void *v, s 955 struct list_head *seq_list_next_rcu(void *v, struct list_head *head,
949 loff_t *pp 956 loff_t *ppos)
950 { 957 {
951 struct list_head *lh; 958 struct list_head *lh;
952 959
953 lh = list_next_rcu((struct list_head * 960 lh = list_next_rcu((struct list_head *)v);
954 ++*ppos; 961 ++*ppos;
955 return lh == head ? NULL : lh; 962 return lh == head ? NULL : lh;
956 } 963 }
957 EXPORT_SYMBOL(seq_list_next_rcu); 964 EXPORT_SYMBOL(seq_list_next_rcu);
958 965
959 /** 966 /**
960 * seq_hlist_start - start an iteration of a h 967 * seq_hlist_start - start an iteration of a hlist
961 * @head: the head of the hlist 968 * @head: the head of the hlist
962 * @pos: the start position of the sequence 969 * @pos: the start position of the sequence
963 * 970 *
964 * Called at seq_file->op->start(). 971 * Called at seq_file->op->start().
965 */ 972 */
966 struct hlist_node *seq_hlist_start(struct hlis 973 struct hlist_node *seq_hlist_start(struct hlist_head *head, loff_t pos)
967 { 974 {
968 struct hlist_node *node; 975 struct hlist_node *node;
969 976
970 hlist_for_each(node, head) 977 hlist_for_each(node, head)
971 if (pos-- == 0) 978 if (pos-- == 0)
972 return node; 979 return node;
973 return NULL; 980 return NULL;
974 } 981 }
975 EXPORT_SYMBOL(seq_hlist_start); 982 EXPORT_SYMBOL(seq_hlist_start);
976 983
977 /** 984 /**
978 * seq_hlist_start_head - start an iteration o 985 * seq_hlist_start_head - start an iteration of a hlist
979 * @head: the head of the hlist 986 * @head: the head of the hlist
980 * @pos: the start position of the sequence 987 * @pos: the start position of the sequence
981 * 988 *
982 * Called at seq_file->op->start(). Call this 989 * Called at seq_file->op->start(). Call this function if you want to
983 * print a header at the top of the output. 990 * print a header at the top of the output.
984 */ 991 */
985 struct hlist_node *seq_hlist_start_head(struct 992 struct hlist_node *seq_hlist_start_head(struct hlist_head *head, loff_t pos)
986 { 993 {
987 if (!pos) 994 if (!pos)
988 return SEQ_START_TOKEN; 995 return SEQ_START_TOKEN;
989 996
990 return seq_hlist_start(head, pos - 1); 997 return seq_hlist_start(head, pos - 1);
991 } 998 }
992 EXPORT_SYMBOL(seq_hlist_start_head); 999 EXPORT_SYMBOL(seq_hlist_start_head);
993 1000
994 /** 1001 /**
995 * seq_hlist_next - move to the next position 1002 * seq_hlist_next - move to the next position of the hlist
996 * @v: the current iterator 1003 * @v: the current iterator
997 * @head: the head of the hlist 1004 * @head: the head of the hlist
998 * @ppos: the current position 1005 * @ppos: the current position
999 * 1006 *
1000 * Called at seq_file->op->next(). 1007 * Called at seq_file->op->next().
1001 */ 1008 */
1002 struct hlist_node *seq_hlist_next(void *v, st 1009 struct hlist_node *seq_hlist_next(void *v, struct hlist_head *head,
1003 loff_t *ppo 1010 loff_t *ppos)
1004 { 1011 {
1005 struct hlist_node *node = v; 1012 struct hlist_node *node = v;
1006 1013
1007 ++*ppos; 1014 ++*ppos;
1008 if (v == SEQ_START_TOKEN) 1015 if (v == SEQ_START_TOKEN)
1009 return head->first; 1016 return head->first;
1010 else 1017 else
1011 return node->next; 1018 return node->next;
1012 } 1019 }
1013 EXPORT_SYMBOL(seq_hlist_next); 1020 EXPORT_SYMBOL(seq_hlist_next);
1014 1021
1015 /** 1022 /**
1016 * seq_hlist_start_rcu - start an iteration o 1023 * seq_hlist_start_rcu - start an iteration of a hlist protected by RCU
1017 * @head: the head of the hlist 1024 * @head: the head of the hlist
1018 * @pos: the start position of the sequence 1025 * @pos: the start position of the sequence
1019 * 1026 *
1020 * Called at seq_file->op->start(). 1027 * Called at seq_file->op->start().
1021 * 1028 *
1022 * This list-traversal primitive may safely r 1029 * This list-traversal primitive may safely run concurrently with
1023 * the _rcu list-mutation primitives such as 1030 * the _rcu list-mutation primitives such as hlist_add_head_rcu()
1024 * as long as the traversal is guarded by rcu 1031 * as long as the traversal is guarded by rcu_read_lock().
1025 */ 1032 */
1026 struct hlist_node *seq_hlist_start_rcu(struct 1033 struct hlist_node *seq_hlist_start_rcu(struct hlist_head *head,
1027 loff_t 1034 loff_t pos)
1028 { 1035 {
1029 struct hlist_node *node; 1036 struct hlist_node *node;
1030 1037
1031 __hlist_for_each_rcu(node, head) 1038 __hlist_for_each_rcu(node, head)
1032 if (pos-- == 0) 1039 if (pos-- == 0)
1033 return node; 1040 return node;
1034 return NULL; 1041 return NULL;
1035 } 1042 }
1036 EXPORT_SYMBOL(seq_hlist_start_rcu); 1043 EXPORT_SYMBOL(seq_hlist_start_rcu);
1037 1044
1038 /** 1045 /**
1039 * seq_hlist_start_head_rcu - start an iterat 1046 * seq_hlist_start_head_rcu - start an iteration of a hlist protected by RCU
1040 * @head: the head of the hlist 1047 * @head: the head of the hlist
1041 * @pos: the start position of the sequence 1048 * @pos: the start position of the sequence
1042 * 1049 *
1043 * Called at seq_file->op->start(). Call this 1050 * Called at seq_file->op->start(). Call this function if you want to
1044 * print a header at the top of the output. 1051 * print a header at the top of the output.
1045 * 1052 *
1046 * This list-traversal primitive may safely r 1053 * This list-traversal primitive may safely run concurrently with
1047 * the _rcu list-mutation primitives such as 1054 * the _rcu list-mutation primitives such as hlist_add_head_rcu()
1048 * as long as the traversal is guarded by rcu 1055 * as long as the traversal is guarded by rcu_read_lock().
1049 */ 1056 */
1050 struct hlist_node *seq_hlist_start_head_rcu(s 1057 struct hlist_node *seq_hlist_start_head_rcu(struct hlist_head *head,
1051 l 1058 loff_t pos)
1052 { 1059 {
1053 if (!pos) 1060 if (!pos)
1054 return SEQ_START_TOKEN; 1061 return SEQ_START_TOKEN;
1055 1062
1056 return seq_hlist_start_rcu(head, pos 1063 return seq_hlist_start_rcu(head, pos - 1);
1057 } 1064 }
1058 EXPORT_SYMBOL(seq_hlist_start_head_rcu); 1065 EXPORT_SYMBOL(seq_hlist_start_head_rcu);
1059 1066
1060 /** 1067 /**
1061 * seq_hlist_next_rcu - move to the next posi 1068 * seq_hlist_next_rcu - move to the next position of the hlist protected by RCU
1062 * @v: the current iterator 1069 * @v: the current iterator
1063 * @head: the head of the hlist 1070 * @head: the head of the hlist
1064 * @ppos: the current position 1071 * @ppos: the current position
1065 * 1072 *
1066 * Called at seq_file->op->next(). 1073 * Called at seq_file->op->next().
1067 * 1074 *
1068 * This list-traversal primitive may safely r 1075 * This list-traversal primitive may safely run concurrently with
1069 * the _rcu list-mutation primitives such as 1076 * the _rcu list-mutation primitives such as hlist_add_head_rcu()
1070 * as long as the traversal is guarded by rcu 1077 * as long as the traversal is guarded by rcu_read_lock().
1071 */ 1078 */
1072 struct hlist_node *seq_hlist_next_rcu(void *v 1079 struct hlist_node *seq_hlist_next_rcu(void *v,
1073 struct 1080 struct hlist_head *head,
1074 loff_t 1081 loff_t *ppos)
1075 { 1082 {
1076 struct hlist_node *node = v; 1083 struct hlist_node *node = v;
1077 1084
1078 ++*ppos; 1085 ++*ppos;
1079 if (v == SEQ_START_TOKEN) 1086 if (v == SEQ_START_TOKEN)
1080 return rcu_dereference(head-> 1087 return rcu_dereference(head->first);
1081 else 1088 else
1082 return rcu_dereference(node-> 1089 return rcu_dereference(node->next);
1083 } 1090 }
1084 EXPORT_SYMBOL(seq_hlist_next_rcu); 1091 EXPORT_SYMBOL(seq_hlist_next_rcu);
1085 1092
1086 /** 1093 /**
1087 * seq_hlist_start_percpu - start an iteratio 1094 * seq_hlist_start_percpu - start an iteration of a percpu hlist array
1088 * @head: pointer to percpu array of struct h 1095 * @head: pointer to percpu array of struct hlist_heads
1089 * @cpu: pointer to cpu "cursor" 1096 * @cpu: pointer to cpu "cursor"
1090 * @pos: start position of sequence 1097 * @pos: start position of sequence
1091 * 1098 *
1092 * Called at seq_file->op->start(). 1099 * Called at seq_file->op->start().
1093 */ 1100 */
1094 struct hlist_node * 1101 struct hlist_node *
1095 seq_hlist_start_percpu(struct hlist_head __pe 1102 seq_hlist_start_percpu(struct hlist_head __percpu *head, int *cpu, loff_t pos)
1096 { 1103 {
1097 struct hlist_node *node; 1104 struct hlist_node *node;
1098 1105
1099 for_each_possible_cpu(*cpu) { 1106 for_each_possible_cpu(*cpu) {
1100 hlist_for_each(node, per_cpu_ 1107 hlist_for_each(node, per_cpu_ptr(head, *cpu)) {
1101 if (pos-- == 0) 1108 if (pos-- == 0)
1102 return node; 1109 return node;
1103 } 1110 }
1104 } 1111 }
1105 return NULL; 1112 return NULL;
1106 } 1113 }
1107 EXPORT_SYMBOL(seq_hlist_start_percpu); 1114 EXPORT_SYMBOL(seq_hlist_start_percpu);
1108 1115
1109 /** 1116 /**
1110 * seq_hlist_next_percpu - move to the next p 1117 * seq_hlist_next_percpu - move to the next position of the percpu hlist array
1111 * @v: pointer to current hlist_node 1118 * @v: pointer to current hlist_node
1112 * @head: pointer to percpu array of struct h 1119 * @head: pointer to percpu array of struct hlist_heads
1113 * @cpu: pointer to cpu "cursor" 1120 * @cpu: pointer to cpu "cursor"
1114 * @pos: start position of sequence 1121 * @pos: start position of sequence
1115 * 1122 *
1116 * Called at seq_file->op->next(). 1123 * Called at seq_file->op->next().
1117 */ 1124 */
1118 struct hlist_node * 1125 struct hlist_node *
1119 seq_hlist_next_percpu(void *v, struct hlist_h 1126 seq_hlist_next_percpu(void *v, struct hlist_head __percpu *head,
1120 int *cpu, loff_t *pos 1127 int *cpu, loff_t *pos)
1121 { 1128 {
1122 struct hlist_node *node = v; 1129 struct hlist_node *node = v;
1123 1130
1124 ++*pos; 1131 ++*pos;
1125 1132
1126 if (node->next) 1133 if (node->next)
1127 return node->next; 1134 return node->next;
1128 1135
1129 for (*cpu = cpumask_next(*cpu, cpu_po 1136 for (*cpu = cpumask_next(*cpu, cpu_possible_mask); *cpu < nr_cpu_ids;
1130 *cpu = cpumask_next(*cpu, cpu_po 1137 *cpu = cpumask_next(*cpu, cpu_possible_mask)) {
1131 struct hlist_head *bucket = p 1138 struct hlist_head *bucket = per_cpu_ptr(head, *cpu);
1132 1139
1133 if (!hlist_empty(bucket)) 1140 if (!hlist_empty(bucket))
1134 return bucket->first; 1141 return bucket->first;
1135 } 1142 }
1136 return NULL; 1143 return NULL;
1137 } 1144 }
1138 EXPORT_SYMBOL(seq_hlist_next_percpu); 1145 EXPORT_SYMBOL(seq_hlist_next_percpu);
1139 1146
1140 void __init seq_file_init(void) 1147 void __init seq_file_init(void)
1141 { 1148 {
1142 seq_file_cache = KMEM_CACHE(seq_file, 1149 seq_file_cache = KMEM_CACHE(seq_file, SLAB_ACCOUNT|SLAB_PANIC);
1143 } 1150 }
1144 1151
Linux® is a registered trademark of Linus Torvalds in the United States and other countries.
TOMOYO® is a registered trademark of NTT DATA CORPORATION.