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.4 1996-06-07 11:04:32 quinn
8 * Fixed tag->tagset dependency
10 * Revision 1.3 1995/11/13 09:27:33 quinn
11 * Fiddling with the variant stuff.
13 * Revision 1.2 1995/11/01 13:54:45 quinn
16 * Revision 1.1 1995/11/01 11:56:07 quinn
17 * Added Retrieval (data management) functions en masse.
29 static int match_children(data1_node *n, Z_Espec1 *e, int i, Z_ETagUnit **t,
32 static int match_children_wildpath(data1_node *n, Z_Espec1 *e, int i,
33 Z_ETagUnit **t, int num)
37 * Locate a specific triple within a variant.
38 * set is the set to look for, universal set is the set that applies to a
39 * triple with an unknown set.
41 static Z_Triple *find_triple(Z_Variant *var, oid_value universalset,
42 oid_value set, int class, int type)
45 oident *defaultsetent = oid_getentbyoid(var->globalVariantSetId);
46 oid_value defaultset = defaultsetent ? defaultsetent->value :
49 for (i = 0; i < var->num_triples; i++)
52 oid_getentbyoid(var->triples[i]->variantSetId);
53 oid_value curset = cursetent ? cursetent->value : defaultset;
56 *var->triples[i]->class == class &&
57 *var->triples[i]->type == type)
58 return var->triples[i];
63 static void mark_subtree(data1_node *n, int make_variantlist, int no_data,
68 if (n->which == DATA1N_tag && (!n->child || n->child->which != DATA1N_tag))
70 n->u.tag.node_selected = 1;
71 n->u.tag.make_variantlist = make_variantlist;
72 n->u.tag.no_data_requested = no_data;
75 for (c = n->child; c; c = c->next)
77 if (c->which == DATA1N_tag && (!n->child ||
78 n->child->which != DATA1N_tag))
80 c->u.tag.node_selected = 1;
81 c->u.tag.make_variantlist = make_variantlist;
82 c->u.tag.no_data_requested = no_data;
84 mark_subtree(c, make_variantlist, no_data, vreq);
88 static int match_children_here(data1_node *n, Z_Espec1 *e, int i,
89 Z_ETagUnit **t, int num)
91 int counter = 0, hits = 0;
96 for (c = n->child; c ; c = c->next)
100 if (c->which != DATA1N_tag)
103 if (tp->which == Z_ETagUnit_specificTag)
105 Z_SpecificTag *want = tp->u.specificTag;
106 occur = want->occurrences;
107 if (c->u.tag.element)
108 tag = c->u.tag.element->tag;
109 if (*want->tagType != ((tag && tag->tagset) ? tag->tagset->type :
112 if (want->tagValue->which == Z_StringOrNumeric_numeric)
114 if (!tag || tag->which != DATA1T_numeric)
116 if (*want->tagValue->u.numeric != tag->value.numeric)
121 assert(want->tagValue->which == Z_StringOrNumeric_string);
122 if (tag && tag->which != DATA1T_string)
124 if (data1_matchstr(want->tagValue->u.string,
125 tag ? tag->value.string : c->u.tag.tag))
130 occur = tp->u.wildThing;
133 * Ok, so we have a matching tag. Are we within occurrences-range?
136 if (occur && occur->which == Z_Occurrences_last)
138 logf(LOG_WARN, "Can't do occurrences=last (yet)");
141 if (!occur || occur->which == Z_Occurrences_all ||
142 (occur->which == Z_Occurrences_values && counter >=
143 *occur->u.values->start))
145 if (match_children(c, e, i, t + 1, num - 1))
147 c->u.tag.node_selected = 1;
149 * Consider the variant specification if this is a complete
154 int show_variantlist = 0;
157 e->elements[i]->u.simpleElement->variantRequest;
158 oident *defset = oid_getentbyoid(e->defaultVariantSetId);
159 oid_value defsetval = defset ? defset->value : VAL_NONE;
160 oid_value var1 = oid_getvalbyname("Variant-1");
163 vreq = e->defaultVariantRequest;
168 * 6,5: meta-data requested, variant list.
170 if (find_triple(vreq, defsetval, var1, 6, 5))
171 show_variantlist = 1;
173 * 9,1: Miscellaneous, no data requested.
175 if (find_triple(vreq, defsetval, var1, 9, 1))
178 mark_subtree(c, show_variantlist, no_data, vreq);
182 * have we looked at enough children?
184 if (!occur || (occur->which == Z_Occurrences_values &&
185 counter - *occur->u.values->start >=
186 *occur->u.values->howMany - 1))
194 static int match_children(data1_node *n, Z_Espec1 *e, int i, Z_ETagUnit **t,
203 case Z_ETagUnit_wildThing:
204 case Z_ETagUnit_specificTag: res = match_children_here(n, e, i,
206 case Z_ETagUnit_wildPath: res = match_children_wildpath(n, e, i,
214 int data1_doespec1(data1_node *n, Z_Espec1 *e)
218 for (i = 0; i < e->num_elements; i++)
220 if (e->elements[i]->which != Z_ERequest_simpleElement)
222 match_children(n, e, i, e->elements[i]->u.simpleElement->path->tags,
223 e->elements[i]->u.simpleElement->path->num_tags);