Blame view
kernel/kfifo.c
12.7 KB
1da177e4c
|
1 |
/* |
2e956fb32
|
2 |
* A generic kernel FIFO implementation |
1da177e4c
|
3 |
* |
2e956fb32
|
4 |
* Copyright (C) 2009/2010 Stefani Seibold <stefani@seibold.net> |
1da177e4c
|
5 6 7 8 9 10 11 12 |
* * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of |
d78a3eda6
|
13 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
1da177e4c
|
14 15 16 17 18 19 20 21 22 23 24 25 |
* GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. * */ #include <linux/kernel.h> #include <linux/module.h> #include <linux/slab.h> #include <linux/err.h> |
f84d5a76c
|
26 |
#include <linux/log2.h> |
a121f24ac
|
27 |
#include <linux/uaccess.h> |
2e956fb32
|
28 |
#include <linux/kfifo.h> |
1da177e4c
|
29 |
|
2e956fb32
|
30 31 |
/* * internal helper to calculate the unused elements in a fifo |
1da177e4c
|
32 |
*/ |
2e956fb32
|
33 |
static inline unsigned int kfifo_unused(struct __kfifo *fifo) |
1da177e4c
|
34 |
{ |
2e956fb32
|
35 |
return (fifo->mask + 1) - (fifo->in - fifo->out); |
1da177e4c
|
36 |
} |
1da177e4c
|
37 |
|
2e956fb32
|
38 39 |
int __kfifo_alloc(struct __kfifo *fifo, unsigned int size, size_t esize, gfp_t gfp_mask) |
1da177e4c
|
40 |
{ |
1da177e4c
|
41 |
/* |
2e956fb32
|
42 |
* round down to the next power of 2, since our 'let the indices |
b33112d1c
|
43 |
* wrap' technique works only in this case. |
1da177e4c
|
44 |
*/ |
2e956fb32
|
45 46 47 48 49 50 51 52 53 54 55 |
if (!is_power_of_2(size)) size = rounddown_pow_of_two(size); fifo->in = 0; fifo->out = 0; fifo->esize = esize; if (size < 2) { fifo->data = NULL; fifo->mask = 0; return -EINVAL; |
1da177e4c
|
56 |
} |
2e956fb32
|
57 58 59 60 |
fifo->data = kmalloc(size * esize, gfp_mask); if (!fifo->data) { fifo->mask = 0; |
454654878
|
61 62 |
return -ENOMEM; } |
2e956fb32
|
63 |
fifo->mask = size - 1; |
1da177e4c
|
64 |
|
454654878
|
65 |
return 0; |
1da177e4c
|
66 |
} |
2e956fb32
|
67 |
EXPORT_SYMBOL(__kfifo_alloc); |
1da177e4c
|
68 |
|
2e956fb32
|
69 |
void __kfifo_free(struct __kfifo *fifo) |
1da177e4c
|
70 |
{ |
2e956fb32
|
71 72 73 74 75 76 |
kfree(fifo->data); fifo->in = 0; fifo->out = 0; fifo->esize = 0; fifo->data = NULL; fifo->mask = 0; |
1da177e4c
|
77 |
} |
2e956fb32
|
78 |
EXPORT_SYMBOL(__kfifo_free); |
1da177e4c
|
79 |
|
2e956fb32
|
80 81 |
int __kfifo_init(struct __kfifo *fifo, void *buffer, unsigned int size, size_t esize) |
a121f24ac
|
82 |
{ |
2e956fb32
|
83 84 85 86 87 88 89 90 91 92 93 94 95 |
size /= esize; if (!is_power_of_2(size)) size = rounddown_pow_of_two(size); fifo->in = 0; fifo->out = 0; fifo->esize = esize; fifo->data = buffer; if (size < 2) { fifo->mask = 0; return -EINVAL; |
a121f24ac
|
96 |
} |
2e956fb32
|
97 98 99 |
fifo->mask = size - 1; return 0; |
a121f24ac
|
100 |
} |
2e956fb32
|
101 |
EXPORT_SYMBOL(__kfifo_init); |
a121f24ac
|
102 |
|
2e956fb32
|
103 104 |
static void kfifo_copy_in(struct __kfifo *fifo, const void *src, unsigned int len, unsigned int off) |
1da177e4c
|
105 |
{ |
2e956fb32
|
106 107 |
unsigned int size = fifo->mask + 1; unsigned int esize = fifo->esize; |
1da177e4c
|
108 |
unsigned int l; |
2e956fb32
|
109 110 111 112 113 114 115 116 117 118 |
off &= fifo->mask; if (esize != 1) { off *= esize; size *= esize; len *= esize; } l = min(len, size - off); memcpy(fifo->data + off, src, l); memcpy(fifo->data, src + l, len - l); |
a45bce495
|
119 |
/* |
2e956fb32
|
120 121 |
* make sure that the data in the fifo is up to date before * incrementing the fifo->in index counter |
a45bce495
|
122 |
*/ |
2e956fb32
|
123 124 |
smp_wmb(); } |
a45bce495
|
125 |
|
2e956fb32
|
126 127 128 129 |
unsigned int __kfifo_in(struct __kfifo *fifo, const void *buf, unsigned int len) { unsigned int l; |
a121f24ac
|
130 |
|
2e956fb32
|
131 132 133 |
l = kfifo_unused(fifo); if (len > l) len = l; |
1da177e4c
|
134 |
|
2e956fb32
|
135 136 137 |
kfifo_copy_in(fifo, buf, len, fifo->in); fifo->in += len; return len; |
1da177e4c
|
138 |
} |
2e956fb32
|
139 |
EXPORT_SYMBOL(__kfifo_in); |
1da177e4c
|
140 |
|
2e956fb32
|
141 142 |
static void kfifo_copy_out(struct __kfifo *fifo, void *dst, unsigned int len, unsigned int off) |
1da177e4c
|
143 |
{ |
2e956fb32
|
144 145 |
unsigned int size = fifo->mask + 1; unsigned int esize = fifo->esize; |
1da177e4c
|
146 |
unsigned int l; |
2e956fb32
|
147 148 149 150 151 152 153 154 155 156 |
off &= fifo->mask; if (esize != 1) { off *= esize; size *= esize; len *= esize; } l = min(len, size - off); memcpy(dst, fifo->data + off, l); memcpy(dst + l, fifo->data, len - l); |
a45bce495
|
157 |
/* |
2e956fb32
|
158 159 |
* make sure that the data is copied before * incrementing the fifo->out index counter |
a45bce495
|
160 |
*/ |
2e956fb32
|
161 162 |
smp_wmb(); } |
a45bce495
|
163 |
|
2e956fb32
|
164 165 166 167 |
unsigned int __kfifo_out_peek(struct __kfifo *fifo, void *buf, unsigned int len) { unsigned int l; |
a45bce495
|
168 |
|
2e956fb32
|
169 170 171 |
l = fifo->in - fifo->out; if (len > l) len = l; |
a121f24ac
|
172 |
|
2e956fb32
|
173 174 175 176 |
kfifo_copy_out(fifo, buf, len, fifo->out); return len; } EXPORT_SYMBOL(__kfifo_out_peek); |
1da177e4c
|
177 |
|
2e956fb32
|
178 179 180 181 182 183 |
unsigned int __kfifo_out(struct __kfifo *fifo, void *buf, unsigned int len) { len = __kfifo_out_peek(fifo, buf, len); fifo->out += len; return len; |
a121f24ac
|
184 |
} |
2e956fb32
|
185 |
EXPORT_SYMBOL(__kfifo_out); |
a121f24ac
|
186 |
|
2e956fb32
|
187 188 189 |
static unsigned long kfifo_copy_from_user(struct __kfifo *fifo, const void __user *from, unsigned int len, unsigned int off, unsigned int *copied) |
a121f24ac
|
190 |
{ |
2e956fb32
|
191 192 |
unsigned int size = fifo->mask + 1; unsigned int esize = fifo->esize; |
a121f24ac
|
193 |
unsigned int l; |
2e956fb32
|
194 |
unsigned long ret; |
a121f24ac
|
195 |
|
2e956fb32
|
196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 |
off &= fifo->mask; if (esize != 1) { off *= esize; size *= esize; len *= esize; } l = min(len, size - off); ret = copy_from_user(fifo->data + off, from, l); if (unlikely(ret)) ret = DIV_ROUND_UP(ret + len - l, esize); else { ret = copy_from_user(fifo->data, from + l, len - l); if (unlikely(ret)) ret = DIV_ROUND_UP(ret, esize); } |
a45bce495
|
212 |
/* |
2e956fb32
|
213 214 |
* make sure that the data in the fifo is up to date before * incrementing the fifo->in index counter |
a45bce495
|
215 |
*/ |
2e956fb32
|
216 217 218 219 220 |
smp_wmb(); *copied = len - ret; /* return the number of elements which are not copied */ return ret; } |
a45bce495
|
221 |
|
2e956fb32
|
222 223 224 225 226 227 228 |
int __kfifo_from_user(struct __kfifo *fifo, const void __user *from, unsigned long len, unsigned int *copied) { unsigned int l; unsigned long ret; unsigned int esize = fifo->esize; int err; |
a45bce495
|
229 |
|
2e956fb32
|
230 231 |
if (esize != 1) len /= esize; |
a121f24ac
|
232 |
|
2e956fb32
|
233 234 235 |
l = kfifo_unused(fifo); if (len > l) len = l; |
a121f24ac
|
236 |
|
2e956fb32
|
237 238 239 240 241 242 243 244 |
ret = kfifo_copy_from_user(fifo, from, len, fifo->in, copied); if (unlikely(ret)) { len -= ret; err = -EFAULT; } else err = 0; fifo->in += len; return err; |
86d488031
|
245 |
} |
2e956fb32
|
246 |
EXPORT_SYMBOL(__kfifo_from_user); |
86d488031
|
247 |
|
2e956fb32
|
248 249 |
static unsigned long kfifo_copy_to_user(struct __kfifo *fifo, void __user *to, unsigned int len, unsigned int off, unsigned int *copied) |
86d488031
|
250 251 |
{ unsigned int l; |
2e956fb32
|
252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 |
unsigned long ret; unsigned int size = fifo->mask + 1; unsigned int esize = fifo->esize; off &= fifo->mask; if (esize != 1) { off *= esize; size *= esize; len *= esize; } l = min(len, size - off); ret = copy_to_user(to, fifo->data + off, l); if (unlikely(ret)) ret = DIV_ROUND_UP(ret + len - l, esize); else { ret = copy_to_user(to + l, fifo->data, len - l); if (unlikely(ret)) ret = DIV_ROUND_UP(ret, esize); } |
86d488031
|
272 |
/* |
2e956fb32
|
273 274 |
* make sure that the data is copied before * incrementing the fifo->out index counter |
86d488031
|
275 |
*/ |
2e956fb32
|
276 277 278 279 280 |
smp_wmb(); *copied = len - ret; /* return the number of elements which are not copied */ return ret; } |
86d488031
|
281 |
|
2e956fb32
|
282 283 284 285 286 287 288 |
int __kfifo_to_user(struct __kfifo *fifo, void __user *to, unsigned long len, unsigned int *copied) { unsigned int l; unsigned long ret; unsigned int esize = fifo->esize; int err; |
86d488031
|
289 |
|
2e956fb32
|
290 291 |
if (esize != 1) len /= esize; |
86d488031
|
292 |
|
2e956fb32
|
293 294 295 296 |
l = fifo->in - fifo->out; if (len > l) len = l; ret = kfifo_copy_to_user(fifo, to, len, fifo->out, copied); |
64ce1037c
|
297 |
if (unlikely(ret)) { |
2e956fb32
|
298 299 300 301 302 303 304 305 |
len -= ret; err = -EFAULT; } else err = 0; fifo->out += len; return err; } EXPORT_SYMBOL(__kfifo_to_user); |
a121f24ac
|
306 |
|
2e956fb32
|
307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 |
static int setup_sgl_buf(struct scatterlist *sgl, void *buf, int nents, unsigned int len) { int n; unsigned int l; unsigned int off; struct page *page; if (!nents) return 0; if (!len) return 0; n = 0; page = virt_to_page(buf); off = offset_in_page(buf); l = 0; while (len >= l + PAGE_SIZE - off) { struct page *npage; l += PAGE_SIZE; buf += PAGE_SIZE; npage = virt_to_page(buf); if (page_to_phys(page) != page_to_phys(npage) - l) { |
d78a3eda6
|
333 334 335 |
sg_set_page(sgl, page, l - off, off); sgl = sg_next(sgl); if (++n == nents || sgl == NULL) |
2e956fb32
|
336 337 338 339 340 |
return n; page = npage; len -= l - off; l = off = 0; } |
64ce1037c
|
341 |
} |
d78a3eda6
|
342 |
sg_set_page(sgl, page, len, off); |
2e956fb32
|
343 |
return n + 1; |
86d488031
|
344 |
} |
1da177e4c
|
345 |
|
2e956fb32
|
346 347 |
static unsigned int setup_sgl(struct __kfifo *fifo, struct scatterlist *sgl, int nents, unsigned int len, unsigned int off) |
86d488031
|
348 |
{ |
2e956fb32
|
349 350 351 352 |
unsigned int size = fifo->mask + 1; unsigned int esize = fifo->esize; unsigned int l; unsigned int n; |
86d488031
|
353 |
|
2e956fb32
|
354 355 356 357 358 359 360 |
off &= fifo->mask; if (esize != 1) { off *= esize; size *= esize; len *= esize; } l = min(len, size - off); |
d78a3eda6
|
361 |
n = setup_sgl_buf(sgl, fifo->data + off, nents, l); |
2e956fb32
|
362 |
n += setup_sgl_buf(sgl + n, fifo->data, nents - n, len - l); |
2e956fb32
|
363 |
return n; |
86d488031
|
364 |
} |
86d488031
|
365 |
|
2e956fb32
|
366 367 |
unsigned int __kfifo_dma_in_prepare(struct __kfifo *fifo, struct scatterlist *sgl, int nents, unsigned int len) |
86d488031
|
368 |
{ |
2e956fb32
|
369 |
unsigned int l; |
86d488031
|
370 |
|
2e956fb32
|
371 372 373 374 375 |
l = kfifo_unused(fifo); if (len > l) len = l; return setup_sgl(fifo, sgl, nents, len, fifo->in); |
1da177e4c
|
376 |
} |
2e956fb32
|
377 |
EXPORT_SYMBOL(__kfifo_dma_in_prepare); |
86d488031
|
378 |
|
2e956fb32
|
379 380 |
unsigned int __kfifo_dma_out_prepare(struct __kfifo *fifo, struct scatterlist *sgl, int nents, unsigned int len) |
86d488031
|
381 |
{ |
2e956fb32
|
382 383 384 385 386 387 388 |
unsigned int l; l = fifo->in - fifo->out; if (len > l) len = l; return setup_sgl(fifo, sgl, nents, len, fifo->out); |
86d488031
|
389 |
} |
2e956fb32
|
390 |
EXPORT_SYMBOL(__kfifo_dma_out_prepare); |
86d488031
|
391 |
|
2e956fb32
|
392 |
unsigned int __kfifo_max_r(unsigned int len, size_t recsize) |
86d488031
|
393 |
{ |
2e956fb32
|
394 |
unsigned int max = (1 << (recsize << 3)) - 1; |
86d488031
|
395 |
|
2e956fb32
|
396 397 398 |
if (len > max) return max; return len; |
86d488031
|
399 |
} |
a121f24ac
|
400 |
|
2e956fb32
|
401 402 403 404 405 |
#define __KFIFO_PEEK(data, out, mask) \ ((data)[(out) & (mask)]) /* * __kfifo_peek_n internal helper function for determinate the length of * the next record in the fifo |
a121f24ac
|
406 |
*/ |
2e956fb32
|
407 |
static unsigned int __kfifo_peek_n(struct __kfifo *fifo, size_t recsize) |
a121f24ac
|
408 |
{ |
2e956fb32
|
409 410 411 |
unsigned int l; unsigned int mask = fifo->mask; unsigned char *data = fifo->data; |
a121f24ac
|
412 |
|
2e956fb32
|
413 |
l = __KFIFO_PEEK(data, fifo->out, mask); |
a121f24ac
|
414 |
|
2e956fb32
|
415 416 417 418 |
if (--recsize) l |= __KFIFO_PEEK(data, fifo->out + 1, mask) << 8; return l; |
86d488031
|
419 |
} |
2e956fb32
|
420 421 422 423 424 425 426 427 428 |
#define __KFIFO_POKE(data, in, mask, val) \ ( \ (data)[(in) & (mask)] = (unsigned char)(val) \ ) /* * __kfifo_poke_n internal helper function for storeing the length of * the record into the fifo |
a5b9e2c10
|
429 |
*/ |
2e956fb32
|
430 |
static void __kfifo_poke_n(struct __kfifo *fifo, unsigned int n, size_t recsize) |
a5b9e2c10
|
431 |
{ |
2e956fb32
|
432 433 |
unsigned int mask = fifo->mask; unsigned char *data = fifo->data; |
a5b9e2c10
|
434 |
|
2e956fb32
|
435 436 437 438 |
__KFIFO_POKE(data, fifo->in, mask, n); if (recsize > 1) __KFIFO_POKE(data, fifo->in + 1, mask, n >> 8); |
a5b9e2c10
|
439 |
} |
a5b9e2c10
|
440 |
|
2e956fb32
|
441 |
unsigned int __kfifo_len_r(struct __kfifo *fifo, size_t recsize) |
86d488031
|
442 |
{ |
2e956fb32
|
443 |
return __kfifo_peek_n(fifo, recsize); |
86d488031
|
444 |
} |
2e956fb32
|
445 |
EXPORT_SYMBOL(__kfifo_len_r); |
a121f24ac
|
446 |
|
2e956fb32
|
447 448 |
unsigned int __kfifo_in_r(struct __kfifo *fifo, const void *buf, unsigned int len, size_t recsize) |
86d488031
|
449 |
{ |
2e956fb32
|
450 451 |
if (len + recsize > kfifo_unused(fifo)) return 0; |
64ce1037c
|
452 |
|
2e956fb32
|
453 |
__kfifo_poke_n(fifo, len, recsize); |
a121f24ac
|
454 |
|
2e956fb32
|
455 456 457 |
kfifo_copy_in(fifo, buf, len, fifo->in + recsize); fifo->in += len + recsize; return len; |
86d488031
|
458 |
} |
2e956fb32
|
459 460 461 462 |
EXPORT_SYMBOL(__kfifo_in_r); static unsigned int kfifo_out_copy_r(struct __kfifo *fifo, void *buf, unsigned int len, size_t recsize, unsigned int *n) |
86d488031
|
463 |
{ |
2e956fb32
|
464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 |
*n = __kfifo_peek_n(fifo, recsize); if (len > *n) len = *n; kfifo_copy_out(fifo, buf, len, fifo->out + recsize); return len; } unsigned int __kfifo_out_peek_r(struct __kfifo *fifo, void *buf, unsigned int len, size_t recsize) { unsigned int n; if (fifo->in == fifo->out) return 0; return kfifo_out_copy_r(fifo, buf, len, recsize, &n); |
86d488031
|
482 |
} |
2e956fb32
|
483 |
EXPORT_SYMBOL(__kfifo_out_peek_r); |
a121f24ac
|
484 |
|
2e956fb32
|
485 486 |
unsigned int __kfifo_out_r(struct __kfifo *fifo, void *buf, unsigned int len, size_t recsize) |
86d488031
|
487 |
{ |
2e956fb32
|
488 489 490 491 492 493 494 495 |
unsigned int n; if (fifo->in == fifo->out) return 0; len = kfifo_out_copy_r(fifo, buf, len, recsize, &n); fifo->out += n + recsize; return len; |
86d488031
|
496 |
} |
2e956fb32
|
497 |
EXPORT_SYMBOL(__kfifo_out_r); |
a121f24ac
|
498 |
|
b35de43b3
|
499 500 501 502 503 504 505 506 |
void __kfifo_skip_r(struct __kfifo *fifo, size_t recsize) { unsigned int n; n = __kfifo_peek_n(fifo, recsize); fifo->out += n + recsize; } EXPORT_SYMBOL(__kfifo_skip_r); |
2e956fb32
|
507 508 |
int __kfifo_from_user_r(struct __kfifo *fifo, const void __user *from, unsigned long len, unsigned int *copied, size_t recsize) |
86d488031
|
509 |
{ |
2e956fb32
|
510 |
unsigned long ret; |
a121f24ac
|
511 |
|
2e956fb32
|
512 |
len = __kfifo_max_r(len, recsize); |
a121f24ac
|
513 |
|
2e956fb32
|
514 515 516 517 |
if (len + recsize > kfifo_unused(fifo)) { *copied = 0; return 0; } |
86d488031
|
518 |
|
2e956fb32
|
519 |
__kfifo_poke_n(fifo, len, recsize); |
86d488031
|
520 |
|
2e956fb32
|
521 522 523 524 525 526 527 |
ret = kfifo_copy_from_user(fifo, from, len, fifo->in + recsize, copied); if (unlikely(ret)) { *copied = 0; return -EFAULT; } fifo->in += len + recsize; return 0; |
86d488031
|
528 |
} |
2e956fb32
|
529 530 531 532 |
EXPORT_SYMBOL(__kfifo_from_user_r); int __kfifo_to_user_r(struct __kfifo *fifo, void __user *to, unsigned long len, unsigned int *copied, size_t recsize) |
86d488031
|
533 |
{ |
2e956fb32
|
534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 |
unsigned long ret; unsigned int n; if (fifo->in == fifo->out) { *copied = 0; return 0; } n = __kfifo_peek_n(fifo, recsize); if (len > n) len = n; ret = kfifo_copy_to_user(fifo, to, len, fifo->out + recsize, copied); if (unlikely(ret)) { *copied = 0; return -EFAULT; } fifo->out += n + recsize; return 0; |
a121f24ac
|
553 |
} |
2e956fb32
|
554 |
EXPORT_SYMBOL(__kfifo_to_user_r); |
a121f24ac
|
555 |
|
2e956fb32
|
556 557 |
unsigned int __kfifo_dma_in_prepare_r(struct __kfifo *fifo, struct scatterlist *sgl, int nents, unsigned int len, size_t recsize) |
86d488031
|
558 |
{ |
2e956fb32
|
559 560 561 562 563 564 565 566 567 |
if (!nents) BUG(); len = __kfifo_max_r(len, recsize); if (len + recsize > kfifo_unused(fifo)) return 0; return setup_sgl(fifo, sgl, nents, len, fifo->in + recsize); |
86d488031
|
568 |
} |
2e956fb32
|
569 |
EXPORT_SYMBOL(__kfifo_dma_in_prepare_r); |
86d488031
|
570 |
|
2e956fb32
|
571 572 |
void __kfifo_dma_in_finish_r(struct __kfifo *fifo, unsigned int len, size_t recsize) |
86d488031
|
573 |
{ |
2e956fb32
|
574 575 576 |
len = __kfifo_max_r(len, recsize); __kfifo_poke_n(fifo, len, recsize); fifo->in += len + recsize; |
86d488031
|
577 |
} |
2e956fb32
|
578 |
EXPORT_SYMBOL(__kfifo_dma_in_finish_r); |
86d488031
|
579 |
|
2e956fb32
|
580 581 |
unsigned int __kfifo_dma_out_prepare_r(struct __kfifo *fifo, struct scatterlist *sgl, int nents, unsigned int len, size_t recsize) |
86d488031
|
582 |
{ |
2e956fb32
|
583 584 585 586 587 588 589 590 591 |
if (!nents) BUG(); len = __kfifo_max_r(len, recsize); if (len + recsize > fifo->in - fifo->out) return 0; return setup_sgl(fifo, sgl, nents, len, fifo->out + recsize); |
86d488031
|
592 |
} |
2e956fb32
|
593 594 595 596 597 |
EXPORT_SYMBOL(__kfifo_dma_out_prepare_r); void __kfifo_dma_out_finish_r(struct __kfifo *fifo, size_t recsize) { unsigned int len; |
86d488031
|
598 |
|
2e956fb32
|
599 600 601 602 |
len = __kfifo_peek_n(fifo, recsize); fifo->out += len + recsize; } EXPORT_SYMBOL(__kfifo_dma_out_finish_r); |