+/* $Id$
+ *
+ * Copyright (C) 1987-1998 by the Massachusetts Institute of Technology
+ * For copying and distribution information, please see the file
+ * <mit-copyright.h>.
+ */
+
+#include <mit-copyright.h>
+#include "mr_server.h"
#include "query.h"
+#include <stdlib.h>
+
+RCSID("$Header$");
+
extern struct query Queries[];
extern int QueryCount;
-extern struct s_query S_Queries[];
-extern int S_QueryCount;
-
-struct query *
-get_query_by_name(name)
- register char *name;
-{
- register struct query *q;
- register int i;
-
- q = Queries;
- i = QueryCount;
-
- if (strlen(name) == 4) {
- while (--i >= 0) {
- if (!strcmp(q->shortname, name)) return(q);
- q++;
- }
- } else {
- while (--i >= 0) {
- if (!strcmp(q->name, name)) return(q);
- q++;
- }
- }
- return((struct query *)0);
-}
+int qcmp(const void *q1, const void *q2);
-get_input_fields(q, argc, argv)
- register struct query *q;
- int *argc;
- char ***argv;
+struct query *get_query_by_name(char *name, int version)
{
- *argv = q->fields;
- *argc = q->sargc + q->argc;
- if (q->type == UPDATE || q->type == APPEND)
- *argc += q->vcnt;
-}
+ int i;
-get_output_fields(q, argc, argv)
- register struct query *q;
- int *argc;
- char ***argv;
-{
- if (q->type == RETRIEVE) {
- *argc = q->vcnt;
- *argv = &q->fields[q->sargc + q->argc];
- } else {
- *argc = 0;
- *argv = (char **)0;
- }
-}
+ i = QueryCount;
-char *
-get_field(q, argv, name)
- register struct query *q;
- char *argv[];
- char *name;
-{
- register char **fp;
- register char *field;
- register int i;
-
- if (q->type != RETRIEVE) return((char *)0);
-
- if (*name == '*') name++;
- fp = &q->fields[q->sargc + q->argc];
- for (i = 0; i < q->vcnt; i++) {
- field = *fp++;
- if (*field == '*') field++;
- if (!strcmp(field, name)) return(argv[i]);
+ if (strlen(name) == 4)
+ {
+ while (--i >= 0)
+ {
+ if (!strcmp(Queries[i].shortname, name) &&
+ Queries[i].version <= version)
+ return &Queries[i];
}
- return((char *)0);
-}
-
-put_field(q, argv, name, value)
- register struct query *q;
- char *argv[];
- char *name;
- char *value;
-{
- register char **fp;
- register char *field;
- register int i;
- register int n;
-
- n = q->sargc + q->argc;
- if (q->type == UPDATE || q->type == APPEND) n += q->vcnt;
-
- if (*name == '*') name++;
- fp = q->fields;
- for (i = 0; i < n; i++) {
- field = *fp++;
- if (*field == '*') field++;
- if (!strcmp(field, name)) {
- strcpy(argv[i], value);
- return(0);
- }
+ }
+ else
+ {
+ while (--i >= 0)
+ {
+ if (!strcmp(Queries[i].name, name) &&
+ Queries[i].version <= version)
+ return &Queries[i];
}
- return(-1);
-}
+ }
-
-/* Generic Queue Routines */
-
-struct save_queue *
-sq_create()
-{
- register struct save_queue *sq;
-
- sq = (struct save_queue *)malloc(sizeof (struct save_queue));
- sq->q_next = sq;
- sq->q_prev = sq;
- sq->q_lastget = 0;
- return(sq);
+ return NULL;
}
-sq_save_data(sq, data)
- register struct save_queue *sq;
- char *data;
+void list_queries(client *cl, int (*action)(int, char *[], void *),
+ void *actarg)
{
- register struct save_queue *q;
-
- q = (struct save_queue *)malloc(sizeof (struct save_queue));
- q->q_next = sq;
- q->q_prev = sq->q_prev;
- sq->q_prev->q_next = q;
- sq->q_prev = q;
- q->q_data = data;
+ struct query **squeries = NULL;
+ int qcount;
+ struct query *q, **sq;
+ char qnames[80];
+ char *qnp;
+ int i;
+
+ squeries = sq = xmalloc(QueryCount * sizeof(struct query *));
+ q = Queries;
+ for (i = 0; i < QueryCount; i++)
+ {
+ if (q->version > cl->version)
+ {
+ q++;
+ continue;
+ }
+ if (i > 0 && strcmp((*sq)->name, q->name))
+ sq++;
+ *sq = q++;
+ }
+ qcount = (sq - squeries) + 1;
+ qsort(squeries, qcount, sizeof(struct query *), qcmp);
+
+ sq = squeries;
+
+ qnp = qnames;
+ for (i = qcount; --i >= 0; sq++)
+ {
+ sprintf(qnames, "%s (%s)", (*sq)->name, (*sq)->shortname);
+ (*action)(1, &qnp, actarg);
+ }
+ strcpy(qnames, "_help");
+ (*action)(1, &qnp, actarg);
+ strcpy(qnames, "_list_queries");
+ (*action)(1, &qnp, actarg);
+ strcpy(qnames, "_list_users");
+ (*action)(1, &qnp, actarg);
+
+ free(squeries);
}
-sq_get_data(sq, data)
- register struct save_queue *sq;
- register char **data;
+void help_query(struct query *q, int (*action)(int, char *[], void *),
+ void *actarg)
{
- if (sq->q_lastget == (struct save_queue *)0) {
- sq->q_lastget = sq->q_next;
- } else {
- sq->q_lastget = sq->q_lastget->q_next;
+ int argcount;
+ int i;
+ char argn[32];
+ char qname[512];
+ char argr[512];
+ char *argv[32];
+
+ argcount = q->argc;
+ if (q->type == MR_Q_UPDATE || q->type == MR_Q_APPEND)
+ argcount += q->vcnt;
+
+ switch (argcount)
+ {
+ case 0:
+ sprintf(qname, " %s, %s ()", q->name, q->shortname);
+ argv[0] = qname;
+ argcount = 1;
+ break;
+
+ case 1:
+ sprintf(qname, " %s, %s (%s)", q->name, q->shortname, q->fields[0]);
+ argv[0] = qname;
+ argcount = 1;
+ break;
+
+ case 2:
+ sprintf(qname, " %s, %s (%s, %s)", q->name, q->shortname,
+ q->fields[0], q->fields[1]);
+ argv[0] = qname;
+ argcount = 1;
+ break;
+
+ default:
+ sprintf(qname, " %s, %s (%s", q->name, q->shortname, q->fields[0]);
+ argv[0] = qname;
+ argcount--;
+ for (i = 1; i < argcount; i++)
+ argv[i] = q->fields[i];
+ sprintf(argn, "%s)", q->fields[argcount]);
+ argv[argcount++] = argn;
+ break;
+ }
+
+ if (q->type == MR_Q_RETRIEVE)
+ {
+ sprintf(argr, "%s => %s", argv[--argcount], q->fields[q->argc]);
+ argv[argcount++] = argr;
+ if (q->vcnt > 1)
+ {
+ for (i = q->argc + 1; i < q->vcnt + q->argc; i++)
+ argv[argcount++] = q->fields[i];
}
-
- if (sq->q_lastget == sq) return(0);
- *data = sq->q_lastget->q_data;
- return(1);
+ }
+ (*action)(argcount, argv, actarg);
}
-sq_destroy(sq)
- register struct save_queue *sq;
+int qcmp(const void *q1, const void *q2)
{
- register struct save_queue *q;
-
- for (q = sq->q_next; q != sq; q = sq->q_next) {
- sq->q_next = q->q_next;
- free(q);
- }
- free(sq);
+ return strcmp((*(struct query **)q1)->name, (*(struct query **)q2)->name);
}
andersk / moira.git / blobdiff