2 * Copyright (c) 1995, the EUROPAGATE consortium (see below).
4 * The EUROPAGATE consortium members are:
6 * University College Dublin
7 * Danmarks Teknologiske Videnscenter
8 * An Chomhairle Leabharlanna
9 * Consejo Superior de Investigaciones Cientificas
11 * Permission to use, copy, modify, distribute, and sell this software and
12 * its documentation, in whole or in part, for any purpose, is hereby granted,
15 * 1. This copyright and permission notice appear in all copies of the
16 * software and its documentation. Notices of copyright or attribution
17 * which appear at the beginning of any file must remain unchanged.
19 * 2. The names of EUROPAGATE or the project partners may not be used to
20 * endorse or promote products derived from this software without specific
21 * prior written permission.
23 * 3. Users of this software (implementors and gateway operators) agree to
24 * inform the EUROPAGATE consortium of their use of the software. This
25 * information will be used to evaluate the EUROPAGATE project and the
26 * software, and to plan further developments. The consortium may use
27 * the information in later publications.
29 * 4. Users of this software agree to make their best efforts, when
30 * documenting their use of the software, to acknowledge the EUROPAGATE
31 * consortium, and the role played by the software in their work.
33 * THIS SOFTWARE IS PROVIDED "AS IS" AND WITHOUT WARRANTY OF ANY KIND,
34 * EXPRESS, IMPLIED, OR OTHERWISE, INCLUDING WITHOUT LIMITATION, ANY
35 * WARRANTY OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE.
36 * IN NO EVENT SHALL THE EUROPAGATE CONSORTIUM OR ITS MEMBERS BE LIABLE
37 * FOR ANY SPECIAL, INCIDENTAL, INDIRECT OR CONSEQUENTIAL DAMAGES OF
38 * ANY KIND, OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA
39 * OR PROFITS, WHETHER OR NOT ADVISED OF THE POSSIBILITY OF DAMAGE, AND
40 * ON ANY THEORY OF LIABILITY, ARISING OUT OF OR IN CONNECTION WITH THE
41 * USE OR PERFORMANCE OF THIS SOFTWARE.
47 * $Id: cclqual.c,v 1.1 2003-10-27 12:21:30 adam Exp $
51 * Revision 1.9 1995/05/16 09:39:27 adam
54 * Revision 1.8 1995/05/11 14:03:57 adam
55 * Changes in the reading of qualifier(s). New function: ccl_qual_fitem.
56 * New variable ccl_case_sensitive, which controls whether reserved
57 * words and field names are case sensitive or not.
59 * Revision 1.7 1995/04/17 09:31:46 adam
60 * Improved handling of qualifiers. Aliases or reserved words.
62 * Revision 1.6 1995/02/23 08:32:00 adam
65 * Revision 1.4 1995/02/14 19:55:12 adam
66 * Header files ccl.h/cclp.h are gone! They have been merged an
67 * moved to ../include/ccl.h.
68 * Node kind(s) in ccl_rpn_node have changed names.
70 * Revision 1.3 1995/02/14 16:20:56 adam
71 * Qualifiers are read from a file now.
73 * Revision 1.2 1995/02/14 10:25:56 adam
74 * The constructions 'qualifier rel term ...' implemented.
76 * Revision 1.1 1995/02/13 15:15:07 adam
77 * Added handling of qualifiers. Not finished yet.
87 /* Definition of CCL_bibset pointer */
88 struct ccl_qualifiers {
89 struct ccl_qualifier *list;
90 struct ccl_qualifier_special *special;
94 /* CCL Qualifier special */
95 struct ccl_qualifier_special {
98 struct ccl_qualifier_special *next;
102 static struct ccl_qualifier *ccl_qual_lookup (CCL_bibset b,
103 const char *n, size_t len)
105 struct ccl_qualifier *q;
106 for (q = b->list; q; q = q->next)
107 if (len == strlen(q->name) && !memcmp (q->name, n, len))
113 void ccl_qual_add_special (CCL_bibset bibset, const char *n, const char *v)
115 struct ccl_qualifier_special *p;
118 for (p = bibset->special; p && strcmp(p->name, n); p = p->next)
124 p = (struct ccl_qualifier_special *) xmalloc (sizeof(*p));
125 p->name = ccl_strdup (n);
127 p->next = bibset->special;
130 while (strchr(" \t", *v))
132 for (pe = v + strlen(v); pe != v; --pe)
133 if (!strchr(" \n\r\t", pe[-1]))
135 p->value = (char*) xmalloc (pe - v + 1);
137 memcpy (p->value, v, pe - v);
138 p->value[pe - v] = '\0';
141 static int next_token(const char **cpp, const char **dst)
144 const char *cp = *cpp;
145 while (*cp && strchr(" \r\n\t\f", *cp))
150 while (*cp && !strchr(" \r\n\t\f", *cp))
159 void ccl_qual_add_combi (CCL_bibset b, const char *n, const char *names)
161 const char *cp, *cp1;
163 struct ccl_qualifier *q;
164 for (q = b->list; q && strcmp(q->name, n); q = q->next)
168 q = (struct ccl_qualifier *) xmalloc (sizeof(*q));
169 q->name = ccl_strdup (n);
175 for (i = 0; next_token(&cp, 0); i++)
178 q->sub = (struct ccl_qualifier **) xmalloc (sizeof(*q->sub) *
181 for (i = 0; (len = next_token(&cp, &cp1)); i++)
183 q->sub[i] = ccl_qual_lookup (b, cp1, len);
188 * ccl_qual_add: Add qualifier to Bibset. If qualifier already
189 * exists, then attributes are appendend to old
191 * name: name of qualifier
192 * no: No of attribute type/value pairs.
193 * pairs: Attributes. pairs[0] first type, pair[1] first value,
194 * ... pair[2*no-2] last type, pair[2*no-1] last value.
197 void ccl_qual_add_set (CCL_bibset b, const char *name, int no,
198 int *type_ar, int *value_ar, char **svalue_ar,
201 struct ccl_qualifier *q;
202 struct ccl_rpn_attr **attrp;
205 for (q = b->list; q; q = q->next)
206 if (!strcmp (name, q->name))
210 struct ccl_qualifier *new_qual =
211 (struct ccl_qualifier *)xmalloc (sizeof(*new_qual));
212 ccl_assert (new_qual);
214 new_qual->next = b->list;
217 new_qual->name = ccl_strdup (name);
218 attrp = &new_qual->attr_list;
220 new_qual->no_sub = 0;
225 if (q->sub) /* suspect.. */
227 attrp = &q->attr_list;
229 attrp = &(*attrp)->next;
233 struct ccl_rpn_attr *attr;
235 attr = (struct ccl_rpn_attr *)xmalloc (sizeof(*attr));
237 attr->set = *attsets++;
238 attr->type = *type_ar++;
241 attr->kind = CCL_RPN_ATTR_STRING;
242 attr->value.str = *svalue_ar;
246 attr->kind = CCL_RPN_ATTR_NUMERIC;
247 attr->value.numeric = *value_ar;
258 * ccl_qual_mk: Make new (empty) bibset.
259 * return: empty bibset.
261 CCL_bibset ccl_qual_mk (void)
263 CCL_bibset b = (CCL_bibset)xmalloc (sizeof(*b));
271 * ccl_qual_rm: Delete bibset.
272 * b: pointer to bibset
274 void ccl_qual_rm (CCL_bibset *b)
276 struct ccl_qualifier *q, *q1;
277 struct ccl_qualifier_special *sp, *sp1;
281 for (q = (*b)->list; q; q = q1)
283 struct ccl_rpn_attr *attr, *attr1;
285 for (attr = q->attr_list; attr; attr = attr1)
290 if (attr->kind == CCL_RPN_ATTR_STRING)
291 xfree(attr->value.str);
300 for (sp = (*b)->special; sp; sp = sp1)
312 * ccl_qual_search: Search for qualifier in bibset.
314 * name: Name of qualifier to search for (need no null-termination)
315 * len: Length of name.
316 * return: Attribute info. NULL if not found.
318 struct ccl_rpn_attr *ccl_qual_search (CCL_parser cclp,
319 const char *name, size_t len,
322 struct ccl_qualifier *q;
324 int case_sensitive = cclp->ccl_case_sensitive;
330 aliases = ccl_qual_search_special(cclp->bibset, "case");
332 case_sensitive = atoi(aliases);
334 for (q = cclp->bibset->list; q; q = q->next)
335 if (strlen(q->name) == len)
339 if (!memcmp (name, q->name, len))
344 if (!ccl_memicmp (name, q->name, len))
350 if (q->attr_list && seq == 0)
352 if (seq < q->no_sub && q->sub[seq])
354 return q->sub[seq]->attr_list;
360 const char *ccl_qual_search_special (CCL_bibset b,
363 struct ccl_qualifier_special *q;
366 for (q = b->special; q && strcmp(q->name, name); q = q->next)