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.
48 * Revision 1.10 1998-07-07 15:49:40 adam
49 * Added braces to avoid warning.
51 * Revision 1.9 1998/02/11 11:53:33 adam
52 * Changed code so that it compiles as C++.
54 * Revision 1.8 1997/09/29 08:56:38 adam
55 * Changed CCL parser to be thread safe. New type, CCL_parser, declared
56 * and a create/destructers ccl_parser_create/ccl_parser/destory has
59 * Revision 1.7 1997/09/01 08:48:12 adam
60 * New windows NT/95 port using MSV5.0. Only a few changes made
63 * Revision 1.6 1997/04/30 08:52:07 quinn
66 * Revision 1.5 1996/10/11 15:00:25 adam
67 * CCL parser from Europagate Email gateway 1.0.
69 * Revision 1.9 1995/05/16 09:39:27 adam
72 * Revision 1.8 1995/05/11 14:03:57 adam
73 * Changes in the reading of qualifier(s). New function: ccl_qual_fitem.
74 * New variable ccl_case_sensitive, which controls whether reserved
75 * words and field names are case sensitive or not.
77 * Revision 1.7 1995/04/17 09:31:46 adam
78 * Improved handling of qualifiers. Aliases or reserved words.
80 * Revision 1.6 1995/02/23 08:32:00 adam
83 * Revision 1.4 1995/02/14 19:55:12 adam
84 * Header files ccl.h/cclp.h are gone! They have been merged an
85 * moved to ../include/ccl.h.
86 * Node kind(s) in ccl_rpn_node have changed names.
88 * Revision 1.3 1995/02/14 16:20:56 adam
89 * Qualifiers are read from a file now.
91 * Revision 1.2 1995/02/14 10:25:56 adam
92 * The constructions 'qualifier rel term ...' implemented.
94 * Revision 1.1 1995/02/13 15:15:07 adam
95 * Added handling of qualifiers. Not finished yet.
106 /* Definition of CCL_bibset pointer */
107 struct ccl_qualifiers {
108 struct ccl_qualifier *list;
112 * ccl_qual_add: Add qualifier to Bibset. If qualifier already
113 * exists, then attributes are appendend to old
115 * name: name of qualifier
116 * no: No of attribute type/value pairs.
117 * pairs: Attributes. pairs[0] first type, pair[1] first value,
118 * ... pair[2*no-2] last type, pair[2*no-1] last value.
120 void ccl_qual_add (CCL_bibset b, const char *name, int no, int *pairs)
122 struct ccl_qualifier *q;
123 struct ccl_rpn_attr **attrp;
126 for (q = b->list; q; q = q->next)
127 if (!strcmp (name, q->name))
131 struct ccl_qualifier *new_qual = (struct ccl_qualifier *)malloc (sizeof(*new_qual));
134 new_qual->next = b->list;
137 new_qual->name = (char *)malloc (strlen(name)+1);
138 assert (new_qual->name);
139 strcpy (new_qual->name, name);
140 attrp = &new_qual->attr_list;
144 attrp = &q->attr_list;
146 attrp = &(*attrp)->next;
150 struct ccl_rpn_attr *attr;
152 attr = (struct ccl_rpn_attr *)malloc (sizeof(*attr));
154 attr->type = *pairs++;
155 attr->value = *pairs++;
163 * ccl_qual_mk: Make new (empty) bibset.
164 * return: empty bibset.
166 CCL_bibset ccl_qual_mk (void)
168 CCL_bibset b = (CCL_bibset)malloc (sizeof(*b));
175 * ccl_qual_rm: Delete bibset.
176 * b: pointer to bibset
178 void ccl_qual_rm (CCL_bibset *b)
180 struct ccl_qualifier *q, *q1;
184 for (q = (*b)->list; q; q = q1)
186 struct ccl_rpn_attr *attr, *attr1;
188 for (attr = q->attr_list; attr; attr = attr1)
201 * ccl_qual_search: Search for qualifier in bibset.
203 * name: Name of qualifier to search for (need no null-termination)
204 * len: Length of name.
205 * return: Attribute info. NULL if not found.
207 struct ccl_rpn_attr *ccl_qual_search (CCL_parser cclp,
208 const char *name, size_t len)
210 struct ccl_qualifier *q;
215 for (q = cclp->bibset->list; q; q = q->next)
216 if (strlen(q->name) == len)
218 if (cclp->ccl_case_sensitive)
220 if (!memcmp (name, q->name, len))
225 if (!ccl_memicmp (name, q->name, len))