+/** \fn rfd_delete_base
+ *
+ * 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)
+{
+ RSFD *pfd;
+ 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);
+ for (pfd = &rs->use_list; *pfd; pfd = &(*pfd)->next)
+ if (*pfd == rfd)
+ {
+ *pfd = (*pfd)->next;
+ rfd->next = rs->free_list;
+ rs->free_list = rfd;
+ return;
+ }
+ yaz_log(YLOG_WARN, "rset_close handle not found. type=%s",
+ rs->control->desc);
+}
+
+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 (!log_level_initialized)
+ {
+ log_level = yaz_log_module_level("rset");
+ log_level_initialized = 1;
+ }
+
+ 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->use_list = NULL;
+ rnew->keycontrol = kcontrol;
+ rnew->scope = scope;
+ rnew->term = term;
+ if (term)
+ term->rset = rnew;
+ return rnew;
+}
+
+void rset_delete (RSET rs)
+{
+ (rs->count)--;
+ yaz_log(log_level, "rs_delete(%s), rs=%p, count=%d",
+ rs->control->desc, rs, rs->count);
+ if (!rs->count)
+ {
+ if (rs->use_list)
+ yaz_log(YLOG_WARN, "rs_delete(%s) still has RFDs in use",
+ rs->control->desc);
+ (*rs->control->f_delete)(rs);
+ if (rs->my_nmem)
+ nmem_destroy(rs->nmem);
+ }
+}
+
+int rfd_is_last(RSFD rfd)
+{
+ if (rfd->rset->use_list == rfd && rfd->next == 0)
+ return 1;
+ return 0;
+}
+
+RSET rset_dup (RSET rs)
+{
+ (rs->count)++;
+ yaz_log(log_level, "rs_dup(%s), rs=%p, count=%d",
+ rs->control->desc, rs, rs->count);
+ return rs;
+}