nb_reg_node
struct nb_reg_node *next;
static struct nb_reg_node *nb_first = (struct nb_reg_node *)&nb_first;
static struct nb_reg_node *nb_free = (struct nb_reg_node *)&nb_free;
#define LIST_ISEMPTY(l) (l == (struct nb_reg_node *)&l)
#define LIST_CLR(l) (l = (struct nb_reg_node *)&l)
for (node = l; node != (struct nb_reg_node *)&l; node = node->next)
struct nb_reg_node *node;
struct nb_reg_node *chk =
malloc(sizeof (struct nb_reg_node) * CHUNK_SIZE);
struct nb_reg_node *n;
n[CHUNK_SIZE-1].next = (struct nb_reg_node *)&nb_free;
struct nb_reg_node *node;
struct nb_reg_node *node;
struct nb_reg_node *n = node->next;