2 * Copyright (c) 1995, Index Data.
3 * See the file LICENSE for details.
4 * Sebastian Hammer, Adam Dickmeiss
7 * Revision 1.5 1996-06-03 09:46:42 quinn
10 * Revision 1.4 1996/05/01 12:45:30 quinn
11 * Support use of local tag names in abs file.
13 * Revision 1.3 1995/11/13 09:27:35 quinn
14 * Fiddling with the variant stuff.
16 * Revision 1.2 1995/11/01 13:54:46 quinn
19 * Revision 1.1 1995/11/01 11:56:07 quinn
20 * Added Retrieval (data management) functions en masse.
33 #define D1_VARIANTARRAY 20 /* fixed max length on sup'd variant-list. Lazy me */
35 Z_GenericRecord *data1_nodetogr(data1_node *n, int select, ODR o);
37 static Z_ElementMetaData *get_ElementMetaData(ODR o)
39 Z_ElementMetaData *r = odr_malloc(o, sizeof(*r));
46 r->num_supportedVariants = 0;
47 r->supportedVariants = 0;
49 r->elementDescriptor = 0;
51 r->surrogateElement = 0;
58 * N should point to the *last* (leaf) triple in a sequence. Construct a variant
59 * from each of the triples beginning (ending) with 'n', up to the
60 * nearest parent tag. num should equal the number of triples in the
63 static Z_Variant *make_variant(data1_node *n, int num, ODR o)
65 Z_Variant *v = odr_malloc(o, sizeof(*v));
68 v->globalVariantSetId = 0;
70 v->triples = odr_malloc(o, sizeof(Z_Triple*) * num);
73 * cycle back up through the tree of variants
74 * (traversing exactly 'level' variants).
76 for (p = n, num--; p && num >= 0; p = p->parent, num--)
80 assert(p->which == DATA1N_variant);
81 t = v->triples[num] = odr_malloc(o, sizeof(*t));
83 t->class = odr_malloc(o, sizeof(int));
84 *t->class = p->u.variant.type->class->class;
85 t->type = odr_malloc(o, sizeof(int));
86 *t->type = p->u.variant.type->type;
88 switch (p->u.variant.type->datatype)
91 t->which = Z_Triple_internationalString;
92 t->value.internationalString = odr_malloc(o,
93 strlen(p->u.variant.value)+1);
94 strcpy(t->value.internationalString, p->u.variant.value);
97 logf(LOG_WARN, "Unable to handle value for variant %s",
98 p->u.variant.type->name);
106 * Traverse the variant children of n, constructing a supportedVariant list.
108 static int traverse_triples(data1_node *n, int level, Z_ElementMetaData *m,
113 for (c = n->child; c; c = c->next)
114 if (c->which == DATA1N_data && level)
116 if (!m->supportedVariants)
117 m->supportedVariants = odr_malloc(o, sizeof(Z_Variant*) *
119 else if (m->num_supportedVariants >= D1_VARIANTARRAY)
121 logf(LOG_WARN, "Too many variants (D1_VARIANTARRAY==%d)",
126 if (!(m->supportedVariants[m->num_supportedVariants++] =
127 make_variant(n, level, o)))
130 else if (c->which == DATA1N_variant)
131 if (traverse_triples(c, level+1, m, o) < 0)
136 static Z_ElementData *nodetoelementdata(data1_node *n, int select, int leaf,
139 Z_ElementData *res = odr_malloc(o, sizeof(*res));
143 res->which = Z_ElementData_elementNotThere;
144 res->u.elementNotThere = ODR_NULLVAL;
146 else if (n->which == DATA1N_data && (leaf || n->parent->num_children == 1))
150 switch (n->u.data.what)
153 res->which = Z_ElementData_numeric;
154 res->u.numeric = odr_malloc(o, sizeof(int));
155 *res->u.numeric = atoi(n->u.data.data);
158 res->which = Z_ElementData_string;
159 res->u.string = odr_malloc(o, n->u.data.len+1);
160 memcpy(res->u.string, n->u.data.data, n->u.data.len);
161 res->u.string[n->u.data.len] = '\0';
164 res->which = Z_ElementData_oid;
165 strncpy(str, n->u.data.data, n->u.data.len);
166 str[n->u.data.len] = '\0';
167 res->u.oid = odr_getoidbystr(o, str);
170 logf(LOG_WARN, "Can't handle datatype.");
176 res->which = Z_ElementData_subtree;
177 if (!(res->u.subtree = data1_nodetogr(n->parent, select, o)))
183 static Z_TaggedElement *nodetotaggedelement(data1_node *n, int select, ODR o)
185 Z_TaggedElement *res = odr_malloc(o, sizeof(*res));
190 if (n->which == DATA1N_tag)
192 if (n->u.tag.element)
193 tag = n->u.tag.element->tag;
198 * If we're a data element at this point, we need to insert a
199 * wellKnown tag to wrap us up.
201 else if (n->which == DATA1N_data || n->which == DATA1N_variant)
203 if (!(tag = data1_gettagbyname(n->root->u.root.absyn->tagset,
206 logf(LOG_WARN, "Unable to locate tag for 'wellKnown'");
214 logf(LOG_WARN, "Bad data.");
218 res->tagType = odr_malloc(o, sizeof(int));
219 *res->tagType = (tag && tag->tagset) ? tag->tagset->type : 3;
220 res->tagValue = odr_malloc(o, sizeof(Z_StringOrNumeric));
221 if (tag && tag->which == DATA1T_numeric)
223 res->tagValue->which = Z_StringOrNumeric_numeric;
224 res->tagValue->u.numeric = odr_malloc(o, sizeof(int));
225 *res->tagValue->u.numeric = tag->value.numeric;
231 if (tag) /* well-known tag */
232 tagstr = tag->value.string;
233 else /* tag local to this file */
234 tagstr = n->u.tag.tag;
236 res->tagValue->which = Z_StringOrNumeric_string;
237 res->tagValue->u.string = odr_malloc(o, strlen(tagstr)+1);
238 strcpy(res->tagValue->u.string, tagstr);
240 res->tagOccurrence = 0;
241 res->appliedVariant = 0;
243 if (n->which == DATA1N_variant || (data && data->which ==
244 DATA1N_variant && data->parent->num_children == 1))
248 res->metaData = get_ElementMetaData(o);
249 if (n->which == DATA1N_tag && n->u.tag.make_variantlist)
250 if (traverse_triples(data, 0, res->metaData, o) < 0)
252 while (data && data->which == DATA1N_variant)
257 if (n->which != DATA1N_tag || !n->u.tag.no_data_requested)
258 res->appliedVariant = make_variant(data->parent, nvars-1, o);
260 if (n->which == DATA1N_tag && n->u.tag.no_data_requested)
262 res->content = odr_malloc(o, sizeof(*res->content));
263 res->content->which = Z_ElementData_noDataRequested;
264 res->content->u.noDataRequested = ODR_NULLVAL;
266 else if (!(res->content = nodetoelementdata(data, select, leaf, o)))
271 Z_GenericRecord *data1_nodetogr(data1_node *n, int select, ODR o)
273 Z_GenericRecord *res = odr_malloc(o, sizeof(*res));
276 res->elements = odr_malloc(o, sizeof(Z_TaggedElement *) * n->num_children);
277 res->num_elements = 0;
278 for (c = n->child; c; c = c->next)
280 if (c->which == DATA1N_tag && select && !c->u.tag.node_selected)
282 if (!(res->elements[res->num_elements++] =
283 nodetotaggedelement(c, select, o)))