Rev 1787 | Rev 2089 | Go to most recent revision | Show entire file | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 1787 | Rev 1888 | ||
---|---|---|---|
Line 24... | Line 24... | ||
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
25 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
25 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | */ |
27 | */ |
28 | 28 | ||
29 | /** @addtogroup genericadt |
29 | /** @addtogroup genericadt |
30 | * @{ |
30 | * @{ |
31 | */ |
31 | */ |
32 | /** @file |
32 | /** @file |
33 | */ |
33 | */ |
34 | 34 | ||
Line 40... | Line 40... | ||
40 | * Because of better operation ordering in fifo_pop(), the access |
40 | * Because of better operation ordering in fifo_pop(), the access |
41 | * policy for these two indices is to 'increment (mod size of FIFO) |
41 | * policy for these two indices is to 'increment (mod size of FIFO) |
42 | * and use'. |
42 | * and use'. |
43 | */ |
43 | */ |
44 | 44 | ||
45 | #ifndef __FIFO_H__ |
45 | #ifndef KERN_FIFO_H_ |
46 | #define __FIFO_H__ |
46 | #define KERN_FIFO_H_ |
47 | 47 | ||
48 | #include <typedefs.h> |
48 | #include <typedefs.h> |
49 | #include <mm/slab.h> |
49 | #include <mm/slab.h> |
50 | 50 | ||
51 | /** Create and initialize static FIFO. |
51 | /** Create and initialize static FIFO. |
Line 116... | Line 116... | ||
116 | #define fifo_create(name) \ |
116 | #define fifo_create(name) \ |
117 | name.fifo = malloc(sizeof(*name.fifo) * name.items, 0) |
117 | name.fifo = malloc(sizeof(*name.fifo) * name.items, 0) |
118 | 118 | ||
119 | #endif |
119 | #endif |
120 | 120 | ||
121 | /** @} |
121 | /** @} |
122 | */ |
122 | */ |
123 | - |