From cd481a01174468188d23b9d544cb738471c7fb52 Mon Sep 17 00:00:00 2001
From: cos <cos>
Date: Sun, 19 May 2013 16:11:32 +0200
Subject: Obsoleted branch.

Please look at cr/implement_gnumber_hack instead.
---
 src/linkedlist.c | 204 -------------------------------------------------------
 1 file changed, 204 deletions(-)
 delete mode 100644 src/linkedlist.c

(limited to 'src/linkedlist.c')

diff --git a/src/linkedlist.c b/src/linkedlist.c
deleted file mode 100644
index ae3d143..0000000
--- a/src/linkedlist.c
+++ /dev/null
@@ -1,204 +0,0 @@
-/* This file was taken from the Linux kernel and is
- * Copyright (C) 2003 Linus Torvalds
- *
- * Modified by Shawn Betts. Portions created by Shawn Betts are
- * Copyright (C) 2003, 2004 Shawn Betts
- *
- * This file is part of ratpoison.
- *
- * ratpoison is free software; you can redistribute it and/or modify
- * it under the terms of the GNU General Public License as published by
- * the Free Software Foundation; either version 2, or (at your option)
- * any later version.
- *
- * ratpoison is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
- * GNU General Public License for more details.
- *
- * You should have received a copy of the GNU General Public License
- * along with this software; see the file COPYING.  If not, write to
- * the Free Software Foundation, Inc., 59 Temple Place, Suite 330,
- * Boston, MA 02111-1307 USA
- */
-
-#include "linkedlist.h"
-
-#if __GNUC__ <= 3
-void
-prefetch(const void *x)
-{;}
-#endif
-
-/*
- * Insert a new entry between two known consecutive entries.
- *
- * This is only for internal list manipulation where we know
- * the prev/next entries already!
- */
-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.
- */
-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.
- */
-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!
- */
-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.
- */
-void
-list_del(struct list_head *entry)
-{
-  __list_del(entry->prev, entry->next);
-}
-
-/**
- * list_del_init - deletes entry from list and reinitialize it.
- * @entry: the element to delete from the list.
- */
-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
- */
-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
- */
-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.
- */
-int
-list_empty(struct list_head *head)
-{
-  return head->next == head;
-}
-
-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.
- */
-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
- */
-void
-list_splice_init(struct list_head *list,
-                 struct list_head *head)
-{
-  if (!list_empty(list)) {
-    __list_splice(list, head);
-    INIT_LIST_HEAD(list);
-  }
-}
-
-int
-list_size (struct list_head *list)
-{
-  struct list_head *cur;
-
-  int i = 0;
-  list_for_each (cur, list)
-    i++;
-
-  return i;
-}
-- 
cgit v1.2.3