Initial commit

include/l4/lib/bit.h

@@ -0,0 +1,38 @@
+#ifndef __LIB_BIT_H__
+#define __LIB_BIT_H__
+
+unsigned int __clz(unsigned int bitvector);
+int find_and_set_first_free_bit(u32 *word, unsigned int lastbit);
+int check_and_clear_bit(u32 *word, int bit);
+
+
+/* Set */
+static inline void setbit(unsigned int *w, unsigned int flags)
+{
+	*w |= flags;
+}
+
+
+/* Clear */
+static inline void clrbit(unsigned int *w, unsigned int flags)
+{
+	*w &= ~flags;
+}
+
+/* Test */
+static inline int tstbit(unsigned int *w, unsigned int flags)
+{
+	return *w & flags;
+}
+
+/* Test and clear */
+static inline int tstclr(unsigned int *w, unsigned int flags)
+{
+	int res = tstbit(w, flags);
+
+	clrbit(w, flags);
+
+	return res;
+}
+
+#endif /* __LIB_BIT_H__ */

include/l4/lib/idpool.h

@@ -0,0 +1,15 @@
+#ifndef __IDPOOL_H__
+#define __IDPOOL_H__
+
+#include <l4/lib/bit.h>
+
+struct id_pool {
+	int nwords;
+	u32 bitmap[];
+};
+
+struct id_pool *id_pool_new_init(int mapsize);
+int id_new(struct id_pool *pool);
+int id_del(struct id_pool *pool, int id);
+
+#endif /* __IDPOOL_H__ */

include/l4/lib/list.h

