3 * Copyright (C) 1987-1998 by the Massachusetts Institute of Technology
4 * For copying and distribution information, please see the file
8 #include <mit-copyright.h>
16 extern struct query Queries2[];
17 extern int QueryCount2;
19 int qcmp(const void *q1, const void *q2);
21 struct query *get_query_by_name(char *name, int version)
29 if (strlen(name) == 4)
33 if (!strcmp(q->shortname, name))
42 if (!strcmp(q->name, name))
51 void list_queries(int version, int (*action)(int, char *[], void *),
56 static struct query **squeries2 = NULL;
65 sq = malloc(count * sizeof(struct query *));
68 for (i = count; --i >= 0; )
70 qsort(squeries2, count, sizeof(struct query *), qcmp);
75 for (i = count; --i >= 0; sq++)
77 sprintf(qnames, "%s (%s)", (*sq)->name, (*sq)->shortname);
78 (*action)(1, &qnp, actarg);
80 strcpy(qnames, "_help");
81 (*action)(1, &qnp, actarg);
82 strcpy(qnames, "_list_queries");
83 (*action)(1, &qnp, actarg);
84 strcpy(qnames, "_list_users");
85 (*action)(1, &qnp, actarg);
88 void help_query(struct query *q, int (*action)(int, char *[], void *),
99 if (q->type == UPDATE || q->type == APPEND)
105 sprintf(qname, " %s, %s ()", q->name, q->shortname);
111 sprintf(qname, " %s, %s (%s)", q->name, q->shortname, q->fields[0]);
117 sprintf(qname, " %s, %s (%s, %s)", q->name, q->shortname,
118 q->fields[0], q->fields[1]);
124 sprintf(qname, " %s, %s (%s", q->name, q->shortname, q->fields[0]);
127 for (i = 1; i < argcount; i++)
128 argv[i] = q->fields[i];
129 sprintf(argn, "%s)", q->fields[argcount]);
130 argv[argcount++] = argn;
134 if (q->type == RETRIEVE)
136 sprintf(argr, "%s => %s", argv[--argcount], q->fields[q->argc]);
137 argv[argcount++] = argr;
140 for (i = q->argc + 1; i < q->vcnt + q->argc; i++)
141 argv[argcount++] = q->fields[i];
144 (*action)(argcount, argv, actarg);
147 int qcmp(const void *q1, const void *q2)
149 return strcmp((*(struct query **)q1)->name, (*(struct query **)q2)->name);