nlm_list.h

Go to the documentation of this file.

/*
 * Copyright IBM Corporation, 2010
 *  Contributor: Aneesh Kumar K.v  <aneesh.kumar@linux.vnet.ibm.com>
 *
 *
 * This software is a server that implements the NFS protocol.
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
 * version 3 of the License, or (at your option) any later version.
 *
 * This program 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
 * Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
 * License along with this library; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
 *
 * ---------------------------------------
 *
 *
 */

#ifndef _NLM_LIST_H
#define _NLM_LIST_H

#include <stddef.h>

struct glist_head
{
  struct glist_head *next;
  struct glist_head *prev;
};

#define GLIST_HEAD_INIT(name) { &(name), &(name) }

#define GLIST_HEAD(name) \
        struct glist_head name = GLIST_HEAD_INIT(name)

/*FIXME!!! grand hack due to mysql conflict name glist*/

static inline void init_glist(struct glist_head *head) /* XXX glist_init? */
{
  head->next = head;
  head->prev = head;
}

/* Add the new element between left and right */
static inline void __glist_add(struct glist_head *left, struct glist_head *right,
                               struct glist_head *new)
{
  new->prev = left;
  new->next = right;
  left->next = new;
  right->prev = new;
}

static inline void glist_add_tail(struct glist_head *head, struct glist_head *new)
{

  __glist_add(head->prev, head, new);
}

/* add after the specified entry*/
static inline void glist_add(struct glist_head *head, struct glist_head *new)
{
  __glist_add(head, head->next, new);
}

static inline void glist_del(struct glist_head *node)
{
  struct glist_head *left = node->prev;
  struct glist_head *right = node->next;
  if(left != NULL)
    left->next = right;
  if(right != NULL)
    right->prev = left;
  node->next = NULL;
  node->prev = NULL;
}

static inline int glist_empty(struct glist_head *head)
{
  return head->next == head;
}

static inline void glist_add_list_tail(struct glist_head *list, struct glist_head *new)
{
  struct glist_head *first = new->next;
  struct glist_head *last = new->prev;

  if(glist_empty(new))
    {
      /* nothing to add */
      return;
    }

  first->prev = list->prev;
  list->prev->next = first;

  last->next = list;
  list->prev = last;
}

#define glist_for_each(node, head) \
        for(node = (head)->next; node != head; node = node->next)

#define container_of(addr, type, member) ({                     \
        const typeof( ((type *)0)->member ) *__mptr = (addr);   \
        (type *)( (char *)__mptr - offsetof(type,member) );})

#define glist_first_entry(head, type, member) \
        ((head)->next != (head) ? \
          container_of((head)->next, type, member) : NULL)

#define glist_entry(node, type, member) \
        container_of(node, type, member)

#define glist_for_each_safe(node, noden, head)                      \
  for (node = (head)->next, noden = node->next; node != (head);     \
       node = noden, noden = node->next)

#endif                          /* _NLM_LIST_H */