1 /* This file is part of the YAZ toolkit.
2 * Copyright (C) 1995-2011 Index Data
3 * See the file LICENSE for details.
7 * \brief Implements CQL tree node utilities.
18 void cql_fputs(const char *buf, void *client_data)
20 FILE *f = (FILE *) client_data;
24 struct cql_node *cql_node_dup (NMEM nmem, struct cql_node *cp)
26 struct cql_node *cn = 0;
33 cn = cql_node_mk_sc(nmem, cp->u.st.index,
36 cn->u.st.modifiers = cql_node_dup(nmem, cp->u.st.modifiers);
37 cn->u.st.index_uri = cp->u.st.index_uri ?
38 nmem_strdup(nmem, cp->u.st.index_uri) : 0;
39 cn->u.st.relation_uri = cp->u.st.relation_uri ?
40 nmem_strdup(nmem, cp->u.st.relation_uri) : 0;
43 cn = cql_node_mk_boolean(nmem, cp->u.boolean.value);
44 cn->u.boolean.left = cql_node_dup(nmem, cp->u.boolean.left);
45 cn->u.boolean.right = cql_node_dup(nmem, cp->u.boolean.right);
50 struct cql_node *cql_node_mk_sc(NMEM nmem,
55 struct cql_node *p = (struct cql_node *) nmem_malloc(nmem, sizeof(*p));
56 p->which = CQL_NODE_ST;
59 p->u.st.index = nmem_strdup(nmem, index);
60 p->u.st.index_uri = 0;
63 p->u.st.term = nmem_strdup(nmem, term);
66 p->u.st.relation = nmem_strdup(nmem, relation);
67 p->u.st.relation_uri = 0;
68 p->u.st.modifiers = 0;
69 p->u.st.extra_terms = 0;
73 struct cql_node *cql_node_mk_boolean(NMEM nmem, const char *op)
75 struct cql_node *p = (struct cql_node *) nmem_malloc(nmem, sizeof(*p));
76 p->which = CQL_NODE_BOOL;
77 p->u.boolean.value = 0;
79 p->u.boolean.value = nmem_strdup(nmem, op);
80 p->u.boolean.left = 0;
81 p->u.boolean.right = 0;
82 p->u.boolean.modifiers = 0;
86 struct cql_node *cql_node_mk_sort(NMEM nmem, const char *index,
87 struct cql_node *modifiers)
89 struct cql_node *p = (struct cql_node *) nmem_malloc(nmem, sizeof(*p));
90 p->which = CQL_NODE_SORT;
93 p->u.sort.index = nmem_strdup(nmem, index);
94 p->u.sort.modifiers = modifiers;
99 const char *cql_uri(void)
101 return "info:srw/cql-context-set/1/cql-v1.2";
104 struct cql_node *cql_apply_prefix(NMEM nmem,
105 struct cql_node *n, const char *prefix,
108 if (n->which == CQL_NODE_ST)
110 if (!n->u.st.index_uri && n->u.st.index)
111 { /* not yet resolved.. */
112 const char *cp = strchr(n->u.st.index, '.');
114 strlen(prefix) == (size_t) (cp - n->u.st.index) &&
115 !cql_strncmp(n->u.st.index, prefix, strlen(prefix)))
117 char *nval = nmem_strdup(nmem, cp+1);
118 n->u.st.index_uri = nmem_strdup(nmem, uri);
119 n->u.st.index = nval;
121 else if (!prefix && !cp)
123 n->u.st.index_uri = nmem_strdup(nmem, uri);
126 if (!n->u.st.relation_uri && n->u.st.relation)
128 const char *cp = strchr(n->u.st.relation, '.');
130 strlen(prefix) == (size_t)(cp - n->u.st.relation) &&
131 !cql_strncmp(n->u.st.relation, prefix, strlen(prefix)))
133 char *nval = nmem_strdup(nmem, cp+1);
134 n->u.st.relation_uri = nmem_strdup(nmem, uri);
135 n->u.st.relation = nval;
139 else if (n->which == CQL_NODE_BOOL)
141 cql_apply_prefix(nmem, n->u.boolean.left, prefix, uri);
142 cql_apply_prefix(nmem, n->u.boolean.right, prefix, uri);
147 void cql_node_destroy(struct cql_node *cn)
154 cql_node_destroy(cn->u.st.modifiers);
157 cql_node_destroy(cn->u.boolean.left);
158 cql_node_destroy(cn->u.boolean.right);
159 cql_node_destroy(cn->u.boolean.modifiers);
162 cql_node_destroy(cn->u.sort.search);
163 cql_node_destroy(cn->u.sort.next);
164 cql_node_destroy(cn->u.sort.modifiers);
168 int cql_strcmp(const char *s1, const char *s2)
174 if (c1 >= 'A' && c1 <= 'Z')
175 c1 = c1 + ('a' - 'A');
176 if (c2 >= 'A' && c2 <= 'Z')
177 c2 = c2 + ('a' - 'A');
184 int cql_strncmp(const char *s1, const char *s2, size_t n)
186 while (*s1 && *s2 && n)
190 if (c1 >= 'A' && c1 <= 'Z')
191 c1 = c1 + ('a' - 'A');
192 if (c2 >= 'A' && c2 <= 'Z')
193 c2 = c2 + ('a' - 'A');
206 * c-file-style: "Stroustrup"
207 * indent-tabs-mode: nil
209 * vim: shiftwidth=4 tabstop=8 expandtab