@@ -0,0 +1,520 @@
+#ifndef __LIST_H__
+#define __LIST_H__
+/*
+ * LICENSE:
+ * Clever linked list implementation taken from Linux.
+ */
+
+/*
+ * These are non-NULL pointers that will result in page faults
+ * under normal circumstances, used to verify that nobody uses
+ * non-initialized list entries.
+ */
+#define LIST_POISON1  ((void *) 0xDEADBEE0)
+#define LIST_POISON2  ((void *) 0xDEADBEE4)
+
+/*
+ * Simple doubly linked list implementation.
+ *
+ * Some of the internal functions ("__xxx") are useful when
+ * manipulating whole lists rather than single entries, as
+ * sometimes we already know the next/prev entries and we can
+ * generate better code by using them directly rather than
+ * using the generic single-entry routines.
+ */
+
+struct list_head {
+	struct list_head *next;
+	struct list_head *prev;
+};
+
+#define LIST_HEAD_INIT(name) { &(name), &(name) }
+
+#define LIST_HEAD(name) \
+	struct list_head name = LIST_HEAD_INIT(name)
+
+static inline void INIT_LIST_HEAD(struct list_head *list)
+{
+	list->next = list;
+	list->prev = list;
+}
+
+/*
+ * Insert a new entry between two known consecutive entries.
+ *
+ * This is only for internal list manipulation where we know
+ * the prev/next entries already!
+ */
+static inline void __list_add(struct list_head *new,
+			      struct list_head *prev,
+			      struct list_head *next)
+{
+	next->prev = new;
+	new->next = next;
+	new->prev = prev;
+	prev->next = new;
+}
+
+/**
+ * list_add - add a new entry
+ * @new: new entry to be added
+ * @head: list head to add it after
+ *
+ * Insert a new entry after the specified head.
+ * This is good for implementing stacks.
+ */
+static inline void list_add(struct list_head *new, struct list_head *head)
+{
+	__list_add(new, head, head->next);
+}
+
+/**
+ * list_add_tail - add a new entry
+ * @new: new entry to be added
+ * @head: list head to add it before
+ *
+ * Insert a new entry before the specified head.
+ * This is useful for implementing queues.
+ */
+static inline void list_add_tail(struct list_head *new, struct list_head *head)
+{
+	__list_add(new, head->prev, head);
+}
+
+
+/*
+ * Delete a list entry by making the prev/next entries
+ * point to each other.
+ *
+ * This is only for internal list manipulation where we know
+ * the prev/next entries already!
+ */
+static inline void __list_del(struct list_head * prev, struct list_head * next)
+{
+	next->prev = prev;
+	prev->next = next;
+}
+
+/**
+ * list_del - deletes entry from list.
+ * @entry: the element to delete from the list.
+ * Note: list_empty on entry does not return true after this, the entry is
+ * in an undefined state.
+ */
+static inline void list_del(struct list_head *entry)
+{
+	__list_del(entry->prev, entry->next);
+	entry->next = LIST_POISON1;
+	entry->prev = LIST_POISON2;
+}
+
+/**
+ * list_del_init - deletes entry from list and reinitialize it.
+ * @entry: the element to delete from the list.
+ */
+static inline void list_del_init(struct list_head *entry)
+{
+	__list_del(entry->prev, entry->next);
+	INIT_LIST_HEAD(entry);
+}
+
+/**
+ * list_move - delete from one list and add as another's head
+ * @list: the entry to move
+ * @head: the head that will precede our entry
+ */
+static inline void list_move(struct list_head *list, struct list_head *head)
+{
+        __list_del(list->prev, list->next);
+        list_add(list, head);
+}
+
+/**
+ * list_move_tail - delete from one list and add as another's tail
+ * @list: the entry to move
+ * @head: the head that will follow our entry
+ */
+static inline void list_move_tail(struct list_head *list,
+				  struct list_head *head)
+{
+        __list_del(list->prev, list->next);
+        list_add_tail(list, head);
+}
+
+/**
+ * list_empty - tests whether a list is empty
+ * @head: the list to test.
+ */
+static inline int list_empty(const struct list_head *head)
+{
+	return head->next == head;
+}
+
+/**
+ * list_empty_careful - tests whether a list is
+ * empty _and_ checks that no other CPU might be
+ * in the process of still modifying either member
+ *
+ * NOTE: using list_empty_careful() without synchronization
+ * can only be safe if the only activity that can happen
+ * to the list entry is list_del_init(). Eg. it cannot be used
+ * if another CPU could re-list_add() it.
+ *
+ * @head: the list to test.
+ */
+static inline int list_empty_careful(const struct list_head *head)
+{
+	struct list_head *next = head->next;
+	return (next == head) && (next == head->prev);
+}
+
+static inline void __list_splice(struct list_head *list,
+				 struct list_head *head)
+{
+	struct list_head *first = list->next;
+	struct list_head *last = list->prev;
+	struct list_head *at = head->next;
+
+	first->prev = head;
+	head->next = first;
+
+	last->next = at;
+	at->prev = last;
+}
+
+/**
+ * list_splice - join two lists
+ * @list: the new list to add.
+ * @head: the place to add it in the first list.
+ */
+static inline void list_splice(struct list_head *list, struct list_head *head)
+{
+	if (!list_empty(list))
+		__list_splice(list, head);
+}
+
+/**
+ * list_splice_init - join two lists and reinitialise the emptied list.
+ * @list: the new list to add.
+ * @head: the place to add it in the first list.
+ *
+ * The list at @list is reinitialised
+ */
+static inline void list_splice_init(struct list_head *list,
+				    struct list_head *head)
+{
+	if (!list_empty(list)) {
+		__list_splice(list, head);
+		INIT_LIST_HEAD(list);
+	}
+}
+
+/**
+ * list_entry - get the struct for this entry
+ * @ptr:	the &struct list_head pointer.
+ * @type:	the type of the struct this is embedded in.
+ * @member:	the name of the list_struct within the struct.
+ */
+#define list_entry(ptr, type, member) \
+	container_of(ptr, type, member)
+
+/**
+ * list_for_each	-	iterate over a list
+ * @pos:	the &struct list_head to use as a loop counter.
+ * @head:	the head for your list.
+ */
+#define list_for_each(pos, head) \
+	for (pos = (head)->next; /* prefetch(pos->next), */ pos != (head); \
+        	pos = pos->next)
+
+/**
+ * __list_for_each	-	iterate over a list
+ * @pos:	the &struct list_head to use as a loop counter.
+ * @head:	the head for your list.
+ *
+ * This variant differs from list_for_each() in that it's the
+ * simplest possible list iteration code, no prefetching is done.
+ * Use this for code that knows the list to be very short (empty
+ * or 1 entry) most of the time.
+ */
+#define __list_for_each(pos, head) \
+	for (pos = (head)->next; pos != (head); pos = pos->next)
+
+/**
+ * list_for_each_prev	-	iterate over a list backwards
+ * @pos:	the &struct list_head to use as a loop counter.
+ * @head:	the head for your list.
+ */
+#define list_for_each_prev(pos, head) \
+	for (pos = (head)->prev; prefetch(pos->prev), pos != (head); \
+        	pos = pos->prev)
+
+/**
+ * list_for_each_safe	-	iterate over a list safe against removal of list entry
+ * @pos:	the &struct list_head to use as a loop counter.
+ * @n:		another &struct list_head to use as temporary storage
+ * @head:	the head for your list.
+ */
+#define list_for_each_safe(pos, n, head) \
+	for (pos = (head)->next, n = pos->next; pos != (head); \
+		pos = n, n = pos->next)
+
+/**
+ * list_for_each_entry	-	iterate over list of given type
+ * @pos:	the type * to use as a loop counter.
+ * @head:	the head for your list.
+ * @member:	the name of the list_struct within the struct.
+ */
+#define list_for_each_entry(pos, head, member)				\
+	for (pos = list_entry((head)->next, typeof(*pos), member);	\
+	     /* prefetch(pos->member.next), */ &pos->member != (head); 	\
+	     pos = list_entry(pos->member.next, typeof(*pos), member))
+
+/**
+ * list_for_each_entry_reverse - iterate backwards over list of given type.
+ * @pos:	the type * to use as a loop counter.
+ * @head:	the head for your list.
+ * @member:	the name of the list_struct within the struct.
+ */
+#define list_for_each_entry_reverse(pos, head, member)			\
+	for (pos = list_entry((head)->prev, typeof(*pos), member);	\
+	     prefetch(pos->member.prev), &pos->member != (head); 	\
+	     pos = list_entry(pos->member.prev, typeof(*pos), member))
+
+/**
+ * list_prepare_entry - prepare a pos entry for use as a start point in
+ *			list_for_each_entry_continue
+ * @pos:	the type * to use as a start point
+ * @head:	the head of the list
+ * @member:	the name of the list_struct within the struct.
+ */
+#define list_prepare_entry(pos, head, member) \
+	((pos) ? : list_entry(head, typeof(*pos), member))
+
+/**
+ * list_for_each_entry_continue -	iterate over list of given type
+ *			continuing after existing point
+ * @pos:	the type * to use as a loop counter.
+ * @head:	the head for your list.
+ * @member:	the name of the list_struct within the struct.
+ */
+#define list_for_each_entry_continue(pos, head, member) 		\
+	for (pos = list_entry(pos->member.next, typeof(*pos), member);	\
+	     prefetch(pos->member.next), &pos->member != (head);	\
+	     pos = list_entry(pos->member.next, typeof(*pos), member))
+
+/**
+ * list_for_each_entry_from -	iterate over list of given type
+ *			continuing from existing point
+ * @pos:	the type * to use as a loop counter.
+ * @head:	the head for your list.
+ * @member:	the name of the list_struct within the struct.
+ */
+#define list_for_each_entry_from(pos, head, member) 			\
+	for (; prefetch(pos->member.next), &pos->member != (head);	\
+	     pos = list_entry(pos->member.next, typeof(*pos), member))
+
+/**
+ * list_for_each_entry_safe - iterate over list of given type safe against removal of list entry
+ * @pos:	the type * to use as a loop counter.
+ * @n:		another type * to use as temporary storage
+ * @head:	the head for your list.
+ * @member:	the name of the list_struct within the struct.
+ */
+#define list_for_each_entry_safe(pos, n, head, member)			\
+	for (pos = list_entry((head)->next, typeof(*pos), member),	\
+		n = list_entry(pos->member.next, typeof(*pos), member);	\
+	     &pos->member != (head); 					\
+	     pos = n, n = list_entry(n->member.next, typeof(*n), member))
+
+/**
+ * list_for_each_entry_safe_continue -	iterate over list of given type
+ *			continuing after existing point safe against removal of list entry
+ * @pos:	the type * to use as a loop counter.
+ * @n:		another type * to use as temporary storage
+ * @head:	the head for your list.
+ * @member:	the name of the list_struct within the struct.
+ */
+#define list_for_each_entry_safe_continue(pos, n, head, member) 		\
+	for (pos = list_entry(pos->member.next, typeof(*pos), member), 		\
+		n = list_entry(pos->member.next, typeof(*pos), member);		\
+	     &pos->member != (head);						\
+	     pos = n, n = list_entry(n->member.next, typeof(*n), member))
+
+/**
+ * list_for_each_entry_safe_from - iterate over list of given type
+ *			from existing point safe against removal of list entry
+ * @pos:	the type * to use as a loop counter.
+ * @n:		another type * to use as temporary storage
+ * @head:	the head for your list.
+ * @member:	the name of the list_struct within the struct.
+ */
+#define list_for_each_entry_safe_from(pos, n, head, member) 			\
+	for (n = list_entry(pos->member.next, typeof(*pos), member);		\
+	     &pos->member != (head);						\
+	     pos = n, n = list_entry(n->member.next, typeof(*n), member))
+
+/**
+ * list_for_each_entry_safe_reverse - iterate backwards over list of given type safe against
+ *				      removal of list entry
+ * @pos:	the type * to use as a loop counter.
+ * @n:		another type * to use as temporary storage
+ * @head:	the head for your list.
+ * @member:	the name of the list_struct within the struct.
+ */
+#define list_for_each_entry_safe_reverse(pos, n, head, member)		\
+	for (pos = list_entry((head)->prev, typeof(*pos), member),	\
+		n = list_entry(pos->member.prev, typeof(*pos), member);	\
+	     &pos->member != (head); 					\
+	     pos = n, n = list_entry(n->member.prev, typeof(*n), member))
+
+/*
+ * Double linked lists with a single pointer list head.
+ * Mostly useful for hash tables where the two pointer list head is
+ * too wasteful.
+ * You lose the ability to access the tail in O(1).
+ */
+
+struct hlist_head {
+	struct hlist_node *first;
+};
+
+struct hlist_node {
+	struct hlist_node *next, **pprev;
+};
+
+#define HLIST_HEAD_INIT { .first = 0 }
+#define HLIST_HEAD(name) struct hlist_head name = {  .first = 0 }
+#define INIT_HLIST_HEAD(ptr) ((ptr)->first = 0)
+static inline void INIT_HLIST_NODE(struct hlist_node *h)
+{
+	h->next = 0;
+	h->pprev = 0;
+}
+
+static inline int hlist_unhashed(const struct hlist_node *h)
+{
+	return !h->pprev;
+}
+
+static inline int hlist_empty(const struct hlist_head *h)
+{
+	return !h->first;
+}
+
+static inline void __hlist_del(struct hlist_node *n)
+{
+	struct hlist_node *next = n->next;
+	struct hlist_node **pprev = n->pprev;
+	*pprev = next;
+	if (next)
+		next->pprev = pprev;
+}
+
+static inline void hlist_del(struct hlist_node *n)
+{
+	__hlist_del(n);
+	n->next = LIST_POISON1;
+	n->pprev = LIST_POISON2;
+}
+
+static inline void hlist_del_init(struct hlist_node *n)
+{
+	if (!hlist_unhashed(n)) {
+		__hlist_del(n);
+		INIT_HLIST_NODE(n);
+	}
+}
+
+static inline void hlist_add_head(struct hlist_node *n, struct hlist_head *h)
+{
+	struct hlist_node *first = h->first;
+	n->next = first;
+	if (first)
+		first->pprev = &n->next;
+	h->first = n;
+	n->pprev = &h->first;
+}
+
+
+/* next must be != NULL */
+static inline void hlist_add_before(struct hlist_node *n,
+					struct hlist_node *next)
+{
+	n->pprev = next->pprev;
+	n->next = next;
+	next->pprev = &n->next;
+	*(n->pprev) = n;
+}
+
+static inline void hlist_add_after(struct hlist_node *n,
+					struct hlist_node *next)
+{
+	next->next = n->next;
+	n->next = next;
+	next->pprev = &n->next;
+
+	if(next->next)
+		next->next->pprev  = &next->next;
+}
+
+#define hlist_entry(ptr, type, member) container_of(ptr,type,member)
+
+#define hlist_for_each(pos, head) \
+	for (pos = (head)->first; pos && ({ prefetch(pos->next); 1; }); \
+	     pos = pos->next)
+
+#define hlist_for_each_safe(pos, n, head) \
+	for (pos = (head)->first; pos && ({ n = pos->next; 1; }); \
+	     pos = n)
+
+/**
+ * hlist_for_each_entry	- iterate over list of given type
+ * @tpos:	the type * to use as a loop counter.
+ * @pos:	the &struct hlist_node to use as a loop counter.
+ * @head:	the head for your list.
+ * @member:	the name of the hlist_node within the struct.
+ */
+#define hlist_for_each_entry(tpos, pos, head, member)			     \
+	for (pos = (head)->first;					     \
+	     pos && ({ tpos = hlist_entry(pos, typeof(*tpos), member); 1;}); \
+	     pos = pos->next)
+
+/**
+ * hlist_for_each_entry_continue - iterate over a hlist continuing after existing point
+ * @tpos:	the type * to use as a loop counter.
+ * @pos:	the &struct hlist_node to use as a loop counter.
+ * @member:	the name of the hlist_node within the struct.
+ */
+#define hlist_for_each_entry_continue(tpos, pos, member)		 \
+	for (pos = (pos)->next;						 \
+	     pos && ({ prefetch(pos->next); 1;}) &&			 \
+		({ tpos = hlist_entry(pos, typeof(*tpos), member); 1;}); \
+	     pos = pos->next)
+
+/**
+ * hlist_for_each_entry_from - iterate over a hlist continuing from existing point
+ * @tpos:	the type * to use as a loop counter.
+ * @pos:	the &struct hlist_node to use as a loop counter.
+ * @member:	the name of the hlist_node within the struct.
+ */
+#define hlist_for_each_entry_from(tpos, pos, member)			 \
+	for (; pos && ({ prefetch(pos->next); 1;}) &&			 \
+		({ tpos = hlist_entry(pos, typeof(*tpos), member); 1;}); \
+	     pos = pos->next)
+
+/**
+ * hlist_for_each_entry_safe - iterate over list of given type safe against removal of list entry
+ * @tpos:	the type * to use as a loop counter.
+ * @pos:	the &struct hlist_node to use as a loop counter.
+ * @n:		another &struct hlist_node to use as temporary storage
+ * @head:	the head for your list.
+ * @member:	the name of the hlist_node within the struct.
+ */
+#define hlist_for_each_entry_safe(tpos, pos, n, head, member) 		 \
+	for (pos = (head)->first;					 \
+	     pos && ({ n = pos->next; 1; }) && 				 \
+		({ tpos = hlist_entry(pos, typeof(*tpos), member); 1;}); \
+	     pos = n)
+
+#endif /* __LIST_H__ */

