6 * Copyright (C) 1989 by the Massachusetts Institute of Technology
7 * For copying and distribution information, please see the file
13 static char *rcsid_qrtn_qc = "$Header$";
16 #include <mit-copyright.h>
19 #include "sms_server.h"
25 /* structures to save before args */
26 static char beforeb[MAXARGC][ARGLEN];
27 static char *before[MAXARGC];
28 ##char *barg0, *barg1, *barg2, *barg3, *barg4;
29 ##char *barg5, *barg6, *barg7, *barg8, *barg9;
30 ##char *barg10, *barg11, *barg12, *barg13, *barg14;
32 static char *beforetable;
34 /* structures to save after args */
35 static char afterb[MAXARGC][ARGLEN];
36 static char *after[MAXARGC];
37 ##char *aarg0, *aarg1, *aarg2, *aarg3, *aarg4;
38 ##char *aarg5, *aarg6, *aarg7, *aarg8, *aarg9;
39 ##char *aarg10, *aarg11, *aarg12, *aarg13, *aarg14;
42 /* structures to save entire sets of incremental changes */
43 struct save_queue *incremental_sq = NULL;
57 for (i = 0; i < MAXARGC; i++) {
58 before[i] = &beforeb[i][0];
59 after[i] = &afterb[i][0];
91 if (incremental_sq == NULL)
92 incremental_sq = sq_create();
96 ##incremental_before(table, qual, argv)
106 if (!strcmp(table, "users")) {
107 ## retrieve (barg0 = u.login, barg1 = text(u.uid),
108 ## barg2 = u.shell, barg3 = u.last, barg4 = u.first,
109 ## barg5 = u.middle, barg6 = text(u.status),
110 ## barg7 = u.mit_id, barg8 = u.mit_year)
113 } else if (!strcmp(table, "machine")) {
114 ## retrieve (barg0 = m.name, barg1 = m.type) where qual
116 } else if (!strcmp(table, "cluster")) {
117 ## retrieve (barg0 = c.name, barg1 = c.desc, barg2 = c.location)
120 } else if (!strcmp(table, "mcmap")) {
121 strcpy(barg0, argv[0]);
122 strcpy(barg1, argv[1]);
124 } else if (!strcmp(table, "svc")) {
125 strcpy(barg0, argv[0]);
126 strcpy(barg1, argv[1]);
127 strcpy(barg2, argv[2]);
129 } else if (!strcmp(table, "filesys")) {
130 ## range of fs is filesys
131 ## retrieve (barg0 = fs.label, barg1 = fs.type, barg2 = text(fs.mach_id),
132 ## barg3 = fs.name, barg4 = fs.mount, barg5 = fs.access,
133 ## barg6 = fs.comments, barg7 = text(fs.owner),
134 ## barg8 = text(fs.owners), barg9 = text(fs.createflg),
135 ## barg10 = fs.lockertype)
138 } else if (!strcmp(table, "nfsquota")) {
139 strcpy(barg0, argv[0]);
140 strcpy(barg1, argv[1]);
141 sprintf(buffer, "%s and filesys.filsys_id = nq.filsys_id", qual);
143 ## range of nq is nfsquota
144 ## retrieve (barg2 = text(nq.quota), barg3 = filesys.name) where qual
146 } else if (!strcmp(table, "list")) {
147 ## retrieve (barg0 = l.name, barg1 = text(l.active),
148 ## barg2 = text(l.public), barg3 = text(l.hidden),
149 ## barg4 = text(l.maillist), barg5 = text(l.group),
150 ## barg6 = text(l.gid), barg7 = l.acl_type,
151 ## barg8 = text(l.acl_id), barg9 = l.desc)
154 } else if (!strcmp(table, "members")) {
156 ## repeat retrieve (barg0 = list.name) where list.list_id = @id
157 strcpy(barg1, argv[1]);
159 if (!strcmp(barg1, "USER")) {
160 ## repeat retrieve (barg2 = users.login) where users.users_id = @id
161 } else if (!strcmp(barg1, "LIST")) {
162 ## repeat retrieve (barg2 = list.name) where list.list_id = @id
163 } else if (!strcmp(barg1, "STRING")) {
164 ## repeat retrieve (barg2 = strings.string)
165 ## where strings.string_id = @id
166 } else if (!strcmp(barg1, "KERBEROS")) {
167 ## repeat retrieve (barg2 = strings.string)
168 ## where strings.string_id = @id
172 com_err(whoami, 0, "unknown table in incremental_before"); */
176 incremental_clear_before()
181 incremental_clear_after()
183 incremental_after("clear", 0);
188 ##incremental_after(table, qual, argv)
198 if (!strcmp(table, "users")) {
199 ## retrieve (aarg0 = u.login, aarg1 = text(u.uid),
200 ## aarg2 = u.shell, aarg3 = u.last, aarg4 = u.first,
201 ## aarg5 = u.middle, aarg6 = text(u.status),
202 ## aarg7 = u.mit_id, aarg8 = u.mit_year)
205 } else if (!strcmp(table, "machine")) {
206 ## retrieve (aarg0 = m.name, aarg1 = m.type) where qual
208 } else if (!strcmp(table, "cluster")) {
209 ## retrieve (aarg0 = c.name, aarg1 = c.desc, aarg2 = c.location)
212 } else if (!strcmp(table, "mcmap")) {
213 strcpy(aarg0, argv[0]);
214 strcpy(aarg1, argv[1]);
216 } else if (!strcmp(table, "svc")) {
217 strcpy(aarg0, argv[0]);
218 strcpy(aarg1, argv[1]);
219 strcpy(aarg2, argv[2]);
221 } else if (!strcmp(table, "filesys")) {
222 ## range of fs is filesys
223 ## retrieve (aarg0 = fs.label, aarg1 = fs.type,
224 ## aarg2 = text(fs.mach_id),
225 ## aarg3 = fs.name, aarg4 = fs.mount, aarg5 = fs.access,
226 ## aarg6 = fs.comments, aarg7 = text(fs.owner),
227 ## aarg8 = text(fs.owners), aarg9 = text(fs.createflg),
228 ## aarg10 = fs.lockertype)
231 } else if (!strcmp(table, "nfsquota")) {
232 strcpy(aarg0, argv[0]);
233 strcpy(aarg1, argv[1]);
234 sprintf(buffer, "%s and filesys.filsys_id = nq.filsys_id", qual);
236 ## range of nq is nfsquota
237 ## retrieve (aarg2 = text(nq.quota), aarg3 = filesys.name) where qual
239 } else if (!strcmp(table, "list")) {
240 ## retrieve (aarg0 = l.name, aarg1 = text(l.active),
241 ## aarg2 = text(l.public), aarg3 = text(l.hidden),
242 ## aarg4 = text(l.maillist), aarg5 = text(l.group),
243 ## aarg6 = text(l.gid), aarg7 = l.acl_type,
244 ## aarg8 = text(l.acl_id), aarg9 = l.desc)
247 } else if (!strcmp(table, "members")) {
249 ## repeat retrieve (aarg0 = list.name) where list.list_id = @id
250 strcpy(aarg1, argv[1]);
252 if (!strcmp(aarg1, "USER")) {
253 ## repeat retrieve (aarg2 = users.login) where users.users_id = @id
254 } else if (!strcmp(aarg1, "LIST")) {
255 ## repeat retrieve (aarg2 = list.name) where list.list_id = @id
256 } else if (!strcmp(aarg1, "STRING")) {
257 ## repeat retrieve (aarg2 = strings.string)
258 ## where strings.string_id = @id
259 } else if (!strcmp(aarg1, "KERBEROS")) {
260 ## repeat retrieve (aarg2 = strings.string)
261 ## where strings.string_id = @id
264 } else if (!strcmp(table, "clear")) {
268 com_err(whoami, 0, "unknown table in incremental_after"); */
270 iu = (struct iupdate *) malloc(sizeof(struct iupdate));
272 iu->beforec = beforec;
273 iu->before = copy_argv(before, beforec);
275 iu->after = copy_argv(after, afterc);
276 sq_save_data(incremental_sq, iu);
279 sprintf(buffer, "INCREMENTAL(%s, [", table);
280 for (i = 0; i < beforec; i++) {
282 strcat(buffer, strtrim(before[0]));
284 strcat(buffer, ", ");
285 strcat(buffer, strtrim(before[i]));
288 strcat(buffer, "], [");
289 for (i = 0; i < afterc; i++) {
291 strcat(buffer, strtrim(after[0]));
293 strcat(buffer, ", ");
294 strcat(buffer, strtrim(after[i]));
297 strcat(buffer, "])");
298 com_err(whoami, 0, buffer);
303 /* Called when the current transaction is committed to start any queued
304 * incremental updates
310 char *argv[MAXARGC * 2 + 4], cafter[3], cbefore[3];
313 while (sq_get_data(incremental_sq, &iu)) {
315 sprintf(cbefore, "%d", iu->beforec);
317 sprintf(cafter, "%d", iu->afterc);
319 for (i = 0; i < iu->beforec; i++)
320 argv[4 + i] = iu->before[i];
321 for (i = 0; i < iu->afterc; i++)
322 argv[4 + iu->beforec + i] = iu->after[i];
323 invoke_updates(argv, 4 + iu->beforec + iu->afterc);
324 free_argv(iu->before, iu->beforec);
325 free_argv(iu->after, iu->afterc);
328 sq_destroy(incremental_sq);
329 incremental_sq = sq_create();
333 /* Actually start incremental updates. This caches the update table
334 * the first time it is called.
338 struct inc_cache *next;
344 invoke_updates(argv, argc)
348 static int inited = 0;
349 static struct inc_cache *cache;
351 ## char tab[17], serv[17];
358 ## retrieve (tab = incremental.table, serv = incremental.service) {
359 c = (struct inc_cache *)malloc(sizeof(struct inc_cache));
361 c->table = strsave(strtrim(tab));
362 c->service = strsave(strtrim(serv));
367 for (c = cache; c; c = c->next) {
368 if (!strcmp(c->table, argv[1])) {
369 sprintf(prog, "/u1/sms/bin/%s.incr", c->service);
371 com_err(whoami, 0, "forking %s", prog);
378 for (i = getdtablesize() - 1; i > 2; i--)
383 com_err(whoami, 0, "Failed to start incremental update");
393 /* Called when the current transaction is aborted to throw away any queued
394 * incremental updates
401 while (sq_get_data(incremental_sq, &iu)) {
402 free_argv(iu->before, iu->beforec);
403 free_argv(iu->after, iu->afterc);
406 sq_destroy(incremental_sq);
407 incremental_sq = sq_create();
411 char **copy_argv(argv, argc)
415 char **ret = (char **)malloc(sizeof(char *) * argc);
417 ret[argc] = strsave(strtrim(argv[argc]));
421 free_argv(argv, argc)