blob: b50bb622e8b0892e89c518bd2b548a1bbcc6de75 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
Stefani Seibold45465482009-12-21 14:37:26 -08002 * A generic kernel FIFO implementation.
Linus Torvalds1da177e2005-04-16 15:20:36 -07003 *
Stefani Seibold45465482009-12-21 14:37:26 -08004 * Copyright (C) 2009 Stefani Seibold <stefani@seibold.net>
Linus Torvalds1da177e2005-04-16 15:20:36 -07005 * Copyright (C) 2004 Stelian Pop <stelian@popies.net>
6 *
7 * This program is free software; you can redistribute it and/or modify
8 * it under the terms of the GNU General Public License as published by
9 * the Free Software Foundation; either version 2 of the License, or
10 * (at your option) any later version.
11 *
12 * This program is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 * GNU General Public License for more details.
16 *
17 * You should have received a copy of the GNU General Public License
18 * along with this program; if not, write to the Free Software
19 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
20 *
21 */
22
23#include <linux/kernel.h>
24#include <linux/module.h>
25#include <linux/slab.h>
26#include <linux/err.h>
27#include <linux/kfifo.h>
vignesh babuf84d5a72007-07-15 23:41:34 -070028#include <linux/log2.h>
Stefani Seibolda121f242009-12-21 14:37:31 -080029#include <linux/uaccess.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070030
Andi Kleen8ecc2952010-01-15 17:01:12 -080031static void _kfifo_init(struct kfifo *fifo, void *buffer,
Stefani Seiboldc1e13f22009-12-21 14:37:27 -080032 unsigned int size)
Stefani Seibold45465482009-12-21 14:37:26 -080033{
34 fifo->buffer = buffer;
35 fifo->size = size;
Stefani Seibold45465482009-12-21 14:37:26 -080036
37 kfifo_reset(fifo);
38}
39
Linus Torvalds1da177e2005-04-16 15:20:36 -070040/**
Stefani Seibold45465482009-12-21 14:37:26 -080041 * kfifo_init - initialize a FIFO using a preallocated buffer
42 * @fifo: the fifo to assign the buffer
Linus Torvalds1da177e2005-04-16 15:20:36 -070043 * @buffer: the preallocated buffer to be used.
44 * @size: the size of the internal buffer, this have to be a power of 2.
Linus Torvalds1da177e2005-04-16 15:20:36 -070045 *
Linus Torvalds1da177e2005-04-16 15:20:36 -070046 */
Andi Kleen8ecc2952010-01-15 17:01:12 -080047void kfifo_init(struct kfifo *fifo, void *buffer, unsigned int size)
Linus Torvalds1da177e2005-04-16 15:20:36 -070048{
Linus Torvalds1da177e2005-04-16 15:20:36 -070049 /* size must be a power of 2 */
vignesh babuf84d5a72007-07-15 23:41:34 -070050 BUG_ON(!is_power_of_2(size));
Linus Torvalds1da177e2005-04-16 15:20:36 -070051
Stefani Seiboldc1e13f22009-12-21 14:37:27 -080052 _kfifo_init(fifo, buffer, size);
Linus Torvalds1da177e2005-04-16 15:20:36 -070053}
54EXPORT_SYMBOL(kfifo_init);
55
56/**
Stefani Seibold45465482009-12-21 14:37:26 -080057 * kfifo_alloc - allocates a new FIFO internal buffer
58 * @fifo: the fifo to assign then new buffer
59 * @size: the size of the buffer to be allocated, this have to be a power of 2.
Linus Torvalds1da177e2005-04-16 15:20:36 -070060 * @gfp_mask: get_free_pages mask, passed to kmalloc()
Linus Torvalds1da177e2005-04-16 15:20:36 -070061 *
Stefani Seibold45465482009-12-21 14:37:26 -080062 * This function dynamically allocates a new fifo internal buffer
63 *
Linus Torvalds1da177e2005-04-16 15:20:36 -070064 * The size will be rounded-up to a power of 2.
Stefani Seibold45465482009-12-21 14:37:26 -080065 * The buffer will be release with kfifo_free().
66 * Return 0 if no error, otherwise the an error code
Linus Torvalds1da177e2005-04-16 15:20:36 -070067 */
Stefani Seiboldc1e13f22009-12-21 14:37:27 -080068int kfifo_alloc(struct kfifo *fifo, unsigned int size, gfp_t gfp_mask)
Linus Torvalds1da177e2005-04-16 15:20:36 -070069{
70 unsigned char *buffer;
Linus Torvalds1da177e2005-04-16 15:20:36 -070071
72 /*
73 * round up to the next power of 2, since our 'let the indices
Robert P. J. Dayb33112d2009-06-16 15:33:34 -070074 * wrap' technique works only in this case.
Linus Torvalds1da177e2005-04-16 15:20:36 -070075 */
Robert P. J. Dayb33112d2009-06-16 15:33:34 -070076 if (!is_power_of_2(size)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -070077 BUG_ON(size > 0x80000000);
78 size = roundup_pow_of_two(size);
79 }
80
81 buffer = kmalloc(size, gfp_mask);
Stefani Seibold45465482009-12-21 14:37:26 -080082 if (!buffer) {
Stefani Seiboldc1e13f22009-12-21 14:37:27 -080083 _kfifo_init(fifo, 0, 0);
Stefani Seibold45465482009-12-21 14:37:26 -080084 return -ENOMEM;
85 }
Linus Torvalds1da177e2005-04-16 15:20:36 -070086
Stefani Seiboldc1e13f22009-12-21 14:37:27 -080087 _kfifo_init(fifo, buffer, size);
Linus Torvalds1da177e2005-04-16 15:20:36 -070088
Stefani Seibold45465482009-12-21 14:37:26 -080089 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -070090}
91EXPORT_SYMBOL(kfifo_alloc);
92
93/**
Stefani Seibold45465482009-12-21 14:37:26 -080094 * kfifo_free - frees the FIFO internal buffer
Linus Torvalds1da177e2005-04-16 15:20:36 -070095 * @fifo: the fifo to be freed.
96 */
97void kfifo_free(struct kfifo *fifo)
98{
99 kfree(fifo->buffer);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700100}
101EXPORT_SYMBOL(kfifo_free);
102
103/**
Stefani Seibolda121f242009-12-21 14:37:31 -0800104 * kfifo_skip - skip output data
105 * @fifo: the fifo to be used.
106 * @len: number of bytes to skip
107 */
108void kfifo_skip(struct kfifo *fifo, unsigned int len)
109{
110 if (len < kfifo_len(fifo)) {
111 __kfifo_add_out(fifo, len);
112 return;
113 }
114 kfifo_reset_out(fifo);
115}
116EXPORT_SYMBOL(kfifo_skip);
117
Stefani Seibold86d48802009-12-21 14:37:32 -0800118static inline void __kfifo_in_data(struct kfifo *fifo,
119 const void *from, unsigned int len, unsigned int off)
120{
121 unsigned int l;
122
123 /*
124 * Ensure that we sample the fifo->out index -before- we
125 * start putting bytes into the kfifo.
126 */
127
128 smp_mb();
129
130 off = __kfifo_off(fifo, fifo->in + off);
131
132 /* first put the data starting from fifo->in to buffer end */
133 l = min(len, fifo->size - off);
134 memcpy(fifo->buffer + off, from, l);
135
136 /* then put the rest (if any) at the beginning of the buffer */
137 memcpy(fifo->buffer, from + l, len - l);
138}
139
140static inline void __kfifo_out_data(struct kfifo *fifo,
141 void *to, unsigned int len, unsigned int off)
142{
143 unsigned int l;
144
145 /*
146 * Ensure that we sample the fifo->in index -before- we
147 * start removing bytes from the kfifo.
148 */
149
150 smp_rmb();
151
152 off = __kfifo_off(fifo, fifo->out + off);
153
154 /* first get the data from fifo->out until the end of the buffer */
155 l = min(len, fifo->size - off);
156 memcpy(to, fifo->buffer + off, l);
157
158 /* then get the rest (if any) from the beginning of the buffer */
159 memcpy(to + l, fifo->buffer, len - l);
160}
161
Andi Kleen64ce1032010-01-15 17:01:15 -0800162static inline int __kfifo_from_user_data(struct kfifo *fifo,
163 const void __user *from, unsigned int len, unsigned int off,
164 unsigned *lenout)
Stefani Seibold86d48802009-12-21 14:37:32 -0800165{
166 unsigned int l;
167 int ret;
168
169 /*
170 * Ensure that we sample the fifo->out index -before- we
171 * start putting bytes into the kfifo.
172 */
173
174 smp_mb();
175
176 off = __kfifo_off(fifo, fifo->in + off);
177
178 /* first put the data starting from fifo->in to buffer end */
179 l = min(len, fifo->size - off);
180 ret = copy_from_user(fifo->buffer + off, from, l);
Andi Kleen64ce1032010-01-15 17:01:15 -0800181 if (unlikely(ret)) {
182 *lenout = ret;
183 return -EFAULT;
184 }
185 *lenout = l;
Stefani Seibold86d48802009-12-21 14:37:32 -0800186
187 /* then put the rest (if any) at the beginning of the buffer */
Andi Kleen64ce1032010-01-15 17:01:15 -0800188 ret = copy_from_user(fifo->buffer, from + l, len - l);
189 *lenout += ret ? ret : len - l;
190 return ret ? -EFAULT : 0;
Stefani Seibold86d48802009-12-21 14:37:32 -0800191}
192
Andi Kleen64ce1032010-01-15 17:01:15 -0800193static inline int __kfifo_to_user_data(struct kfifo *fifo,
194 void __user *to, unsigned int len, unsigned int off, unsigned *lenout)
Stefani Seibold86d48802009-12-21 14:37:32 -0800195{
196 unsigned int l;
197 int ret;
198
199 /*
200 * Ensure that we sample the fifo->in index -before- we
201 * start removing bytes from the kfifo.
202 */
203
204 smp_rmb();
205
206 off = __kfifo_off(fifo, fifo->out + off);
207
208 /* first get the data from fifo->out until the end of the buffer */
209 l = min(len, fifo->size - off);
210 ret = copy_to_user(to, fifo->buffer + off, l);
Andi Kleen64ce1032010-01-15 17:01:15 -0800211 *lenout = l;
212 if (unlikely(ret)) {
213 *lenout -= ret;
214 return -EFAULT;
215 }
Stefani Seibold86d48802009-12-21 14:37:32 -0800216
217 /* then get the rest (if any) from the beginning of the buffer */
Andi Kleen64ce1032010-01-15 17:01:15 -0800218 len -= l;
219 ret = copy_to_user(to + l, fifo->buffer, len);
220 if (unlikely(ret)) {
221 *lenout += len - ret;
222 return -EFAULT;
223 }
224 *lenout += len;
225 return 0;
Stefani Seibold86d48802009-12-21 14:37:32 -0800226}
227
228unsigned int __kfifo_in_n(struct kfifo *fifo,
229 const void *from, unsigned int len, unsigned int recsize)
230{
231 if (kfifo_avail(fifo) < len + recsize)
232 return len + 1;
233
234 __kfifo_in_data(fifo, from, len, recsize);
235 return 0;
236}
237EXPORT_SYMBOL(__kfifo_in_n);
238
Stefani Seibolda121f242009-12-21 14:37:31 -0800239/**
Stefani Seibold7acd72e2009-12-21 14:37:28 -0800240 * kfifo_in - puts some data into the FIFO
Linus Torvalds1da177e2005-04-16 15:20:36 -0700241 * @fifo: the fifo to be used.
Stefani Seibold7acd72e2009-12-21 14:37:28 -0800242 * @from: the data to be added.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700243 * @len: the length of the data to be added.
244 *
Stefani Seibold7acd72e2009-12-21 14:37:28 -0800245 * This function copies at most @len bytes from the @from buffer into
Linus Torvalds1da177e2005-04-16 15:20:36 -0700246 * the FIFO depending on the free space, and returns the number of
247 * bytes copied.
248 *
249 * Note that with only one concurrent reader and one concurrent
250 * writer, you don't need extra locking to use these functions.
251 */
Andi Kleen8ecc2952010-01-15 17:01:12 -0800252unsigned int kfifo_in(struct kfifo *fifo, const void *from,
Stefani Seibold86d48802009-12-21 14:37:32 -0800253 unsigned int len)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700254{
Stefani Seibold86d48802009-12-21 14:37:32 -0800255 len = min(kfifo_avail(fifo), len);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700256
Stefani Seibold86d48802009-12-21 14:37:32 -0800257 __kfifo_in_data(fifo, from, len, 0);
Stefani Seibolda121f242009-12-21 14:37:31 -0800258 __kfifo_add_in(fifo, len);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700259 return len;
260}
Stefani Seibold7acd72e2009-12-21 14:37:28 -0800261EXPORT_SYMBOL(kfifo_in);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700262
Stefani Seibold86d48802009-12-21 14:37:32 -0800263unsigned int __kfifo_in_generic(struct kfifo *fifo,
264 const void *from, unsigned int len, unsigned int recsize)
265{
266 return __kfifo_in_rec(fifo, from, len, recsize);
267}
268EXPORT_SYMBOL(__kfifo_in_generic);
269
270unsigned int __kfifo_out_n(struct kfifo *fifo,
271 void *to, unsigned int len, unsigned int recsize)
272{
273 if (kfifo_len(fifo) < len + recsize)
274 return len;
275
276 __kfifo_out_data(fifo, to, len, recsize);
277 __kfifo_add_out(fifo, len + recsize);
278 return 0;
279}
280EXPORT_SYMBOL(__kfifo_out_n);
281
Linus Torvalds1da177e2005-04-16 15:20:36 -0700282/**
Stefani Seibold7acd72e2009-12-21 14:37:28 -0800283 * kfifo_out - gets some data from the FIFO
Linus Torvalds1da177e2005-04-16 15:20:36 -0700284 * @fifo: the fifo to be used.
Stefani Seibold7acd72e2009-12-21 14:37:28 -0800285 * @to: where the data must be copied.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700286 * @len: the size of the destination buffer.
287 *
Robert P. J. Day72fd4a32007-02-10 01:45:59 -0800288 * This function copies at most @len bytes from the FIFO into the
Stefani Seibold7acd72e2009-12-21 14:37:28 -0800289 * @to buffer and returns the number of copied bytes.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700290 *
291 * Note that with only one concurrent reader and one concurrent
292 * writer, you don't need extra locking to use these functions.
293 */
Andi Kleen8ecc2952010-01-15 17:01:12 -0800294unsigned int kfifo_out(struct kfifo *fifo, void *to, unsigned int len)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700295{
Stefani Seibold86d48802009-12-21 14:37:32 -0800296 len = min(kfifo_len(fifo), len);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700297
Stefani Seibold86d48802009-12-21 14:37:32 -0800298 __kfifo_out_data(fifo, to, len, 0);
Stefani Seibolda121f242009-12-21 14:37:31 -0800299 __kfifo_add_out(fifo, len);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700300
301 return len;
302}
Stefani Seibold7acd72e2009-12-21 14:37:28 -0800303EXPORT_SYMBOL(kfifo_out);
Stefani Seibolda121f242009-12-21 14:37:31 -0800304
Stefani Seibold86d48802009-12-21 14:37:32 -0800305unsigned int __kfifo_out_generic(struct kfifo *fifo,
306 void *to, unsigned int len, unsigned int recsize,
307 unsigned int *total)
308{
309 return __kfifo_out_rec(fifo, to, len, recsize, total);
310}
311EXPORT_SYMBOL(__kfifo_out_generic);
312
313unsigned int __kfifo_from_user_n(struct kfifo *fifo,
314 const void __user *from, unsigned int len, unsigned int recsize)
315{
Andi Kleen64ce1032010-01-15 17:01:15 -0800316 unsigned total;
317
Stefani Seibold86d48802009-12-21 14:37:32 -0800318 if (kfifo_avail(fifo) < len + recsize)
319 return len + 1;
320
Andi Kleen64ce1032010-01-15 17:01:15 -0800321 __kfifo_from_user_data(fifo, from, len, recsize, &total);
322 return total;
Stefani Seibold86d48802009-12-21 14:37:32 -0800323}
324EXPORT_SYMBOL(__kfifo_from_user_n);
325
Stefani Seibolda121f242009-12-21 14:37:31 -0800326/**
327 * kfifo_from_user - puts some data from user space into the FIFO
328 * @fifo: the fifo to be used.
329 * @from: pointer to the data to be added.
330 * @len: the length of the data to be added.
331 *
332 * This function copies at most @len bytes from the @from into the
Andi Kleen64ce1032010-01-15 17:01:15 -0800333 * FIFO depending and returns -EFAULT/0.
Stefani Seibolda121f242009-12-21 14:37:31 -0800334 *
335 * Note that with only one concurrent reader and one concurrent
336 * writer, you don't need extra locking to use these functions.
337 */
Andi Kleen64ce1032010-01-15 17:01:15 -0800338int kfifo_from_user(struct kfifo *fifo,
339 const void __user *from, unsigned int len, unsigned *total)
Stefani Seibolda121f242009-12-21 14:37:31 -0800340{
Andi Kleen64ce1032010-01-15 17:01:15 -0800341 int ret;
Stefani Seibold86d48802009-12-21 14:37:32 -0800342 len = min(kfifo_avail(fifo), len);
Andi Kleen64ce1032010-01-15 17:01:15 -0800343 ret = __kfifo_from_user_data(fifo, from, len, 0, total);
344 if (ret)
345 return ret;
Stefani Seibolda121f242009-12-21 14:37:31 -0800346 __kfifo_add_in(fifo, len);
Andi Kleen64ce1032010-01-15 17:01:15 -0800347 return 0;
Stefani Seibolda121f242009-12-21 14:37:31 -0800348}
349EXPORT_SYMBOL(kfifo_from_user);
350
Stefani Seibold86d48802009-12-21 14:37:32 -0800351unsigned int __kfifo_from_user_generic(struct kfifo *fifo,
352 const void __user *from, unsigned int len, unsigned int recsize)
353{
354 return __kfifo_from_user_rec(fifo, from, len, recsize);
355}
356EXPORT_SYMBOL(__kfifo_from_user_generic);
357
358unsigned int __kfifo_to_user_n(struct kfifo *fifo,
359 void __user *to, unsigned int len, unsigned int reclen,
360 unsigned int recsize)
361{
Andi Kleen64ce1032010-01-15 17:01:15 -0800362 unsigned int ret, total;
Stefani Seibold86d48802009-12-21 14:37:32 -0800363
364 if (kfifo_len(fifo) < reclen + recsize)
365 return len;
366
Andi Kleen64ce1032010-01-15 17:01:15 -0800367 ret = __kfifo_to_user_data(fifo, to, reclen, recsize, &total);
Stefani Seibold86d48802009-12-21 14:37:32 -0800368
369 if (likely(ret == 0))
370 __kfifo_add_out(fifo, reclen + recsize);
371
Andi Kleen64ce1032010-01-15 17:01:15 -0800372 return total;
Stefani Seibold86d48802009-12-21 14:37:32 -0800373}
374EXPORT_SYMBOL(__kfifo_to_user_n);
375
Stefani Seibolda121f242009-12-21 14:37:31 -0800376/**
377 * kfifo_to_user - gets data from the FIFO and write it to user space
378 * @fifo: the fifo to be used.
379 * @to: where the data must be copied.
380 * @len: the size of the destination buffer.
Andi Kleen64ce1032010-01-15 17:01:15 -0800381 @ @lenout: pointer to output variable with copied data
Stefani Seibolda121f242009-12-21 14:37:31 -0800382 *
383 * This function copies at most @len bytes from the FIFO into the
Andi Kleen64ce1032010-01-15 17:01:15 -0800384 * @to buffer and 0 or -EFAULT.
Stefani Seibolda121f242009-12-21 14:37:31 -0800385 *
386 * Note that with only one concurrent reader and one concurrent
387 * writer, you don't need extra locking to use these functions.
388 */
Andi Kleen64ce1032010-01-15 17:01:15 -0800389int kfifo_to_user(struct kfifo *fifo,
390 void __user *to, unsigned int len, unsigned *lenout)
Stefani Seibolda121f242009-12-21 14:37:31 -0800391{
Andi Kleen64ce1032010-01-15 17:01:15 -0800392 int ret;
Stefani Seibold86d48802009-12-21 14:37:32 -0800393 len = min(kfifo_len(fifo), len);
Andi Kleen64ce1032010-01-15 17:01:15 -0800394 ret = __kfifo_to_user_data(fifo, to, len, 0, lenout);
395 __kfifo_add_out(fifo, *lenout);
396 return ret;
Stefani Seibolda121f242009-12-21 14:37:31 -0800397}
398EXPORT_SYMBOL(kfifo_to_user);
399
Stefani Seibold86d48802009-12-21 14:37:32 -0800400unsigned int __kfifo_to_user_generic(struct kfifo *fifo,
401 void __user *to, unsigned int len, unsigned int recsize,
402 unsigned int *total)
403{
404 return __kfifo_to_user_rec(fifo, to, len, recsize, total);
405}
406EXPORT_SYMBOL(__kfifo_to_user_generic);
407
408unsigned int __kfifo_peek_generic(struct kfifo *fifo, unsigned int recsize)
409{
410 if (recsize == 0)
411 return kfifo_avail(fifo);
412
413 return __kfifo_peek_n(fifo, recsize);
414}
415EXPORT_SYMBOL(__kfifo_peek_generic);
416
417void __kfifo_skip_generic(struct kfifo *fifo, unsigned int recsize)
418{
419 __kfifo_skip_rec(fifo, recsize);
420}
421EXPORT_SYMBOL(__kfifo_skip_generic);
422