+
+static struct ccl_qualifier *ccl_qual_lookup (CCL_bibset b,
+ const char *n, size_t len)
+{
+ struct ccl_qualifier *q;
+ for (q = b->list; q; q = q->next)
+ if (len == strlen(q->name) && !memcmp (q->name, n, len))
+ break;
+ return q;
+}
+
+
+void ccl_qual_add_special (CCL_bibset bibset, const char *n, const char *v)
+{
+ struct ccl_qualifier_special *p;
+ const char *pe;
+
+ for (p = bibset->special; p && strcmp(p->name, n); p = p->next)
+ ;
+ if (p)
+ xfree (p->value);
+ else
+ {
+ p = (struct ccl_qualifier_special *) xmalloc (sizeof(*p));
+ p->name = ccl_strdup (n);
+ p->value = 0;
+ p->next = bibset->special;
+ bibset->special = p;
+ }
+ while (strchr(" \t", *v))
+ ++v;
+ for (pe = v + strlen(v); pe != v; --pe)
+ if (!strchr(" \n\r\t", pe[-1]))
+ break;
+ p->value = (char*) xmalloc (pe - v + 1);
+ if (pe - v)
+ memcpy (p->value, v, pe - v);
+ p->value[pe - v] = '\0';
+}
+
+static int next_token(const char **cpp, const char **dst)
+{
+ int len = 0;
+ const char *cp = *cpp;
+ while (*cp && strchr(" \r\n\t\f", *cp))
+ cp++;
+ if (dst)
+ *dst = cp;
+ len = 0;
+ while (*cp && !strchr(" \r\n\t\f", *cp))
+ {
+ cp++;
+ len++;
+ }
+ *cpp = cp;
+ return len;
+}
+
+void ccl_qual_add_combi (CCL_bibset b, const char *n, const char *names)
+{
+ const char *cp, *cp1;
+ int i, len;
+ struct ccl_qualifier *q;
+ for (q = b->list; q && strcmp(q->name, n); q = q->next)
+ ;
+ if (q)
+ return ;
+ q = (struct ccl_qualifier *) xmalloc (sizeof(*q));
+ q->name = ccl_strdup (n);
+ q->attr_list = 0;
+ q->next = b->list;
+ b->list = q;
+
+ cp = names;
+ for (i = 0; next_token(&cp, 0); i++)
+ ;
+ q->no_sub = i;
+ q->sub = (struct ccl_qualifier **) xmalloc (sizeof(*q->sub) *
+ (1+q->no_sub));
+ cp = names;
+ for (i = 0; (len = next_token(&cp, &cp1)); i++)
+ {
+ q->sub[i] = ccl_qual_lookup (b, cp1, len);
+ }
+}
+