Return-Path: Received: (majordomo@vger.kernel.org) by vger.kernel.org via listexpand id ; Wed, 25 Sep 2002 16:50:21 -0400 Received: (majordomo@vger.kernel.org) by vger.kernel.org id ; Wed, 25 Sep 2002 16:50:21 -0400 Received: from pD9E23B17.dip.t-dialin.net ([217.226.59.23]:22498 "EHLO hawkeye.luckynet.adm") by vger.kernel.org with ESMTP id ; Wed, 25 Sep 2002 16:50:19 -0400 From: Lightweight Patch Manager To: Linux Kernel Mailing List Cc: Tomas Szepe , Ingo Molnar Subject: [PATCH][2.5] Single linked lists for Linux X-Mailer: Lightweight Patch Manager Message-ID: <20020925205608.1BD86F@hawkeye.luckynet.adm> MIME-Version: 1.0 User-Agent: Lightweight Patch Manager/1.04 Date: Wed, 25 Sep 2002 20:56:08 +0000 X-Priority: I really don't care. Content-Type: text/plain; charset=US-ASCII Organization: Lightweight Networking Content-Transfer-Encoding: 7BIT Sender: linux-kernel-owner@vger.kernel.org X-Mailing-List: linux-kernel@vger.kernel.org Content-Length: 3209 Lines: 120 This introduces single linked lists, as figured out by us four. Works fine with userspace test applications, should work fine with e.g. the scheduler. Breaks nothing. Must get adopted. --- /dev/null Wed Dec 31 17:00:00 1969 +++ slist-2.5/include/linux/slist.h Wed Sep 25 14:49:24 2002 @@ -0,0 +1,103 @@ +#ifdef __KERNEL__ +#ifndef _LINUX_SLIST_H +#define _LINUX_SLIST_H + +#include + +/* + * Type-safe single linked list helper-functions. + * (originally taken from list.h) + * + * Thomas 'Dent' Mirlacher, Daniel Phillips, Andreas Borgk, + * Thunder from the hill + */ + +/** + * slist_add_front - add a new entry at the first slot, moving the old head + * to the second slot + * @new: new entry to be added + * @head: head of the single linked list + * + * Insert a new entry before the specified head. + * This is good for implementing stacks. + */ + +#define slist_add_front(_new, _head) \ +do { \ + (_new)->next = (_head); \ + (_head) = (_new); \ +} while (0) + + + +/** + * slist_add - add a new entry + * @new: new entry to be added + * @head: head of the single linked list + * + * Insert a new entry before the specified head. + * This is good for implementing stacks. + * + * Careful: if you do this concurrently, _head + * might get into nirvana... + */ +#define slist_add(_new, _head) \ +do { \ + (_new)->next = (_head)->next; \ + (_head)->next = (_new); \ + (_new) = (_head); \ +} while (0) + +/** + * slist_del - remove an entry from list + * @head: head to remove it from + * @entry: entry to be removed + */ +#define slist_del(_head, _entry) \ +do { \ + (_head)->next = (_entry)->next; \ + (_entry)->next = NULL; \ +} + +/** + * slist_del_single - untag a list from an entry + * @list: list entry to be untagged + */ +#define slist_del_single(_list) \ + (_list)->next = NULL + +/** + * slist_pop - pop out list entry + * @list: entry to be popped out + * + * Pop out an entry from a list. + */ +#define slist_pop(_list) ({ \ + typeof(_list) _NODE_ = _list; \ + if (_list) { \ + (_list) = (_list)->next; \ + _NODE_->next = NULL; \ + } \ + _NODE_; }) + +/** + * slist_for_each - iterate over a list + * @pos: the pointer to use as a loop counter. + * @head: the head for your list (this is also the first entry). + */ +#define slist_for_each(pos, head) \ + for (pos = head; pos && ({ prefetch(pos->next); 1; }); \ + pos = pos->next) + +/** + * slist_for_each_del - iterate over a list, popping off entries + * @pos: the pointer to use as a loop counter. + * @head: the head for your list (this is also the first entry). + */ +#define slist_for_each_del(pos, head) \ + for (pos = slist_pop(head); pos && \ + ({ prefetch(pos->next); 1; }); \ + pos = slist_pop(head)) + +#endif /* _LINUX_SLIST_H */ +#endif /* __KERNEL__ */ -- Lightweight Patch Manager, without pine. If you have any objections (apart from who I am), tell me - To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/