2 * Collect variables across events.
4 * usage: collect [--add|--remove] <checkpoint> <id> <idlist>
6 * Adds ID <id> to the list governed by <checkpoint>.
7 * <id> must be part of the ID list <idlist>.
8 * If all IDs given by <idlist> are listed (ie collect has been
9 * invoked for each ID in <idlist>) collect returns 0, the
10 * number of missing IDs otherwise.
11 * A negative number is returned on error.
13 * Copyright(C) 2007, Hannes Reinecke <hare@suse.de>
15 * This program is free software: you can redistribute it and/or modify
16 * it under the terms of the GNU General Public License as published by
17 * the Free Software Foundation, either version 2 of the License, or
18 * (at your option) any later version.
31 #include <sys/types.h>
34 #include "../../udev/lib/libudev.h"
35 #include "../../udev/lib/libudev-private.h"
37 #define TMPFILE UDEV_PREFIX "/dev/.udev/collect"
39 #define UDEV_ALARM_TIMEOUT 180
48 struct udev_list_node node;
50 enum collect_state state;
53 static struct udev_list_node bunch;
56 /* This can increase dynamically */
57 static size_t bufsize = BUFSIZE;
59 static struct _mate *node_to_mate(struct udev_list_node *node)
64 mate -= offsetof(struct _mate, node);
65 return (struct _mate *)mate;
68 static void sig_alrm(int signo)
73 static void usage(void)
75 printf("usage: collect [--add|--remove] [--debug] <checkpoint> <id> <idlist>\n"
77 " Adds ID <id> to the list governed by <checkpoint>.\n"
78 " <id> must be part of the list <idlist>.\n"
79 " If all IDs given by <idlist> are listed (ie collect has been\n"
80 " invoked for each ID in <idlist>) collect returns 0, the\n"
81 " number of missing IDs otherwise.\n"
82 " On error a negative number is returned.\n"
89 * Prepares the database file
91 static int prepare(char *dir, char *filename)
97 if (stat(dir, &statbuf) < 0)
100 sprintf(buf, "%s/%s", dir, filename);
102 fd = open(buf,O_RDWR|O_CREAT, S_IRUSR|S_IWUSR);
104 fprintf(stderr, "Cannot open %s: %s\n", buf, strerror(errno));
106 if (lockf(fd,F_TLOCK,0) < 0) {
108 fprintf(stderr, "Lock taken, wait for %d seconds\n", UDEV_ALARM_TIMEOUT);
109 if (errno == EAGAIN || errno == EACCES) {
110 alarm(UDEV_ALARM_TIMEOUT);
111 lockf(fd, F_LOCK, 0);
113 fprintf(stderr, "Acquired lock on %s\n", buf);
116 fprintf(stderr, "Could not get lock on %s: %s\n", buf, strerror(errno));
124 * Read checkpoint file
126 * Tricky reading this. We allocate a buffer twice as large
127 * as we're goint to read. Then we read into the upper half
128 * of that buffer and start parsing.
129 * Once we do _not_ find end-of-work terminator (whitespace
130 * character) we move the upper half to the lower half,
131 * adjust the read pointer and read the next bit.
132 * Quite clever methinks :-)
133 * I should become a programmer ...
135 * Yes, one could have used fgets() for this. But then we'd
136 * have to use freopen etc which I found quite tedious.
138 static int checkout(int fd)
141 char *buf, *ptr, *word = NULL;
146 buf = calloc(1,bufsize + 1);
148 fprintf(stderr, "Out of memory\n");
151 memset(buf, ' ', bufsize);
153 while ((read(fd, buf + len, len)) > 0) {
154 while (ptr && *ptr) {
156 ptr = strpbrk(word," \n\t\r");
157 if (!ptr && word < (buf + len)) {
158 bufsize = bufsize << 1;
160 fprintf(stderr, "ID overflow, restarting with size %zi\n", bufsize);
162 lseek(fd, 0, SEEK_SET);
172 fprintf(stderr, "Found word %s\n", word);
173 him = malloc(sizeof (struct _mate));
174 him->name = malloc(strlen(word) + 1);
175 strcpy(him->name, word);
176 him->state = STATE_OLD;
177 udev_list_node_append(&him->node, &bunch);
181 memcpy(buf, buf + len, len);
182 memset(buf + len, ' ', len);
198 * Adds a new ID 'us' to the internal list,
199 * marks it as confirmed.
201 static void invite(char *us)
203 struct udev_list_node *him_node;
204 struct _mate *who = NULL;
207 fprintf(stderr, "Adding ID '%s'\n", us);
209 udev_list_node_foreach(him_node, &bunch) {
210 struct _mate *him = node_to_mate(him_node);
212 if (!strcmp(him->name, us)) {
213 him->state = STATE_CONFIRMED;
218 fprintf(stderr, "ID '%s' not in database\n", us);
225 * Marks the ID 'us' as invalid,
226 * causing it to be removed when the
227 * list is written out.
229 static void reject(char *us)
231 struct udev_list_node *him_node;
232 struct _mate *who = NULL;
235 fprintf(stderr, "Removing ID '%s'\n", us);
237 udev_list_node_foreach(him_node, &bunch) {
238 struct _mate *him = node_to_mate(him_node);
240 if (!strcmp(him->name, us)) {
241 him->state = STATE_NONE;
246 fprintf(stderr, "ID '%s' not in database\n", us);
252 * Remove all IDs in the internal list which are not part
253 * of the list passed via the commandline.
255 static void kickout(void)
257 struct udev_list_node *him_node;
258 struct udev_list_node *tmp;
260 udev_list_node_foreach_safe(him_node, tmp, &bunch) {
261 struct _mate *him = node_to_mate(him_node);
263 if (him->state == STATE_OLD) {
264 udev_list_node_remove(&him->node);
274 * Counts all missing IDs in the internal list.
276 static int missing(int fd)
280 struct udev_list_node *him_node;
282 buf = malloc(bufsize);
286 udev_list_node_foreach(him_node, &bunch) {
287 struct _mate *him = node_to_mate(him_node);
289 if (him->state == STATE_NONE) {
292 while (strlen(him->name)+1 >= bufsize) {
295 bufsize = bufsize << 1;
296 tmpbuf = realloc(buf, bufsize);
303 snprintf(buf, strlen(him->name)+2, "%s ", him->name);
304 write(fd, buf, strlen(buf));
315 * Prints out the status of the internal list.
317 static void everybody(void)
319 struct udev_list_node *him_node;
320 const char *state = "";
322 udev_list_node_foreach(him_node, &bunch) {
323 struct _mate *him = node_to_mate(him_node);
325 switch (him->state) {
332 case STATE_CONFIRMED:
335 fprintf(stderr, "ID: %s=%s\n", him->name, state);
340 int main(int argc, char **argv)
342 static const struct option options[] = {
343 { "add", no_argument, NULL, 'a' },
344 { "remove", no_argument, NULL, 'r' },
345 { "debug", no_argument, NULL, 'd' },
346 { "help", no_argument, NULL, 'h' },
350 char *checkpoint, *us;
359 option = getopt_long(argc, argv, "ardh", options, NULL);
383 if (argi + 2 > argc) {
384 printf("Missing parameter(s)\n");
388 checkpoint = argv[argi++];
391 if (signal(SIGALRM, sig_alrm) == SIG_ERR) {
392 fprintf(stderr, "Cannot set SIGALRM: %s\n", strerror(errno));
397 udev_list_init(&bunch);
400 fprintf(stderr, "Using checkpoint '%s'\n", checkpoint);
402 fd = prepare(TMPFILE, checkpoint);
408 if (checkout(fd) < 0) {
413 for (i = argi; i < argc; i++) {
414 struct udev_list_node *him_node;
418 udev_list_node_foreach(him_node, &bunch) {
419 struct _mate *him = node_to_mate(him_node);
421 if (!strcmp(him->name, argv[i]))
428 fprintf(stderr, "ID %s: not in database\n", argv[i]);
429 him = malloc(sizeof (struct _mate));
430 him->name = malloc(strlen(argv[i]) + 1);
431 strcpy(him->name, argv[i]);
432 him->state = STATE_NONE;
433 udev_list_node_append(&him->node, &bunch);
436 fprintf(stderr, "ID %s: found in database\n", argv[i]);
437 who->state = STATE_CONFIRMED;
448 fprintf(stderr, "Prune lists\n");
452 lseek(fd, 0, SEEK_SET);
456 lockf(fd, F_ULOCK, 0);
462 printf("COLLECT_%s=%d\n", checkpoint, ret);