include/l4/lib/math.h

@@ -0,0 +1,6 @@
+#ifndef __LIB_MATH_H__
+#define __LIB_MATH_H__
+
+#define min(x, y)		(((x) < (y)) ? x : y)
+
+#endif /* __LIB_MATH_H__ */

include/l4/lib/memcache.h

@@ -0,0 +1,54 @@
+/*
+ * Bitmap-based link-listable fixed-size memory cache.
+ *
+ * Copyright (C) 2007 Bahadir Balban
+ */
+
+#ifndef __MEMCACHE_H__
+#define __MEMCACHE_H__
+
+#include <l4/config.h>
+#include <l4/macros.h>
+#include <l4/types.h>
+#include <l4/lib/list.h>
+#include <l4/lib/mutex.h>
+
+/*
+ * Very basic cache structure. All it does is, keep an internal bitmap of
+ * items of struct_size. (Note bitmap is fairly efficient and simple for a
+ * fixed-size memory cache) Keeps track of free/occupied items within its
+ * start/end boundaries. Does not grow/shrink but you can link-list it.
+ */
+struct mem_cache {
+	struct list_head list;
+	struct mutex mutex;
+	int total;
+	int free;
+	unsigned int start;
+	unsigned int end;
+	unsigned int struct_size;
+	unsigned int *bitmap;
+};
+
+void *mem_cache_zalloc(struct mem_cache *cache);
+void *mem_cache_alloc(struct mem_cache *cache);
+int mem_cache_free(struct mem_cache *cache, void *addr);
+struct mem_cache *mem_cache_init(void *start, int cache_size,
+				 int struct_size, unsigned int alignment);
+static inline int mem_cache_is_full(struct mem_cache *cache)
+{
+	return cache->free == 0;
+}
+static inline int mem_cache_is_empty(struct mem_cache *cache)
+{
+	return cache->free == cache->total;
+}
+static inline int mem_cache_is_last_free(struct mem_cache *cache)
+{
+	return cache->free == 1;
+}
+static inline int mem_cache_total_empty(struct mem_cache *cache)
+{
+	return cache->free;
+}
+#endif /* __MEMCACHE_H__ */

