node.c

Go to the documentation of this file.

 
#include "config.h"
#include <stddef.h>
#include "mutt/lib.h"
#include "node.h"
 
struct ExpandoNode *node_new(void)
{
  return mutt_mem_calloc(1, sizeof(struct ExpandoNode));
}
 
void node_free(struct ExpandoNode **ptr)
{
  if (!ptr || !*ptr)
    return;
 
  struct ExpandoNode *node = *ptr;
  if (node->ndata_free)
  {
    node->ndata_free(&node->ndata);
  }
 
  struct ExpandoNode **enp = NULL;
  ARRAY_FOREACH(enp, &node->children)
  {
    node_tree_free(enp);
  }
 
  FREE(&node->format);
 
  ARRAY_FREE(&node->children);
 
  FREE(ptr);
}
 
void node_tree_free(struct ExpandoNode **ptr)
{
  if (!ptr || !*ptr)
    return;
 
  struct ExpandoNode *node = *ptr;
  while (node)
  {
    struct ExpandoNode *n = node;
    node = node->next;
    node_free(&n);
  }
 
  *ptr = NULL;
}
 
struct ExpandoNode *node_get_child(const struct ExpandoNode *node, int index)
{
  if (!node)
    return NULL;
 
  struct ExpandoNode **ptr = ARRAY_GET(&node->children, index);
  if (!ptr)
    return NULL;
 
  return *ptr;
}
 
void node_append(struct ExpandoNode **root, struct ExpandoNode *new_node)
{
  if (!*root)
  {
    *root = new_node;
    return;
  }
 
  struct ExpandoNode *node = *root;
  while (node->next)
  {
    node = node->next;
  }
 
  node->next = new_node;
}
 
struct ExpandoNode *node_last(struct ExpandoNode *node)
{
  if (!node)
    return NULL;
 
  while (true)
  {
    if (node->next)
    {
      node = node->next;
      continue;
    }
 
    size_t size = ARRAY_SIZE(&node->children);
    if (size == 0)
      break;
 
    struct ExpandoNode *last = node_get_child(node, size - 1);
    if (!last)
      break; // LCOV_EXCL_LINE
 
    node = last;
  }
 
  return node;
}