--- /dev/null
+/* $Id: xcqlutil.c,v 1.1 2003-01-06 08:20:27 adam Exp $
+ Copyright (C) 2002-2003
+ Index Data Aps
+
+This file is part of the YAZ toolkit.
+
+See the file LICENSE.
+*/
+#include <stdlib.h>
+#include <string.h>
+#include <stdio.h>
+
+#include <yaz/cql.h>
+
+static void pr_n(const char *buf,
+ void (*pr)(const char *buf, void *client_data),
+ void *client_data, int n)
+{
+ int i;
+ for (i = 0; i<n; i++)
+ (*pr)(" ", client_data);
+ (*pr)(buf, client_data);
+}
+
+static void pr_cdata(const char *buf,
+ void (*pr)(const char *buf, void *client_data),
+ void *client_data)
+{
+ const char *src = buf;
+ char bf[2];
+ while (*src)
+ {
+ switch(*src)
+ {
+ case '&':
+ (*pr)("&", client_data);
+ break;
+ case '<':
+ (*pr)("<", client_data);
+ break;
+ case '>':
+ (*pr)(">", client_data);
+ break;
+ default:
+ bf[0] = *src;
+ bf[1] = 0;
+ (*pr)(bf, client_data);
+ }
+ src++;
+ }
+}
+
+static void prefixes(struct cql_node *cn,
+ void (*pr)(const char *buf, void *client_data),
+ void *client_data, int level)
+{
+ if (cn)
+ {
+ pr_n("<prefixes>\n", pr, client_data, level);
+ for (; cn; cn = cn->u.mod.next)
+ {
+ pr_n("<prefix>\n", pr, client_data, level+2);
+ if (cn->u.mod.name)
+ {
+ pr_n("<name>", pr, client_data, level+4);
+ pr_cdata(cn->u.mod.name, pr, client_data);
+ pr_n("</name>\n", pr, client_data, 0);
+ }
+ if (cn->u.mod.value)
+ {
+ pr_n("<identifier>", pr, client_data, level+4);
+ pr_cdata(cn->u.mod.value, pr, client_data);
+ pr_n("</identifier>\n", pr, client_data, 0);
+ }
+ pr_n("</prefix>\n", pr, client_data, level+2);
+ }
+ pr_n("</prefixes>\n", pr, client_data, level);
+ }
+}
+
+static void cql_to_xml_r(struct cql_node *cn,
+ void (*pr)(const char *buf, void *client_data),
+ void *client_data, int level)
+{
+ if (!cn)
+ return;
+ switch (cn->which)
+ {
+ case CQL_NODE_ST:
+ pr_n("<searchClause>\n", pr, client_data, level);
+ prefixes(cn->u.st.prefixes, pr, client_data, level+2);
+ if (cn->u.st.index)
+ {
+ pr_n("<index>", pr, client_data, level+2);
+ pr_cdata(cn->u.st.index, pr, client_data);
+ pr_n("</index>\n", pr, client_data, 0);
+ }
+ if (cn->u.st.relation)
+ {
+ struct cql_node *m = cn->u.st.modifiers;
+ pr_n("<relation>\n", pr, client_data, level+2);
+ pr_n("<value>", pr, client_data, level+4);
+ pr_cdata(cn->u.st.relation, pr, client_data);
+ pr_n("</value>\n", pr, client_data, 0);
+ if (m)
+ {
+ pr_n("<modifiers>\n", pr, client_data, level+4);
+ for (; m; m = m->u.mod.next)
+ {
+ pr_n("<modifier><value>", pr, client_data, level+6);
+ pr_cdata(m->u.mod.value, pr, client_data);
+ pr_n("</value></modifier>\n", pr, client_data, 0);
+ }
+ pr_n("</modifiers>\n", pr, client_data, level+4);
+ }
+ pr_n("</relation>\n", pr, client_data, level+2);
+ }
+ if (cn->u.st.term)
+ {
+ pr_n("<term>", pr, client_data, level+2);
+ pr_cdata(cn->u.st.term, pr, client_data);
+ pr_n("</term>\n", pr, client_data, 0);
+ }
+ pr_n("</searchClause>\n", pr, client_data, level);
+ break;
+ case CQL_NODE_BOOL:
+ pr_n("<triple>\n", pr, client_data, level);
+ prefixes(cn->u.st.prefixes, pr, client_data, level+2);
+ if (cn->u.bool.value)
+ {
+ struct cql_node *m = cn->u.bool.modifiers;
+ pr_n("<boolean>\n", pr, client_data, level+2);
+
+ pr_n("<value>", pr, client_data, level+4);
+ pr_cdata(cn->u.bool.value, pr, client_data);
+ pr_n("</value>\n", pr, client_data, 0);
+
+ if (m)
+ {
+ pr_n("<modifiers>\n", pr, client_data, level+4);
+ for (; m; m = m->u.mod.next)
+ {
+ pr_n("<modifier><type>", pr, client_data, level+6);
+ pr_cdata(m->u.mod.name, pr, client_data);
+ pr_n("</type>", pr, client_data, 0);
+ if (m->u.mod.value)
+ {
+ pr_n("<value>", pr, client_data, 0);
+ pr_cdata(m->u.mod.value, pr, client_data);
+ pr_n("</value>", pr, client_data, 0);
+ }
+ pr_n("</modifier>\n", pr, client_data, 0);
+ }
+ pr_n("</modifiers>\n", pr, client_data, level+4);
+ }
+ pr_n("</boolean>\n", pr, client_data, level+2);
+ }
+ if (cn->u.bool.left)
+ {
+ printf ("%*s<leftOperand>\n", level+2, "");
+ cql_to_xml_r(cn->u.bool.left, pr, client_data, level+4);
+ printf ("%*s</leftOperand>\n", level+2, "");
+ }
+ if (cn->u.bool.right)
+ {
+ printf ("%*s<rightOperand>\n", level+2, "");
+ cql_to_xml_r(cn->u.bool.right, pr, client_data, level+4);
+ printf ("%*s</rightOperand>\n", level+2, "");
+ }
+ pr_n("</triple>\n", pr, client_data, level);
+ }
+}
+
+void cql_to_xml(struct cql_node *cn,
+ void (*pr)(const char *buf, void *client_data),
+ void *client_data)
+{
+ cql_to_xml_r(cn, pr, client_data, 0);
+}
+
+void cql_to_xml_stdio(struct cql_node *cn, FILE *f)
+{
+ cql_to_xml(cn, cql_fputs, f);
+}
+
+void cql_buf_write_handler (const char *b, void *client_data)
+{
+ struct cql_buf_write_info *info = client_data;
+ int l = strlen(b);
+ if (info->off < 0 || (info->off + l >= info->max))
+ {
+ info->off = -1;
+ return;
+ }
+ memcpy (info->buf + info->off, b, l);
+ info->off += l;
+}
+
+int cql_to_xml_buf(struct cql_node *cn, char *out, int max)
+{
+ struct cql_buf_write_info info;
+ info.off = 0;
+ info.max = max;
+ info.buf = out;
+ cql_to_xml(cn, cql_buf_write_handler, &info);
+ if (info.off >= 0)
+ info.buf[info.off] = '\0';
+ return info.off;
+}
+