include/l4/lib/mutex.h

@@ -0,0 +1,45 @@
+/*
+ * The elementary concurrency constructs.
+ *
+ * Copyright (C) 2007 Bahadir Balban
+ */
+
+#ifndef __LIB_MUTEX_H__
+#define __LIB_MUTEX_H__
+
+#include <l4/lib/string.h>
+#include <l4/lib/spinlock.h>
+#include <l4/lib/list.h>
+#include <l4/lib/printk.h>
+#include <l4/lib/wait.h>
+#include INC_ARCH(mutex.h)
+
+/* A mutex is a binary semaphore that can sleep. */
+struct mutex {
+	int sleepers;			/* Number of sleepers */
+	struct spinlock slock;		/* Locks sleeper queue */
+	unsigned int lock;		/* The mutex lock itself */
+	struct waitqueue wq;		/* Sleeper queue head */
+};
+
+static inline void mutex_init(struct mutex *mutex)
+{
+	memset(mutex, 0, sizeof(struct mutex));
+	INIT_LIST_HEAD(&mutex->wq.task_list);
+}
+
+void mutex_lock(struct mutex *mutex);
+void mutex_unlock(struct mutex *mutex);
+
+/* NOTE: Since spinlocks guard mutex acquiring & sleeping, no locks needed */
+static inline int mutex_inc(unsigned int *cnt)
+{
+	return ++*cnt;
+}
+
+static inline int mutex_dec(unsigned int *cnt)
+{
+	return --*cnt;
+}
+
+#endif /* __LIB_MUTEX_H__ */

