x15/kern/hlist.h

/*
 * Copyright (c) 2017 Richard Braun.
 *
 * This program 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 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 General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program.  If not, see <http://www.gnu.org/licenses/>.
 *
 * Upstream site with license notes :
 * http://git.sceen.net/rbraun/librbraun.git/
 *
 *
 * Doubly-linked list specialized for forward traversals and O(1) removals.
 */

#ifndef KERN_HLIST_H
#define KERN_HLIST_H

#include <stdbool.h>
#include <stddef.h>

#include <kern/hlist_types.h>
#include <kern/macros.h>
#include <kern/rcu.h>

struct hlist;

struct hlist_node;

// Static list initializer.
#define HLIST_INITIALIZER(list)   { NULL }

// Initialize a list.
static inline void
hlist_init (struct hlist *list)
{
  list->first = NULL;
}

/*
 * Initialize a list node.
 *
 * A node is in no list when its pprev member points to NULL.
 */
static inline void
hlist_node_init (struct hlist_node *node)
{
  node->pprev = NULL;
}

// Return true if node is in no list.
static inline bool
hlist_node_unlinked (const struct hlist_node *node)
{
  return (!node->pprev);
}

// Return the first node of a list.
static inline struct hlist_node*
hlist_first (const struct hlist *list)
{
  return (list->first);
}

// Return the node next to the given node.
static inline struct hlist_node*
hlist_next (const struct hlist_node *node)
{
  return (node->next);
}

// Return true if node is invalid and denotes the end of the list.
static inline bool
hlist_end (const struct hlist_node *node)
{
  return (!node);
}

// Return true if list is empty.
static inline bool
hlist_empty (const struct hlist *list)
{
  return (!list->first);
}

/*
 * Return true if list contains exactly one node.
 */
static inline bool
hlist_singular (const struct hlist *list)
{
  return (!hlist_empty (list) && hlist_end (list->first->next));
}

/*
 * Set the new head of a list.
 *
 * After completion, old_head is stale.
 */
static inline void
hlist_set_head (struct hlist *new_head, const struct hlist *old_head)
{
  *new_head = *old_head;

  if (!hlist_empty (new_head))
    new_head->first->pprev = &new_head->first;
}

// Insert a node at the head of a list.
static inline void
hlist_insert_head (struct hlist *list, struct hlist_node *node)
{
  struct hlist_node *first = list->first;
  node->next = first;
  node->pprev = &list->first;

  if (first != NULL)
    first->pprev = &node->next;

  list->first = node;
}

// Insert a node before another node.
static inline void
hlist_insert_before (struct hlist_node *node, struct hlist_node *next)
{
  node->next = next;
  node->pprev = next->pprev;
  next->pprev = &node->next;
  *node->pprev = node;
}

// Insert a node after another node.
static inline void
hlist_insert_after (struct hlist_node *node, struct hlist_node *prev)
{
  node->next = prev->next;
  node->pprev = &prev->next;

  if (node->next != NULL)
    node->next->pprev = &node->next;

  prev->next = node;
}

// Remove a node from a list.
static inline void
hlist_remove (struct hlist_node *node)
{
  if (node->next != NULL)
    node->next->pprev = node->pprev;

  *node->pprev = node->next;
}

/*
 * Macro that evaluates to the address of the structure containing the
 * given node based on the given type and member.
 */
#define hlist_entry(node, type, member)   structof (node, type, member)

// Get the first entry of a list.
#define hlist_first_entry(list, type, member)   \
MACRO_BEGIN   \
  struct hlist_node *first_ = (list)->first;   \
  hlist_end (first_) ? NULL : hlist_entry (first_, type, member);   \
MACRO_END

// Get the entry next to the given entry.
#define hlist_next_entry(entry, member)   \
MACRO_BEGIN   \
  struct hlist_node *next_ = (entry)->member.next;   \
  hlist_end (next_) ? NULL : hlist_entry (next_, typeof (*entry), member);   \
MACRO_END

/*
 * Forge a loop to process all nodes of a list.
 *
 * The node must not be altered during the loop.
 */
