Subversion Repositories HelenOS

Rev

Rev 1787 | Rev 2089 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed

Rev Author Line No. Line
729 jermar 1
/*
2
 * Copyright (C) 2006 Jakub Jermar
3
 * All rights reserved.
4
 *
5
 * Redistribution and use in source and binary forms, with or without
6
 * modification, are permitted provided that the following conditions
7
 * are met:
8
 *
9
 * - Redistributions of source code must retain the above copyright
10
 *   notice, this list of conditions and the following disclaimer.
11
 * - Redistributions in binary form must reproduce the above copyright
12
 *   notice, this list of conditions and the following disclaimer in the
13
 *   documentation and/or other materials provided with the distribution.
14
 * - The name of the author may not be used to endorse or promote products
15
 *   derived from this software without specific prior written permission.
16
 *
17
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
18
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
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
26
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27
 */
28
 
1888 jermar 29
/** @addtogroup genericadt
1702 cejka 30
 * @{
31
 */
32
/** @file
33
 */
34
 
729 jermar 35
/*
830 jermar 36
 * This implementation of FIFO stores values in an array
37
 * (static or dynamic). As such, these FIFOs have upper bound
38
 * on number of values they can store. Push and pop operations
39
 * are done via accessing the array through head and tail indices.
40
 * Because of better operation ordering in fifo_pop(), the access
41
 * policy for these two indices is to 'increment (mod size of FIFO)
42
 * and use'.
729 jermar 43
 */
44
 
1888 jermar 45
#ifndef KERN_FIFO_H_
46
#define KERN_FIFO_H_
729 jermar 47
 
48
#include <typedefs.h>
830 jermar 49
#include <mm/slab.h>
729 jermar 50
 
830 jermar 51
/** Create and initialize static FIFO.
729 jermar 52
 *
830 jermar 53
 * FIFO is allocated statically.
54
 * This macro is suitable for creating smaller FIFOs.
55
 *
729 jermar 56
 * @param name Name of FIFO.
57
 * @param t Type of values stored in FIFO.
58
 * @param itms Number of items that can be stored in FIFO.
59
 */
830 jermar 60
#define FIFO_INITIALIZE_STATIC(name, t, itms)       \
729 jermar 61
    struct {                    \
62
        t fifo[(itms)];             \
63
        count_t items;              \
64
        index_t head;               \
65
        index_t tail;               \
66
    } name = {                  \
67
        .items = (itms),            \
68
        .head = 0,              \
69
        .tail = 0               \
70
    }
71
 
830 jermar 72
/** Create and prepare dynamic FIFO.
73
 *
74
 * FIFO is allocated dynamically.
75
 * This macro is suitable for creating larger FIFOs.
76
 *
77
 * @param name Name of FIFO.
78
 * @param t Type of values stored in FIFO.
79
 * @param itms Number of items that can be stored in FIFO.
80
 */
81
#define FIFO_INITIALIZE_DYNAMIC(name, t, itms)      \
82
    struct {                    \
83
        t *fifo;                \
84
        count_t items;              \
85
        index_t head;               \
86
        index_t tail;               \
87
    } name = {                  \
88
        .fifo = NULL,               \
89
        .items = (itms),            \
90
        .head = 0,              \
91
        .tail = 0               \
92
    }
93
 
729 jermar 94
/** Pop value from head of FIFO.
95
 *
96
 * @param name FIFO name.
97
 *
98
 * @return Leading value in FIFO.
99
 */
100
#define fifo_pop(name) \
752 jermar 101
    name.fifo[name.head = (name.head + 1) < name.items ? (name.head + 1) : 0]
729 jermar 102
 
103
/** Push value to tail of FIFO.
104
 *
105
 * @param name FIFO name.
106
 * @param value Value to be appended to FIFO.
107
 *
108
 */
109
#define fifo_push(name, value) \
752 jermar 110
    name.fifo[name.tail = (name.tail + 1) < name.items ? (name.tail + 1) : 0] = (value) 
729 jermar 111
 
830 jermar 112
/** Allocate memory for dynamic FIFO.
113
 *
114
 * @param name FIFO name.
115
 */
116
#define fifo_create(name) \
117
    name.fifo = malloc(sizeof(*name.fifo) * name.items, 0)
118
 
729 jermar 119
#endif
1702 cejka 120
 
1888 jermar 121
/** @}
1702 cejka 122
 */