X-Git-Url: http://git.tuebingen.mpg.de/?p=paraslash.git;a=blobdiff_plain;f=ringbuffer.c;h=ac5d7d37c862cdf2aae7d7b7ed4c91b63a0849e3;hp=f6596daf81d31ef245b8e08727dee7afff944bab;hb=d4776878609698ca63c99c3db711ae3edf038bba;hpb=471684761a2039bbc89aa1e3c33c62de6bef86cf diff --git a/ringbuffer.c b/ringbuffer.c index f6596daf..ac5d7d37 100644 --- a/ringbuffer.c +++ b/ringbuffer.c @@ -1,51 +1,36 @@ /* - * Copyright (C) 2006 Andre Noll + * Copyright (C) 2006-2007 Andre Noll * * Licensed under the GPL v2. For licencing details see COPYING. */ -/** \file ringbuffer.c simple ringbuffer implementation */ +/** \file ringbuffer.c Simple ringbuffer implementation */ #include "para.h" #include "ringbuffer.h" #include "string.h" /** - * holds all information about one ring buffer + * Holds all information about one ring buffer * * It is intentionally not exported via ringbuffer.h. Think abstract. */ struct ringbuffer { -/** - * - * - * the size of this ring buffer -*/ -unsigned size; -/** - * - * - * the actual entries of the ringbuffer -*/ -void **entries; -/** - * - * - * the next entry will be added at this position - */ -int head; -/** - * - * how many entries the ring buffer contains -*/ -unsigned filled; + /** The size of this ring buffer. */ + unsigned size; + /** The actual entries of the ringbuffer. */ + void **entries; + /** The next entry will be added at this position. */ + int head; + /** How many entries the ring buffer contains. */ + unsigned filled; }; /** - * initialize a new ringbuffer + * Initialize a new ringbuffer. * - * @param size the number of entries the ringbuffer holds + * \param size The number of entries the ringbuffer holds. * * This function initializes a circular ring buffer which can hold up to \a * size entries of arbitrary type. If performance is an issue, \a size should @@ -53,7 +38,7 @@ unsigned filled; * many ringbuffers may be initialized via this function. Each ringbuffer is * identified by a 'cookie'. * - * Return value: A 'cookie' which identifies the ringbuffer just created and + * \return A 'cookie' which identifies the ringbuffer just created and * which must be passed to ringbuffer_add() and ringbuffer_get(). */ void *ringbuffer_new(unsigned size) @@ -65,12 +50,12 @@ void *ringbuffer_new(unsigned size) }; /** - * add one entry to a ringbuffer + * Add one entry to a ringbuffer. * - * @param cookie the ringbuffer identifier - * @param data the data to be inserted + * \param cookie The ringbuffer identifier. + * \param data The data to be inserted. * - * insert \a data into the ringbuffer associated with \a cookie. As soon as + * Insert \a data into the ringbuffer associated with \a cookie. As soon as * the ringbuffer fills up, its oldest entry is disregarded and replaced by \a * data. * @@ -89,10 +74,10 @@ void *ringbuffer_add(void *cookie, void *data) } /** - * get one entry from a ringbuffer + * Get one entry from a ringbuffer. * - * @param cookie the ringbuffer identifier - * @param num the number of the entry + * \param cookie The ringbuffer identifier. + * \param num The number of the entry. * * \return A pointer to data previously added, or NULL if entry number * \a num is not available. \a num counts backwards from zero, i.e. @@ -107,9 +92,9 @@ void *ringbuffer_get(void *cookie, int num) } /** - * get the number of entries in the ring buffer + * Get the number of entries in the ring buffer. * - * @param cookie the ringbuffer identifier + * \param cookie The ringbuffer identifier * * This function always succeeds and never returns a number greater than the * size of the ring buffer.