6 * Copyright (C) 1987 by the Massachusetts Institute of Technology
9 * Revision 1.8 1987-07-16 15:43:19 wesommer
10 * Fixed bug where the argv was not copied to private storage
11 * (it got changed out from under us before it got sent..).
13 * Revision 1.7 87/07/14 00:39:01 wesommer
16 * Revision 1.6 87/06/30 20:04:43 wesommer
17 * Free returned tuples when possible.
19 * Revision 1.5 87/06/26 10:55:53 wesommer
20 * Added sms_access, now paiys attention to return code from
21 * sms_process_query, sms_check_access.
23 * Revision 1.4 87/06/21 16:42:00 wesommer
24 * Performance work, rearrangement of include files.
26 * Revision 1.3 87/06/04 01:35:01 wesommer
27 * Added a working query request handler.
29 * Revision 1.2 87/06/03 16:07:50 wesommer
32 * Revision 1.1 87/06/02 20:07:10 wesommer
38 static char *rcsid_sms_scall_c = "$Header$";
43 #include "sms_server.h"
47 extern char *malloc();
49 extern void clist_delete(), do_auth(), do_shutdown();
53 * Welcome to the (finite state) machine (highest level).
60 if (OP_STATUS(cp->pending_op) == OP_CANCELLED) {
61 (void) sprintf(buf1, "Closed connection (now %d client%s)",
64 com_err(whoami, 0, buf1);
71 /* Start recieving next request */
72 initialize_operation(cp->pending_op, sms_start_recv,
73 (char *)&cp->args, (int (*)())NULL);
74 queue_operation(cp->con, CON_INPUT, cp->pending_op);
75 cp->action = CL_RECEIVE;
78 /* Data is here. Process it & start it heading back */
79 do_call(cp); /* This may block for a while. */
80 initialize_operation(cp->pending_op, sms_start_send,
81 (char *)&cp->reply, (int (*)())NULL);
82 queue_operation(cp->con, CON_OUTPUT, cp->pending_op);
102 cl->reply.sms_argc = 0;
103 cl->reply.sms_status = 0;
104 if (((pn = cl->args->sms_procno) < 0) ||
105 (pn > SMS_MAX_PROC)) {
106 com_err(whoami, 0, "procno out of range");
107 cl->reply.sms_status = SMS_UNKNOWN_PROC;
110 if (log_flags & LOG_ARGS)
111 log_args(procnames[pn], cl->args->sms_argc,
113 else if (log_flags & LOG_REQUESTS)
114 com_err(whoami, 0, procnames[pn]);
118 cl->reply.sms_status = 0;
142 register returned_tuples *temp;
143 for (temp=cp->first; temp && OP_DONE(temp->op); ) {
144 register returned_tuples *t1=temp;
146 if (t1 == cp->last) cp->last = NULL;
148 sms_destroy_reply(t1->retval);
151 register sms_params *p = t1->retval;
152 if (p->sms_flattened)
153 free(p->sms_flattened);
159 delete_operation(t1->op);
165 retr_callback(argc, argv, p_cp)
167 register char **argv;
170 register client *cp = (client *)p_cp;
172 * This takes too much advantage of the fact that
173 * serialization of the data happens during the queue operation.
175 sms_params *arg_tmp = (sms_params *)db_alloc(sizeof(sms_params));
176 returned_tuples *tp = (returned_tuples *)
177 db_alloc(sizeof(returned_tuples));
178 register char **nargv = (char **)malloc(argc * sizeof(char *));
181 OPERATION op_tmp = create_operation();
183 if (log_flags & LOG_RESP)
184 log_args("return: ", argc, argv);
187 tp->retval = arg_tmp;
190 arg_tmp->sms_status = SMS_MORE_DATA;
191 arg_tmp->sms_argc = argc;
192 arg_tmp->sms_argv = nargv;
193 for (i = 0; i < argc; i++) {
194 register int len = strlen(argv[i]) + 1;
195 nargv[i] = malloc(len);
196 bcopy(argv[i], nargv[i], len);
198 arg_tmp->sms_flattened = (char *)NULL;
199 arg_tmp->sms_argl = (int *)NULL;
205 cp->last = cp->first = tp;
208 reset_operation(op_tmp);
209 initialize_operation(op_tmp, sms_start_send, (char *)arg_tmp,
211 queue_operation(cp->con, CON_OUTPUT, op_tmp);
218 cl->reply.sms_argc = 0;
219 cl->reply.sms_status = 0;
221 cl->reply.sms_status =
222 sms_process_query(cl,
223 cl->args->sms_argv[0],
224 cl->args->sms_argc-1,
225 cl->args->sms_argv+1,
228 if (log_flags & LOG_RES)
229 com_err(whoami, 0, "Query complete.");
235 cl->reply.sms_argc = 0;
237 cl->reply.sms_status =
239 cl->args->sms_argv[0],
240 cl->args->sms_argc-1,
241 cl->args->sms_argv+1);
243 com_err(whoami, 0, "Access check complete.");