#define hlist_for_each(list, node)   \
  for (struct hlist_node *node = hlist_first (list);   \
       !hlist_end (node);   \
       node = hlist_next (node))

// Forge a loop to process all nodes of a list.
#define hlist_for_each_safe(list, node, tmp)   \
  for (struct hlist_node *node = hlist_first (list),   \
       *tmp = hlist_end (node) ? NULL : hlist_next (node);   \
       !hlist_end (node);   \
       node = tmp,   \
       tmp = hlist_end (node) ? NULL : hlist_next (node))

/*
 * Forge a loop to process all entries of a list.
 *
 * The entry node must not be altered during the loop.
 */
#define hlist_for_each_entry(list, entry, member)   \
  for (entry = hlist_first_entry (list, typeof (*entry), member);   \
       entry;   \
       entry = hlist_next_entry (entry, member))

// Forge a loop to process all entries of a list.
#define hlist_for_each_entry_safe(list, entry, tmp, member)   \
  for (entry = hlist_first_entry (list, typeof (*entry), member),   \
       tmp = entry ? hlist_next_entry (entry, member) : NULL;   \
       entry;   \
       entry = tmp,   \
       tmp = entry ? hlist_next_entry (entry, member) : NULL)   \

/*
 * Lockless variants
 *
 * The hlist_end() function may be used from read-side critical sections.
 */

// Return the first node of a list.
static inline struct hlist_node*
hlist_rcu_first (const struct hlist *list)
{
  return (rcu_load (&list->first));
}

// Return the node next to the given node.
static inline struct hlist_node*
hlist_rcu_next (const struct hlist_node *node)
{
  return (rcu_load (&node->next));
}

// Insert a node at the head of a list.
static inline void
hlist_rcu_insert_head (struct hlist *list, struct hlist_node *node)
{
  struct hlist_node *first = list->first;
  node->next = first;
  node->pprev = &list->first;

  if (first)
    first->pprev = &node->next;

  rcu_store (&list->first, node);
}

// Insert a node before another node.
static inline void
hlist_rcu_insert_before (struct hlist_node *node, struct hlist_node *next)
{
  node->next = next;
  node->pprev = next->pprev;
  next->pprev = &node->next;
  rcu_store (node->pprev, node);
}

// Insert a node after another node.
static inline void
hlist_rcu_insert_after (struct hlist_node *node, struct hlist_node *prev)
{
  node->next = prev->next;
  node->pprev = &prev->next;

  if (node->next)
    node->next->pprev = &node->next;

  rcu_store (&prev->next, node);
}

// Remove a node from a list.
static inline void
hlist_rcu_remove (struct hlist_node *node)
{
  if (node->next)
    node->next->pprev = node->pprev;

  rcu_store (node->pprev, node->next);
}

/*
 * Macro that evaluates to the address of the structure containing the
 * given node based on the given type and member.
 */
#define hlist_rcu_entry(node, type, member)   \
  structof (rcu_load (&(node)), type, member)

// Get the first entry of a list.
#define hlist_rcu_first_entry(list, type, member)   \
MACRO_BEGIN   \
  struct hlist_node *first_ = hlist_rcu_first (list);   \
  hlist_end (first_) ? NULL : hlist_entry (first_, type, member);   \
MACRO_END

// Get the entry next to the given entry.
#define hlist_rcu_next_entry(entry, member)   \
MACRO_BEGIN   \
  struct hlist_node *next_ = hlist_rcu_next (&entry->member);   \
  hlist_end (next_) ? NULL : hlist_entry (next_, typeof (*entry), member);   \
MACRO_END

// Forge a loop to process all nodes of a list.
#define hlist_rcu_for_each(list, node)   \
  for (struct hlist_node *node = hlist_rcu_first (list);   \
       !hlist_end (node);   \
       node = hlist_rcu_next (node))

// Forge a loop to process all entries of a list.
#define hlist_rcu_for_each_entry(list, entry, member)   \
  for (entry = hlist_rcu_first_entry (list, typeof (*entry), member);   \
       entry != NULL;   \
       entry = hlist_rcu_next_entry (entry, member))

#endif