input*
new_input(void)
{
input *i;
if ((i = calloc(1, sizeof(*i))) == NULL)
fatal("calloc");
new_list_head(i);
return i;
}
LISTNODE *
decompose_conceptual (LISTNODE *l)
{
#if ORDERBY
l = new_list_tail(l, new_node("top2ds"));
l = new_list_tail(l, new_node("inbetween"));
/* The orderby retrieval layer (e.g. dlist_stable) must be stable??? (JAT) */
l = new_list_tail(l, new_node("dlist_stable"));
l = new_list_tail(l, new_node("malloc"));
l = new_list_tail(l, new_node("transient"));
#endif
#if !TOP2DS_QUALIFY
l = new_list_head(new_node("qualify"), l);
#endif
l = new_list_head(new_node("inbetween"), l);
#if ORDERBY
l = new_list_head(new_node("orderby_smart"), l);
#endif
#if GENERIC && FUNCALL
l = new_list_head(new_node("generic_funcall"), l);
#elif FUNCALL
l = new_list_head(new_node("named_funcall"), l);
#endif
#if GENERIC
l = new_list_head(new_node("generic"), l);
l = new_list_head(new_node("init_generic"), l);
#endif
#if TOP2DS_QUALIFY
l = new_list_head(new_node("top2ds_qualify"), l);
#else
l = new_list_head(new_node("top2ds"), l);
#endif
return(l);
}
