-/*
- * $Source$
- * $Author$
- * $Header$
- *
- * Copyright (C) 1987 by the Massachusetts Institute of Technology
+/* $Id$
*
+ * Copyright (C) 1987-1998 by the Massachusetts Institute of Technology
+ * For copying and distribution information, please see the file
+ * <mit-copyright.h>.
*/
-#ifndef lint
-static char *rcsid_qsubs_c = "$Header$";
-#endif lint
-
-#include <sms.h>
+#include <mit-copyright.h>
+#include "mr_server.h"
#include "query.h"
-extern struct query Queries1[], Queries2[];
-extern int QueryCount1, QueryCount2;
+#include <stdlib.h>
+
+RCSID("$Header$");
+
+extern struct query Queries[];
+extern int QueryCount;
+
+int qcmp(const void *q1, const void *q2);
-struct query *
-get_query_by_name(name, version)
- register char *name;
- int version;
+struct query *get_query_by_name(char *name, int version)
{
- register struct query *q;
- register int i;
-
- if (version == SMS_VERSION_1) {
- q = Queries1;
- i = QueryCount1;
- } else {
- q = Queries2;
- i = QueryCount2;
- }
-
- if (strlen(name) == 4) {
- while (--i >= 0) {
- if (!strcmp(q->shortname, name)) return(q);
- q++;
+ int i;
+
+ i = QueryCount;
+
+ if (strlen(name) == 4)
+ {
+ while (--i >= 0)
+ {
+ if (!strcmp(Queries[i].shortname, name) &&
+ Queries[i].version <= version)
+ return &Queries[i];
}
- } else {
- while (--i >= 0) {
- if (!strcmp(q->name, name)) return(q);
- q++;
+ }
+ else
+ {
+ while (--i >= 0)
+ {
+ if (!strcmp(Queries[i].name, name) &&
+ Queries[i].version <= version)
+ return &Queries[i];
}
}
- return((struct query *)0);
+ return NULL;
}
-list_queries(version, action, actarg)
- int version;
- int (*action)();
- int actarg;
+void list_queries(client *cl, int (*action)(int, char *[], void *),
+ void *actarg)
{
- register struct query *q;
- register int i;
- static struct query **squeries1 = (struct query **)0;
- static struct query **squeries2 = (struct query **)0;
- register struct query **sq;
+ struct query **squeries = NULL;
+ int qcount;
+ struct query *q, **sq;
char qnames[80];
char *qnp;
- int count;
- int qcmp();
-
- if (version == SMS_VERSION_1) {
- count = QueryCount1;
- if (squeries1 == (struct query **)0) {
- sq = (struct query **)malloc(count * sizeof (struct query *));
- squeries1 = sq;
- q = Queries1;
- for (i = count; --i >= 0; )
- *sq++ = q++;
- qsort(squeries1, count, sizeof (struct query *), qcmp);
- }
- sq = squeries1;
- } else {
- count = QueryCount2;
- if (squeries2 == (struct query **)0) {
- sq = (struct query **)malloc(count * sizeof (struct query *));
- squeries2 = sq;
- q = Queries2;
- for (i = count; --i >= 0; )
- *sq++ = q++;
- qsort(squeries2, count, sizeof (struct query *), qcmp);
- }
- sq = squeries2;
- }
+ 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 = count; --i >= 0; sq++) {
+ 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);
}
-help_query(q, action, actarg)
- register struct query *q;
- int (*action)();
- int actarg;
+void help_query(struct query *q, int (*action)(int, char *[], void *),
+ void *actarg)
{
- register int argcount;
- register int i;
- char argn[32];
- char qname[512];
- char argr[512];
- char *argv[32];
-
- argcount = q->argc;
- if (q->type == UPDATE || q->type == APPEND) argcount += q->vcnt;
-
- switch (argcount) {
+ int argcount;
+ int i;
+ char argn[32];
+ char qname[512];
+ char argr[512];
+ char *argv[32];
+
+ argcount = q->argc;
+ if (q->type == UPDATE || q->type == APPEND)
+ argcount += q->vcnt;
+
+ switch (argcount)
+ {
case 0:
- sprintf(qname, " %s, %s ()", q->name, q->shortname);
- argv[0] = qname;
- argcount = 1;
- break;
+ 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;
+ 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;
+ 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;
+ 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 == 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 (q->type == 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];
+ }
}
- (*action)(argcount, argv, actarg);
+ (*action)(argcount, argv, actarg);
}
-qcmp(q1, q2)
- struct query **q1;
- struct query **q2;
+int qcmp(const void *q1, const void *q2)
{
- return(strcmp((*q1)->name, (*q2)->name));
+ return strcmp((*(struct query **)q1)->name, (*(struct query **)q2)->name);
}
andersk / moira.git / blobdiff