2 * Copyright (c) 1995, Index Data.
3 * See the file LICENSE for details.
4 * Sebastian Hammer, Adam Dickmeiss
6 * $Log: d1_doespec.c,v $
7 * Revision 1.3 1995-11-13 09:27:33 quinn
8 * Fiddling with the variant stuff.
10 * Revision 1.2 1995/11/01 13:54:45 quinn
13 * Revision 1.1 1995/11/01 11:56:07 quinn
14 * Added Retrieval (data management) functions en masse.
26 static int match_children(data1_node *n, Z_Espec1 *e, int i, Z_ETagUnit **t,
29 static int match_children_wildpath(data1_node *n, Z_Espec1 *e, int i,
30 Z_ETagUnit **t, int num)
34 * Locate a specific triple within a variant.
35 * set is the set to look for, universal set is the set that applies to a
36 * triple with an unknown set.
38 static Z_Triple *find_triple(Z_Variant *var, oid_value universalset,
39 oid_value set, int class, int type)
42 oident *defaultsetent = oid_getentbyoid(var->globalVariantSetId);
43 oid_value defaultset = defaultsetent ? defaultsetent->value :
46 for (i = 0; i < var->num_triples; i++)
49 oid_getentbyoid(var->triples[i]->variantSetId);
50 oid_value curset = cursetent ? cursetent->value : defaultset;
53 *var->triples[i]->class == class &&
54 *var->triples[i]->type == type)
55 return var->triples[i];
60 static void mark_subtree(data1_node *n, int make_variantlist, int no_data,
65 if (n->which == DATA1N_tag && (!n->child || n->child->which != DATA1N_tag))
67 n->u.tag.node_selected = 1;
68 n->u.tag.make_variantlist = make_variantlist;
69 n->u.tag.no_data_requested = no_data;
72 for (c = n->child; c; c = c->next)
74 if (c->which == DATA1N_tag && (!n->child ||
75 n->child->which != DATA1N_tag))
77 c->u.tag.node_selected = 1;
78 c->u.tag.make_variantlist = make_variantlist;
79 c->u.tag.no_data_requested = no_data;
81 mark_subtree(c, make_variantlist, no_data, vreq);
85 static int match_children_here(data1_node *n, Z_Espec1 *e, int i,
86 Z_ETagUnit **t, int num)
88 int counter = 0, hits = 0;
93 for (c = n->child; c ; c = c->next)
97 if (c->which != DATA1N_tag)
100 if (tp->which == Z_ETagUnit_specificTag)
102 Z_SpecificTag *want = tp->u.specificTag;
103 occur = want->occurrences;
104 if (c->u.tag.element)
105 tag = c->u.tag.element->tag;
106 if (*want->tagType != (tag ? tag->tagset->type : 3))
108 if (want->tagValue->which == Z_StringOrNumeric_numeric)
110 if (!tag || tag->which != DATA1T_numeric)
112 if (*want->tagValue->u.numeric != tag->value.numeric)
117 assert(want->tagValue->which == Z_StringOrNumeric_string);
118 if (tag && tag->which != DATA1T_string)
120 if (data1_matchstr(want->tagValue->u.string,
121 tag ? tag->value.string : c->u.tag.tag))
126 occur = tp->u.wildThing;
129 * Ok, so we have a matching tag. Are we within occurrences-range?
132 if (occur && occur->which == Z_Occurrences_last)
134 logf(LOG_WARN, "Can't do occurrences=last (yet)");
137 if (!occur || occur->which == Z_Occurrences_all ||
138 (occur->which == Z_Occurrences_values && counter >=
139 *occur->u.values->start))
141 if (match_children(c, e, i, t + 1, num - 1))
143 c->u.tag.node_selected = 1;
145 * Consider the variant specification if this is a complete
150 int show_variantlist = 0;
153 e->elements[i]->u.simpleElement->variantRequest;
154 oident *defset = oid_getentbyoid(e->defaultVariantSetId);
155 oid_value defsetval = defset ? defset->value : VAL_NONE;
156 oid_value var1 = oid_getvalbyname("Variant-1");
159 vreq = e->defaultVariantRequest;
164 * 6,5: meta-data requested, variant list.
166 if (find_triple(vreq, defsetval, var1, 6, 5))
167 show_variantlist = 1;
169 * 9,1: Miscellaneous, no data requested.
171 if (find_triple(vreq, defsetval, var1, 9, 1))
174 mark_subtree(c, show_variantlist, no_data, vreq);
178 * have we looked at enough children?
180 if (!occur || (occur->which == Z_Occurrences_values &&
181 counter - *occur->u.values->start >=
182 *occur->u.values->howMany - 1))
190 static int match_children(data1_node *n, Z_Espec1 *e, int i, Z_ETagUnit **t,
199 case Z_ETagUnit_wildThing:
200 case Z_ETagUnit_specificTag: res = match_children_here(n, e, i,
202 case Z_ETagUnit_wildPath: res = match_children_wildpath(n, e, i,
210 int data1_doespec1(data1_node *n, Z_Espec1 *e)
214 for (i = 0; i < e->num_elements; i++)
216 if (e->elements[i]->which != Z_ERequest_simpleElement)
218 match_children(n, e, i, e->elements[i]->u.simpleElement->path->tags,
219 e->elements[i]->u.simpleElement->path->num_tags);