Rev 830 | Show entire file | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 830 | Rev 1702 | ||
---|---|---|---|
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 |
|
- | 30 | * @{ |
|
- | 31 | */ |
|
- | 32 | /** @file |
|
- | 33 | */ |
|
- | 34 | ||
29 | /* |
35 | /* |
30 | * This implementation of FIFO stores values in an array |
36 | * This implementation of FIFO stores values in an array |
31 | * (static or dynamic). As such, these FIFOs have upper bound |
37 | * (static or dynamic). As such, these FIFOs have upper bound |
32 | * on number of values they can store. Push and pop operations |
38 | * on number of values they can store. Push and pop operations |
33 | * are done via accessing the array through head and tail indices. |
39 | * are done via accessing the array through head and tail indices. |
Line 109... | Line 115... | ||
109 | */ |
115 | */ |
110 | #define fifo_create(name) \ |
116 | #define fifo_create(name) \ |
111 | name.fifo = malloc(sizeof(*name.fifo) * name.items, 0) |
117 | name.fifo = malloc(sizeof(*name.fifo) * name.items, 0) |
112 | 118 | ||
113 | #endif |
119 | #endif |
- | 120 | ||
- | 121 | /** @} |
|
- | 122 | */ |
|
- | 123 |