include/l4/lib/printk.h

@@ -0,0 +1,18 @@
+
+#ifndef __PRINTK_H__
+#define __PRINTK_H__
+
+#include <stdarg.h>
+
+#if defined(ARCH_TEST)
+/* For host tests all printks mean printf using the host C library */
+#include <stdio.h>
+#define printk		printf
+#elif !defined(__KERNEL__)
+#define	printk 		printf
+#else
+int printk(char *format, ...) __attribute__((format (printf, 1, 2)));
+extern void putc(char c);
+#endif
+
+#endif /* __PRINTK_H__ */

include/l4/lib/spinlock.h

@@ -0,0 +1,57 @@
+#ifndef __LIB_SPINLOCK_H__
+#define __LIB_SPINLOCK_H__
+
+#include <l4/lib/string.h>
+#include <l4/generic/preempt.h>
+#include INC_ARCH(exception.h)
+
+struct spinlock {
+	unsigned int lock;
+};
+
+static inline void spin_lock_init(struct spinlock *s)
+{
+	memset(s, 0, sizeof(struct spinlock));
+}
+
+/*
+ * - Guards from deadlock against local processes, but not local irqs.
+ * - To be used for synchronising against processes on *other* cpus.
+ */
+static inline void spin_lock(struct spinlock *s)
+{
+	preempt_disable();
+#if defined(CONFIG_SMP)
+	__spin_lock(&s->lock);
+#endif
+}
+
+static inline void spin_unlock(struct spinlock *s)
+{
+#if defined(CONFIG_SMP)
+	__spin_unlock(&s->lock);
+#endif
+	preempt_enable();
+}
+
+/*
+ * - Guards from deadlock against local processes *and* local irqs.
+ * - To be used for synchronising against processes and irqs
+ *   on other cpus.
+ */
+static inline void spin_lock_irq(struct spinlock *s)
+{
+	irq_local_disable();	/* Even in UP an irq could deadlock us */
+#if defined(CONFIG_SMP)
+	__spin_lock(&s->lock);
+#endif
+}
+
+static inline void spin_unlock_irq(struct spinlock *s)
+{
+#if defined(CONFIG_SMP)
+	__spin_unlock(&s->lock);
+#endif
+	irq_local_enable();
+}
+#endif /* __LIB__SPINLOCK_H__ */

