2 * Copyright (c) 1995-1998, Index Data.
3 * See the file LICENSE for details.
4 * Sebastian Hammer, Adam Dickmeiss
7 * Revision 1.15 1999-03-31 11:18:25 adam
8 * Implemented odr_strdup. Added Reference ID to backend server API.
10 * Revision 1.14 1998/03/16 12:21:15 adam
11 * Fixed problem with tag names that weren't set to the right value
12 * when wildcards were used.
14 * Revision 1.13 1998/02/11 11:53:35 adam
15 * Changed code so that it compiles as C++.
17 * Revision 1.12 1997/11/24 11:33:56 adam
18 * Using function odr_nullval() instead of global ODR_NULLVAL when
21 * Revision 1.11 1997/11/18 09:51:09 adam
22 * Removed element num_children from data1_node. Minor changes in
25 * Revision 1.10 1997/09/17 12:10:36 adam
28 * Revision 1.9 1997/05/14 06:54:03 adam
31 * Revision 1.8 1996/12/05 13:17:49 quinn
32 * Fixed GRS-1 null-ref
34 * Revision 1.7 1996/10/11 11:57:23 quinn
37 * Revision 1.6 1996/07/06 19:58:34 quinn
38 * System headerfiles gathered in yconfig
40 * Revision 1.5 1996/06/03 09:46:42 quinn
41 * Added OID data type.
43 * Revision 1.4 1996/05/01 12:45:30 quinn
44 * Support use of local tag names in abs file.
46 * Revision 1.3 1995/11/13 09:27:35 quinn
47 * Fiddling with the variant stuff.
49 * Revision 1.2 1995/11/01 13:54:46 quinn
52 * Revision 1.1 1995/11/01 11:56:07 quinn
53 * Added Retrieval (data management) functions en masse.
66 #define D1_VARIANTARRAY 20 /* fixed max length on sup'd variant-list. Lazy me */
68 static Z_ElementMetaData *get_ElementMetaData(ODR o)
70 Z_ElementMetaData *r = (Z_ElementMetaData *)odr_malloc(o, sizeof(*r));
77 r->num_supportedVariants = 0;
78 r->supportedVariants = 0;
80 r->elementDescriptor = 0;
82 r->surrogateElement = 0;
89 * N should point to the *last* (leaf) triple in a sequence. Construct a variant
90 * from each of the triples beginning (ending) with 'n', up to the
91 * nearest parent tag. num should equal the number of triples in the
94 static Z_Variant *make_variant(data1_node *n, int num, ODR o)
96 Z_Variant *v = (Z_Variant *)odr_malloc(o, sizeof(*v));
99 v->globalVariantSetId = 0;
100 v->num_triples = num;
101 v->triples = (Z_Triple **)odr_malloc(o, sizeof(Z_Triple*) * num);
104 * cycle back up through the tree of variants
105 * (traversing exactly 'level' variants).
107 for (p = n, num--; p && num >= 0; p = p->parent, num--)
111 assert(p->which == DATA1N_variant);
112 t = v->triples[num] = (Z_Triple *)odr_malloc(o, sizeof(*t));
114 t->zclass = (int *)odr_malloc(o, sizeof(int));
115 *t->zclass = p->u.variant.type->zclass->zclass;
116 t->type = (int *)odr_malloc(o, sizeof(int));
117 *t->type = p->u.variant.type->type;
119 switch (p->u.variant.type->datatype)
122 t->which = Z_Triple_internationalString;
123 t->value.internationalString =
124 odr_strdup(o, p->u.variant.value);
127 logf(LOG_WARN, "Unable to handle value for variant %s",
128 p->u.variant.type->name);
136 * Traverse the variant children of n, constructing a supportedVariant list.
138 static int traverse_triples(data1_node *n, int level, Z_ElementMetaData *m,
143 for (c = n->child; c; c = c->next)
144 if (c->which == DATA1N_data && level)
146 if (!m->supportedVariants)
147 m->supportedVariants = (Z_Variant **)odr_malloc(o, sizeof(Z_Variant*) *
149 else if (m->num_supportedVariants >= D1_VARIANTARRAY)
151 logf(LOG_WARN, "Too many variants (D1_VARIANTARRAY==%d)",
156 if (!(m->supportedVariants[m->num_supportedVariants++] =
157 make_variant(n, level, o)))
160 else if (c->which == DATA1N_variant)
161 if (traverse_triples(c, level+1, m, o) < 0)
166 static Z_ElementData *nodetoelementdata(data1_handle dh, data1_node *n,
167 int select, int leaf,
170 Z_ElementData *res = (Z_ElementData *)odr_malloc(o, sizeof(*res));
174 res->which = Z_ElementData_elementNotThere;
175 res->u.elementNotThere = odr_nullval();
177 else if (n->which == DATA1N_data && (leaf || n->next == NULL))
183 for (p = n->parent; p && p->which != DATA1N_tag; p = p->parent)
186 switch (n->u.data.what)
189 res->which = Z_ElementData_numeric;
190 res->u.numeric = (int *)odr_malloc(o, sizeof(int));
191 *res->u.numeric = atoi(n->u.data.data);
195 toget = n->u.data.len;
196 if (p->u.tag.get_bytes > 0 && p->u.tag.get_bytes < toget)
197 toget = p->u.tag.get_bytes;
198 res->which = Z_ElementData_string;
199 res->u.string = (char *)odr_malloc(o, toget+1);
200 memcpy(res->u.string, n->u.data.data, toget);
201 res->u.string[toget] = '\0';
205 res->which = Z_ElementData_oid;
206 strncpy(str, n->u.data.data, n->u.data.len);
207 str[n->u.data.len] = '\0';
208 res->u.oid = odr_getoidbystr(o, str);
209 *len += n->u.data.len;
212 logf(LOG_WARN, "Can't handle datatype.");
218 res->which = Z_ElementData_subtree;
219 if (!(res->u.subtree = data1_nodetogr (dh, n->parent, select, o, len)))
225 static Z_TaggedElement *nodetotaggedelement(data1_handle dh, data1_node *n,
229 Z_TaggedElement *res = (Z_TaggedElement *)odr_malloc(o, sizeof(*res));
234 if (n->which == DATA1N_tag)
236 if (n->u.tag.element)
237 tag = n->u.tag.element->tag;
242 * If we're a data element at this point, we need to insert a
243 * wellKnown tag to wrap us up.
245 else if (n->which == DATA1N_data || n->which == DATA1N_variant)
247 if (!(tag = data1_gettagbyname (dh, n->root->u.root.absyn->tagset,
250 logf(LOG_WARN, "Unable to locate tag for 'wellKnown'");
258 logf(LOG_WARN, "Bad data.");
262 res->tagType = (int *)odr_malloc(o, sizeof(int));
263 *res->tagType = (tag && tag->tagset) ? tag->tagset->type : 3;
264 res->tagValue = (Z_StringOrNumeric *)odr_malloc(o, sizeof(Z_StringOrNumeric));
265 if (tag && tag->which == DATA1T_numeric)
267 res->tagValue->which = Z_StringOrNumeric_numeric;
268 res->tagValue->u.numeric = (int *)odr_malloc(o, sizeof(int));
269 *res->tagValue->u.numeric = tag->value.numeric;
275 if (n->which == DATA1N_tag)
276 tagstr = n->u.tag.tag; /* tag at node */
278 tagstr = tag->value.string; /* no take from well-known */
280 tagstr = "?"; /* no tag at all! */
281 res->tagValue->which = Z_StringOrNumeric_string;
282 res->tagValue->u.string = odr_strdup(o, tagstr);
284 res->tagOccurrence = 0;
285 res->appliedVariant = 0;
287 if (n->which == DATA1N_variant || (data && data->which ==
288 DATA1N_variant && data->next == NULL))
292 res->metaData = get_ElementMetaData(o);
293 if (n->which == DATA1N_tag && n->u.tag.make_variantlist)
294 if (traverse_triples(data, 0, res->metaData, o) < 0)
296 while (data && data->which == DATA1N_variant)
301 if (n->which != DATA1N_tag || !n->u.tag.no_data_requested)
302 res->appliedVariant = make_variant(data->parent, nvars-1, o);
304 if (n->which == DATA1N_tag && n->u.tag.no_data_requested)
306 res->content = (Z_ElementData *)odr_malloc(o, sizeof(*res->content));
307 res->content->which = Z_ElementData_noDataRequested;
308 res->content->u.noDataRequested = odr_nullval();
310 else if (!(res->content = nodetoelementdata (dh, data, select, leaf,
317 Z_GenericRecord *data1_nodetogr(data1_handle dh, data1_node *n,
318 int select, ODR o, int *len)
320 Z_GenericRecord *res = (Z_GenericRecord *)odr_malloc(o, sizeof(*res));
322 int num_children = 0;
324 for (c = n->child; c; c = c->next)
327 res->elements = (Z_TaggedElement **)odr_malloc(o, sizeof(Z_TaggedElement *) * num_children);
328 res->num_elements = 0;
329 for (c = n->child; c; c = c->next)
331 if (c->which == DATA1N_tag && select && !c->u.tag.node_selected)
333 if (!(res->elements[res->num_elements++] =
334 nodetotaggedelement (dh, c, select, o, len)))