This is a new generic kernel FIFO implementation. The current kernel fifo API is not very widely used, because it has to many constrains. Only 17 files in the current 2.6.31-rc5 used it. FIFO's are like list's a very basic thing and a kfifo API which handles the most use case would save a lot of development time and memory resources. I think this are the reasons why kfifo is not in use: - The API is to simple, important functions are missing - A fifo can be only allocated dynamically - There is a requirement of a spinlock whether you need it or not - There is no support for data records inside a fifo So I decided to extend the kfifo in a more generic way without blowing up the API to much. The new API has the following benefits: - Generic usage: For kernel internal use and/or device driver. - Provide an API for the most use case. - Slim API: The whole API provides 25 functions. - Linux style habit. - DECLARE_KFIFO, DEFINE_KFIFO and INIT_KFIFO Macros - Direct copy_to_user from the fifo and copy_from_user into the fifo. - The kfifo itself is an in place member of the using data structure, this save an indirection access and does not waste the kernel allocator. - Lockless access: if only one reader and one writer is active on the fifo, which is the common use case, no additional locking is necessary. - Remove spinlock - give the user the freedom of choice what kind of locking to use if one is required. - Ability to handle records. Three type of records are supported: - Variable length records between 0-255 bytes, with a record size field of 1 bytes. - Variable length records between 0-65535 bytes, with a record size field of 2 bytes. - Fixed size records, which no record size field. - Preserve memory resource. - Performance! - Easy to use! This patch: Since most users want to have the kfifo as part of another object, reorganize the code to allow including struct kfifo in another data structure. This requires changing the kfifo_alloc and kfifo_init prototypes so that we pass an existing kfifo pointer into them. This patch changes the implementation and all existing users. [akpm@linux-foundation.org: fix warning] Signed-off-by: Stefani Seibold <stefani@seibold.net> Acked-by: Greg Kroah-Hartman <gregkh@suse.de> Acked-by: Mauro Carvalho Chehab <mchehab@redhat.com> Acked-by: Andi Kleen <ak@linux.intel.com> Acked-by: Arnd Bergmann <arnd@arndb.de> Signed-off-by: Andrew Morton <akpm@linux-foundation.org> Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
153 lines
4.1 KiB
C
153 lines
4.1 KiB
C
/*
|
|
* A generic kernel FIFO implementation.
|
|
*
|
|
* Copyright (C) 2009 Stefani Seibold <stefani@seibold.net>
|
|
* Copyright (C) 2004 Stelian Pop <stelian@popies.net>
|
|
*
|
|
* 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
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
* 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.
|
|
*
|
|
*/
|
|
#ifndef _LINUX_KFIFO_H
|
|
#define _LINUX_KFIFO_H
|
|
|
|
#include <linux/kernel.h>
|
|
#include <linux/spinlock.h>
|
|
|
|
struct kfifo {
|
|
unsigned char *buffer; /* the buffer holding the data */
|
|
unsigned int size; /* the size of the allocated buffer */
|
|
unsigned int in; /* data is added at offset (in % size) */
|
|
unsigned int out; /* data is extracted from off. (out % size) */
|
|
spinlock_t *lock; /* protects concurrent modifications */
|
|
};
|
|
|
|
extern void kfifo_init(struct kfifo *fifo, unsigned char *buffer,
|
|
unsigned int size, spinlock_t *lock);
|
|
extern __must_check int kfifo_alloc(struct kfifo *fifo, unsigned int size,
|
|
gfp_t gfp_mask, spinlock_t *lock);
|
|
extern void kfifo_free(struct kfifo *fifo);
|
|
extern unsigned int __kfifo_put(struct kfifo *fifo,
|
|
const unsigned char *buffer, unsigned int len);
|
|
extern unsigned int __kfifo_get(struct kfifo *fifo,
|
|
unsigned char *buffer, unsigned int len);
|
|
|
|
/**
|
|
* __kfifo_reset - removes the entire FIFO contents, no locking version
|
|
* @fifo: the fifo to be emptied.
|
|
*/
|
|
static inline void __kfifo_reset(struct kfifo *fifo)
|
|
{
|
|
fifo->in = fifo->out = 0;
|
|
}
|
|
|
|
/**
|
|
* kfifo_reset - removes the entire FIFO contents
|
|
* @fifo: the fifo to be emptied.
|
|
*/
|
|
static inline void kfifo_reset(struct kfifo *fifo)
|
|
{
|
|
unsigned long flags;
|
|
|
|
spin_lock_irqsave(fifo->lock, flags);
|
|
|
|
__kfifo_reset(fifo);
|
|
|
|
spin_unlock_irqrestore(fifo->lock, flags);
|
|
}
|
|
|
|
/**
|
|
* kfifo_put - puts some data into the FIFO
|
|
* @fifo: the fifo to be used.
|
|
* @buffer: the data to be added.
|
|
* @len: the length of the data to be added.
|
|
*
|
|
* This function copies at most @len bytes from the @buffer into
|
|
* the FIFO depending on the free space, and returns the number of
|
|
* bytes copied.
|
|
*/
|
|
static inline unsigned int kfifo_put(struct kfifo *fifo,
|
|
const unsigned char *buffer, unsigned int len)
|
|
{
|
|
unsigned long flags;
|
|
unsigned int ret;
|
|
|
|
spin_lock_irqsave(fifo->lock, flags);
|
|
|
|
ret = __kfifo_put(fifo, buffer, len);
|
|
|
|
spin_unlock_irqrestore(fifo->lock, flags);
|
|
|
|
return ret;
|
|
}
|
|
|
|
/**
|
|
* kfifo_get - gets some data from the FIFO
|
|
* @fifo: the fifo to be used.
|
|
* @buffer: where the data must be copied.
|
|
* @len: the size of the destination buffer.
|
|
*
|
|
* This function copies at most @len bytes from the FIFO into the
|
|
* @buffer and returns the number of copied bytes.
|
|
*/
|
|
static inline unsigned int kfifo_get(struct kfifo *fifo,
|
|
unsigned char *buffer, unsigned int len)
|
|
{
|
|
unsigned long flags;
|
|
unsigned int ret;
|
|
|
|
spin_lock_irqsave(fifo->lock, flags);
|
|
|
|
ret = __kfifo_get(fifo, buffer, len);
|
|
|
|
/*
|
|
* optimization: if the FIFO is empty, set the indices to 0
|
|
* so we don't wrap the next time
|
|
*/
|
|
if (fifo->in == fifo->out)
|
|
fifo->in = fifo->out = 0;
|
|
|
|
spin_unlock_irqrestore(fifo->lock, flags);
|
|
|
|
return ret;
|
|
}
|
|
|
|
/**
|
|
* __kfifo_len - returns the number of bytes available in the FIFO, no locking version
|
|
* @fifo: the fifo to be used.
|
|
*/
|
|
static inline unsigned int __kfifo_len(struct kfifo *fifo)
|
|
{
|
|
return fifo->in - fifo->out;
|
|
}
|
|
|
|
/**
|
|
* kfifo_len - returns the number of bytes available in the FIFO
|
|
* @fifo: the fifo to be used.
|
|
*/
|
|
static inline unsigned int kfifo_len(struct kfifo *fifo)
|
|
{
|
|
unsigned long flags;
|
|
unsigned int ret;
|
|
|
|
spin_lock_irqsave(fifo->lock, flags);
|
|
|
|
ret = __kfifo_len(fifo);
|
|
|
|
spin_unlock_irqrestore(fifo->lock, flags);
|
|
|
|
return ret;
|
|
}
|
|
|
|
#endif
|