aboutsummaryrefslogtreecommitdiffstats
path: root/include/cutils
diff options
context:
space:
mode:
authorDima Zavin <dima@android.com>2011-09-01 17:09:44 -0700
committerDima Zavin <dima@android.com>2011-09-02 12:11:18 -0700
commitda04c52ab1036048520fca265cf02b61dca789e0 (patch)
tree93ffef38f15b4f38845cff1446d749a2ca9faa65 /include/cutils
parent8f91282ebe1963b9d27f8779ad1342302b293bd2 (diff)
downloadsystem_core-da04c52ab1036048520fca265cf02b61dca789e0.tar.gz
system_core-da04c52ab1036048520fca265cf02b61dca789e0.tar.bz2
system_core-da04c52ab1036048520fca265cf02b61dca789e0.zip
init/cutils: move list utility code to cutils from init
Change-Id: I357ceee813700297d8343159f22a07659e768d41 Signed-off-by: Dima Zavin <dima@android.com>
Diffstat (limited to 'include/cutils')
-rw-r--r--include/cutils/list.h51
1 files changed, 51 insertions, 0 deletions
diff --git a/include/cutils/list.h b/include/cutils/list.h
new file mode 100644
index 00000000..eb5a3c84
--- /dev/null
+++ b/include/cutils/list.h
@@ -0,0 +1,51 @@
+/*
+ * Copyright (C) 2010 The Android Open Source Project
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ * http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#ifndef _CUTILS_LIST_H_
+#define _CUTILS_LIST_H_
+
+#include <stddef.h>
+
+struct listnode
+{
+ struct listnode *next;
+ struct listnode *prev;
+};
+
+#define node_to_item(node, container, member) \
+ (container *) (((char*) (node)) - offsetof(container, member))
+
+#define list_declare(name) \
+ struct listnode name = { \
+ .next = &name, \
+ .prev = &name, \
+ }
+
+#define list_for_each(node, list) \
+ for (node = (list)->next; node != (list); node = node->next)
+
+#define list_for_each_reverse(node, list) \
+ for (node = (list)->prev; node != (list); node = node->prev)
+
+void list_init(struct listnode *list);
+void list_add_tail(struct listnode *list, struct listnode *item);
+void list_remove(struct listnode *item);
+
+#define list_empty(list) ((list) == (list)->next)
+#define list_head(list) ((list)->next)
+#define list_tail(list) ((list)->prev)
+
+#endif