- 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++;
- }
+ 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++;
- 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]);
- }
- return((char *)0);
+ 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]);
+ }
+ return((char *)0);
}
put_field(q, argv, name, value)
}
put_field(q, argv, name, 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);
- }
+ 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);
- 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;
+ 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;
- if (sq->q_lastget == (struct save_queue *)0) {
- sq->q_lastget = sq->q_next;
- } else {
- sq->q_lastget = sq->q_lastget->q_next;
- }
-
- if (sq->q_lastget == sq) return(0);
- *data = sq->q_lastget->q_data;
- return(1);
+ if (sq->q_lastget == (struct save_queue *)0) {
+ sq->q_lastget = sq->q_next;
+ } else {
+ sq->q_lastget = sq->q_lastget->q_next;
+ }
+
+ if (sq->q_lastget == sq) return(0);
+ *data = sq->q_lastget->q_data;
+ return(1);