+static int log_level=0;
+static int log_level_initialized=0;
+
+/**
+ * creates an rfd. Either allocates a new one, in which case the priv
+ * pointer is null, and will have to be filled in, or picks up one
+ * from the freelist, in which case the priv is already allocated,
+ * and presumably everything that hangs from it as well
+ */
+
+RSFD rfd_create_base(RSET rs)
+{
+ if (!log_level_initialized)
+ {
+ log_level=yaz_log_module_level("rset");
+ log_level_initialized=1;
+ }
+
+ RSFD rnew=rs->free_list;
+ if (rnew)
+ {
+ rs->free_list=rnew->next;
+ assert(rnew->rset==rs);
+ yaz_log(log_level,"rfd-create_base (fl): rfd=%p rs=%p fl=%p priv=%p",
+ rnew, rs, rs->free_list, rnew->priv);
+ } else {
+ rnew=nmem_malloc(rs->nmem, sizeof(*rnew));
+ rnew->priv=NULL;
+ rnew->rset=rs;
+ yaz_log(log_level,"rfd_create_base (new): rfd=%p rs=%p fl=%p priv=%p",
+ rnew, rs, rs->free_list, rnew->priv);
+ }
+ rnew->next=NULL; /* not part of any (free?) list */
+ return rnew;
+}
+
+/* puts an rfd into the freelist of the rset. Only when the rset gets */
+/* deleted, will all the nmem disappear */
+void rfd_delete_base(RSFD rfd)
+{
+ RSET rs=rfd->rset;
+ yaz_log(log_level,"rfd_delete_base: rfd=%p rs=%p priv=%p fl=%p",
+ rfd, rs, rfd->priv, rs->free_list);
+ assert(NULL == rfd->next);
+ rfd->next=rs->free_list;
+ rs->free_list=rfd;
+}
+
+
+RSET rset_create_base(const struct rset_control *sel,
+ NMEM nmem, const struct key_control *kcontrol,
+ int scope, TERMID term)
+{
+ RSET rnew;
+ NMEM M;
+ /* assert(nmem); */ /* can not yet be used, api/t4 fails */
+ if (nmem)
+ M=nmem;
+ else
+ M=nmem_create();
+ rnew = (RSET) nmem_malloc(M,sizeof(*rnew));
+ yaz_log (log_level, "rs_create(%s) rs=%p (nm=%p)", sel->desc, rnew, nmem);
+ rnew->nmem=M;
+ if (nmem)
+ rnew->my_nmem=0;
+ else
+ rnew->my_nmem=1;
+ rnew->control = sel;
+ rnew->count = 1; /* refcount! */
+ rnew->priv = 0;
+ rnew->free_list=NULL;
+ rnew->keycontrol=kcontrol;
+ rnew->scope=scope;
+ rnew->term=term;
+ if (term)
+ term->rset=rnew;
+ return rnew;
+}
+
+void rset_delete (RSET rs)