tree.h

Go to the documentation of this file.

#ifndef _TREE_H_

#define LEAF_FIELDS(X)           \
  X *parent;               \
  X *next;              \
  X *first_child;          \
  int level;               \

#define LEAF_ROOT  0

#define iter_childs(ROOT, LEAF) for (LEAF = ROOT->first_child; LEAF; \
                 LEAF = LEAF->next)

#define free_childs(ROOT, LEAF, FREE) do {            \
    grid_t *next__;                    \
    for (LEAF = ROOT->first_child; LEAF; LEAF = (typeof(LEAF)) next__) { \
      next__ = ((grid_t *) LEAF)->next;               \
      FREE (LEAF);                     \
    }                         \
  } while(0)

#define set_leaf(LEAF, PARENT, NEXT, FIRST_CHILD, LEVEL) do {  \
    LEAF->parent = PARENT;             \
    LEAF->next = NEXT;                 \
    LEAF->first_child = FIRST_CHILD;            \
    LEAF->level = LEVEL;               \
  } while(0)

#define init_leaf(LEAF) set_leaf(LEAF, NULL, NULL, NULL, -1)

#define set_childless(LEAF) (LEAF)->first_child = NULL

#define add_child(PARENT, CHILD) do {              \
    set_leaf(CHILD, PARENT, PARENT->first_child, CHILD->first_child, \
        PARENT->level + 1);               \
    PARENT->first_child = CHILD;             \
  } while(0)

#define mk_recursive(func, type)    \
  void func ## _r (type *grid_)        \
  {                  \
    type *child_;          \
    func (grid_);          \
    iter_childs (grid_, child_) {      \
      func ## _r (child_);       \
    }                \
  }

#define mk_tail_recursive(func, type)     \
  void func ## _r (type *grid_)        \
  {                  \
    type *child_;          \
    iter_childs (grid_, child_) {      \
      func ## _r (child_);       \
    }                \
    func (grid_);          \
  }

#define _TREE_H_
#endif