include/l4/lib/string.h

@@ -0,0 +1,9 @@
+#ifndef __LIB_STRING_H__
+#define __LIB_STRING_H__
+
+char *strncpy(char *dest, const char *src, int count);
+int strcmp(const char *s1, const char *s2);
+void *memset(void *p, int c, int size);
+void *memcpy(void *d, void *s, int size);
+
+#endif /* __LIB_STRING_H__ */

include/l4/lib/wait.h

@@ -0,0 +1,45 @@
+#ifndef __LIB_WAIT_H__
+#define __LIB_WAIT_H__
+
+#include <l4/lib/list.h>
+#include <l4/lib/spinlock.h>
+
+struct ktcb;
+struct waitqueue {
+	struct list_head task_list;
+	struct ktcb *task;
+};
+
+#define DECLARE_WAITQUEUE(wq, tsk)			\
+struct waitqueue wq = {					\
+	.task_list = { &wq.task_list, &wq.task_list },	\
+	.task = tsk,					\
+};
+//	LIST_HEAD_INIT(task_list),
+
+/*
+ * The waitqueue spinlock ensures waiters are added and removed atomically so
+ * that wake-ups and sleeps occur in sync. Otherwise, a task could try to wake
+ * up a waitqueue **during when a task has decided to sleep but is not in the
+ * queue yet. (** Take "during" here as a pseudo-concurrency term on UP)
+ */
+struct waitqueue_head {
+	int sleepers;
+	struct spinlock slock;		/* Locks sleeper queue */
+	struct list_head task_list;	/* Sleeper queue head */
+};
+
+static inline void waitqueue_head_init(struct waitqueue_head *head)
+{
+	memset(head, 0, sizeof(struct waitqueue_head));
+	INIT_LIST_HEAD(&head->task_list);
+}
+
+/*
+ * Used for ipc related waitqueues who have special wait queue manipulation
+ * conditions.
+ */
+void wake_up(struct waitqueue_head *wqh);
+
+#endif /* __LIB_WAIT_H__ */
+