Changeset d0a0f12 in mainline for generic/include/adt/fifo.h

Timestamp:

2006-02-10T14:12:57Z (19 years ago)

Author:

Jakub Jermar <jakub@…>

Branches:

lfn, master, serial, ticket/834-toolchain-update, topic/msim-upgrade, topic/simplify-dev-export

Children:

0882a9a

Parents:

a3eeceb6

Message:

Make ASID FIFO for mips32 be allocated statically.
Make ASID FIFO for sparc64 and ia64 be allocated dynamically.
Fix ia64 to call asid_fifo_init().
All three architectures now call asid_fifo_init() from as_arch_init().

File:

• generic/include/adt/fifo.h (modified) (5 diffs)

generic/include/adt/fifo.h

@@ -28 +28 @@
 
 /*
- * This implementation of FIFO stores values in a statically
- * allocated array created on each FIFO's initialization.
- * As such, these FIFOs have upper bound on number of values
- * they can store. Push and pop operations are done via accessing
- * the array through head and tail indices. Because of better
- * operation ordering in fifo_pop(), the access policy for these
- * two indices is to 'increment (mod size of FIFO) and use'.
+ * This implementation of FIFO stores values in an array
+ * (static or dynamic). As such, these FIFOs have upper bound
+ * on number of values they can store. Push and pop operations
+ * are done via accessing the array through head and tail indices.
+ * Because of better operation ordering in fifo_pop(), the access
+ * policy for these two indices is to 'increment (mod size of FIFO)
+ * and use'.
  */
 
@@ -41 +41 @@
 
 #include <typedefs.h>
+#include <mm/slab.h>
 
-/** Create and initialize FIFO.
+/** Create and initialize static FIFO.
+ *
+ * FIFO is allocated statically.
+ * This macro is suitable for creating smaller FIFOs.
  *
  * @param name Name of FIFO.
@@ -48 +52 @@
  * @param itms Number of items that can be stored in FIFO.
  */
-#define FIFO_INITIALIZE(name, t, itms)                  \
+#define FIFO_INITIALIZE_STATIC(name, t, itms)           \
         struct {                                        \
                 t fifo[(itms)];                         \
@@ -55 +59 @@
                 index_t tail;                           \
         } name = {                                      \
+                .items = (itms),                        \
+                .head = 0,                              \
+                .tail = 0                               \
+        }
+
+/** Create and prepare dynamic FIFO.
+ *
+ * FIFO is allocated dynamically.
+ * This macro is suitable for creating larger FIFOs. 
+ *
+ * @param name Name of FIFO.
+ * @param t Type of values stored in FIFO.
+ * @param itms Number of items that can be stored in FIFO.
+ */
+#define FIFO_INITIALIZE_DYNAMIC(name, t, itms)          \
+        struct {                                        \
+                t *fifo;                                \
+                count_t items;                          \
+                index_t head;                           \
+                index_t tail;                           \
+        } name = {                                      \
+                .fifo = NULL,                           \
                 .items = (itms),                        \
                 .head = 0,                              \
@@ -78 +104 @@
         name.fifo[name.tail = (name.tail + 1) < name.items ? (name.tail + 1) : 0] = (value) 
 
+/** Allocate memory for dynamic FIFO.
+ *
+ * @param name FIFO name.
+ */
+#define fifo_create(name) \
+        name.fifo = malloc(sizeof(*name.fifo) * name.items, 0)
+
 #endif