src/libudev/libudev-queue-private.c

   1 /*
   2  * libudev - interface to udev device information
   3  *
   4  * Copyright (C) 2008 Kay Sievers <kay.sievers@vrfy.org>
   5  * Copyright (C) 2009 Alan Jenkins <alan-jenkins@tuffmail.co.uk>
   6  *
   7  * This library is free software; you can redistribute it and/or
   8  * modify it under the terms of the GNU Lesser General Public
   9  * License as published by the Free Software Foundation; either
  10  * version 2.1 of the License, or (at your option) any later version.
  11  */
  12
  13 /*
  14  * DISCLAIMER - The file format mentioned here is private to udev/libudev,
  15  *              and may be changed without notice.
  16  *
  17  * The udev event queue is exported as a binary log file.
  18  * Each log record consists of a sequence number followed by the device path.
  19  *
  20  * When a new event is queued, its details are appended to the log.
  21  * When the event finishes, a second record is appended to the log
  22  * with the same sequence number but a devpath len of 0.
  23  *
  24  * Example:
  25  *        { 0x0000000000000001 }
  26  *        { 0x0000000000000001, 0x0019, "/devices/virtual/mem/null" },
  27  *        { 0x0000000000000002, 0x001b, "/devices/virtual/mem/random" },
  28  *        { 0x0000000000000001, 0x0000 },
  29  *        { 0x0000000000000003, 0x0019, "/devices/virtual/mem/zero" },
  30  *
  31  * Events 2 and 3 are still queued, but event 1 has finished.
  32  *
  33  * The queue does not grow indefinitely. It is periodically re-created
  34  * to remove finished events. Atomic rename() makes this transparent to readers.
  35  *
  36  * The queue file starts with a single sequence number which specifies the
  37  * minimum sequence number in the log that follows. Any events prior to this
  38  * sequence number have already finished.
  39  */
  40
  41 #include <stdio.h>
  42 #include <stdlib.h>
  43 #include <string.h>
  44 #include <unistd.h>
  45 #include <fcntl.h>
  46 #include <dirent.h>
  47 #include <limits.h>
  48 #include <errno.h>
  49 #include <sys/stat.h>
  50 #include <sys/types.h>
  51
  52 #include "libudev.h"
  53 #include "libudev-private.h"
  54
  55 static int rebuild_queue_file(struct udev_queue_export *udev_queue_export);
  56
  57 struct udev_queue_export {
  58         struct udev *udev;
  59         int queued_count;        /* number of unfinished events exported in queue file */
  60         FILE *queue_file;
  61         unsigned long long int seqnum_max;        /* earliest sequence number in queue file */
  62         unsigned long long int seqnum_min;        /* latest sequence number in queue file */
  63         int waste_bytes;                        /* queue file bytes wasted on finished events */
  64 };
  65
  66 struct udev_queue_export *udev_queue_export_new(struct udev *udev)
  67 {
  68         struct udev_queue_export *udev_queue_export;
  69         unsigned long long int initial_seqnum;
  70
  71         if (udev == NULL)
  72                 return NULL;
  73
  74         udev_queue_export = calloc(1, sizeof(struct udev_queue_export));
  75         if (udev_queue_export == NULL)
  76                 return NULL;
  77         udev_queue_export->udev = udev;
  78
  79         initial_seqnum = udev_get_kernel_seqnum(udev);
  80         udev_queue_export->seqnum_min = initial_seqnum;
  81         udev_queue_export->seqnum_max = initial_seqnum;
  82
  83         udev_queue_export_cleanup(udev_queue_export);
  84         if (rebuild_queue_file(udev_queue_export) != 0) {
  85                 free(udev_queue_export);
  86                 return NULL;
  87         }
  88
  89         return udev_queue_export;
  90 }
  91
  92 struct udev_queue_export *udev_queue_export_unref(struct udev_queue_export *udev_queue_export)
  93 {
  94         if (udev_queue_export == NULL)
  95                 return NULL;
  96         if (udev_queue_export->queue_file != NULL)
  97                 fclose(udev_queue_export->queue_file);
  98         free(udev_queue_export);
  99         return NULL;
 100 }
 101
 102 void udev_queue_export_cleanup(struct udev_queue_export *udev_queue_export)
 103 {
 104         char filename[UTIL_PATH_SIZE];
 105
 106         if (udev_queue_export == NULL)
 107                 return;
 108         util_strscpyl(filename, sizeof(filename), udev_get_run_path(udev_queue_export->udev), "/queue.tmp", NULL);
 109         unlink(filename);
 110         util_strscpyl(filename, sizeof(filename), udev_get_run_path(udev_queue_export->udev), "/queue.bin", NULL);
 111         unlink(filename);
 112 }
 113
 114 static int skip_to(FILE *file, long offset)
 115 {
 116         long old_offset;
 117
 118         /* fseek may drop buffered data, avoid it for small seeks */
 119         old_offset = ftell(file);
 120         if (offset > old_offset && offset - old_offset <= BUFSIZ) {
 121                 size_t skip_bytes = offset - old_offset;
 122                 char *buf = alloca(skip_bytes);
 123
 124                 if (fread(buf, skip_bytes, 1, file) != skip_bytes)
 125                         return -1;
 126         }
 127
 128         return fseek(file, offset, SEEK_SET);
 129 }
 130
 131 struct queue_devpaths {
 132         unsigned int devpaths_first;        /* index of first queued event */
 133         unsigned int devpaths_size;
 134         long devpaths[];                /* seqnum -> offset of devpath in queue file (or 0) */
 135 };
 136
 137 /*
 138  * Returns a table mapping seqnum to devpath file offset for currently queued events.
 139  * devpaths[i] represents the event with seqnum = i + udev_queue_export->seqnum_min.
 140  */
 141 static struct queue_devpaths *build_index(struct udev_queue_export *udev_queue_export)
 142 {
 143         struct queue_devpaths *devpaths;
 144         unsigned long long int range;
 145         long devpath_offset;
 146         ssize_t devpath_len;
 147         unsigned long long int seqnum;
 148         unsigned long long int n;
 149         unsigned int i;
 150
 151         /* seek to the first event in the file */
 152         rewind(udev_queue_export->queue_file);
 153         udev_queue_read_seqnum(udev_queue_export->queue_file, &seqnum);
 154
 155         /* allocate the table */
 156         range = udev_queue_export->seqnum_min - udev_queue_export->seqnum_max;
 157         if (range - 1 > INT_MAX) {
 158                 err(udev_queue_export->udev, "queue file overflow\n");
 159                 return NULL;
 160         }
 161         devpaths = calloc(1, sizeof(struct queue_devpaths) + (range + 1) * sizeof(long));
 162         if (devpaths == NULL)
 163                 return NULL;
 164         devpaths->devpaths_size = range + 1;
 165
 166         /* read all records and populate the table */
 167         for (;;) {
 168                 if (udev_queue_read_seqnum(udev_queue_export->queue_file, &seqnum) < 0)
 169                         break;
 170                 n = seqnum - udev_queue_export->seqnum_max;
 171                 if (n >= devpaths->devpaths_size)
 172                         goto read_error;
 173
 174                 devpath_offset = ftell(udev_queue_export->queue_file);
 175                 devpath_len = udev_queue_skip_devpath(udev_queue_export->queue_file);
 176                 if (devpath_len < 0)
 177                         goto read_error;
 178
 179                 if (devpath_len > 0)
 180                         devpaths->devpaths[n] = devpath_offset;
 181                 else
 182                         devpaths->devpaths[n] = 0;
 183         }
 184
 185         /* find first queued event */
 186         for (i = 0; i < devpaths->devpaths_size; i++) {
 187                 if (devpaths->devpaths[i] != 0)
 188                         break;
 189         }
 190         devpaths->devpaths_first = i;
 191
 192         return devpaths;
 193
 194 read_error:
 195         err(udev_queue_export->udev, "queue file corrupted\n");
 196         free(devpaths);
 197         return NULL;
 198 }
 199
 200 static int rebuild_queue_file(struct udev_queue_export *udev_queue_export)
 201 {
 202         unsigned long long int seqnum;
 203         struct queue_devpaths *devpaths = NULL;
 204         char filename[UTIL_PATH_SIZE];
 205         char filename_tmp[UTIL_PATH_SIZE];
 206         FILE *new_queue_file = NULL;
 207         unsigned int i;
 208
 209         /* read old queue file */
 210         if (udev_queue_export->queue_file != NULL) {
 211                 devpaths = build_index(udev_queue_export);
 212                 if (devpaths != NULL)
 213                         udev_queue_export->seqnum_max += devpaths->devpaths_first;
 214         }
 215         if (devpaths == NULL) {
 216                 udev_queue_export->queued_count = 0;
 217                 udev_queue_export->seqnum_max = udev_queue_export->seqnum_min;
 218         }
 219
 220         /* create new queue file */
 221         util_strscpyl(filename_tmp, sizeof(filename_tmp), udev_get_run_path(udev_queue_export->udev), "/queue.tmp", NULL);
 222         new_queue_file = fopen(filename_tmp, "w+");
 223         if (new_queue_file == NULL)
 224                 goto error;
 225         seqnum = udev_queue_export->seqnum_max;
 226         fwrite(&seqnum, 1, sizeof(unsigned long long int), new_queue_file);
 227
 228         /* copy unfinished events only to the new file */
 229         if (devpaths != NULL) {
 230                 for (i = devpaths->devpaths_first; i < devpaths->devpaths_size; i++) {
 231                         char devpath[UTIL_PATH_SIZE];
 232                         int err;
 233                         unsigned short devpath_len;
 234
 235                         if (devpaths->devpaths[i] != 0)
 236                         {
 237                                 skip_to(udev_queue_export->queue_file, devpaths->devpaths[i]);
 238                                 err = udev_queue_read_devpath(udev_queue_export->queue_file, devpath, sizeof(devpath));
 239                                 devpath_len = err;
 240
 241                                 fwrite(&seqnum, sizeof(unsigned long long int), 1, new_queue_file);
 242                                 fwrite(&devpath_len, sizeof(unsigned short), 1, new_queue_file);
 243                                 fwrite(devpath, 1, devpath_len, new_queue_file);
 244                         }
 245                         seqnum++;
 246                 }
 247                 free(devpaths);
 248                 devpaths = NULL;
 249         }
 250         fflush(new_queue_file);
 251         if (ferror(new_queue_file))
 252                 goto error;
 253
 254         /* rename the new file on top of the old one */
 255         util_strscpyl(filename, sizeof(filename), udev_get_run_path(udev_queue_export->udev), "/queue.bin", NULL);
 256         if (rename(filename_tmp, filename) != 0)
 257                 goto error;
 258
 259         if (udev_queue_export->queue_file != NULL)
 260                 fclose(udev_queue_export->queue_file);
 261         udev_queue_export->queue_file = new_queue_file;
 262         udev_queue_export->waste_bytes = 0;
 263
 264         return 0;
 265
 266 error:
 267         err(udev_queue_export->udev, "failed to create queue file: %m\n");
 268         udev_queue_export_cleanup(udev_queue_export);
 269
 270         if (udev_queue_export->queue_file != NULL) {
 271                 fclose(udev_queue_export->queue_file);
 272                 udev_queue_export->queue_file = NULL;
 273         }
 274         if (new_queue_file != NULL)
 275                 fclose(new_queue_file);
 276
 277         if (devpaths != NULL)
 278                 free(devpaths);
 279         udev_queue_export->queued_count = 0;
 280         udev_queue_export->waste_bytes = 0;
 281         udev_queue_export->seqnum_max = udev_queue_export->seqnum_min;
 282
 283         return -1;
 284 }
 285
 286 static int write_queue_record(struct udev_queue_export *udev_queue_export,
 287                               unsigned long long int seqnum, const char *devpath, size_t devpath_len)
 288 {
 289         unsigned short len;
 290
 291         if (udev_queue_export->queue_file == NULL)
 292                 return -1;
 293
 294         if (fwrite(&seqnum, sizeof(unsigned long long int), 1, udev_queue_export->queue_file) != 1)
 295                 goto write_error;
 296
 297         len = (devpath_len < USHRT_MAX) ? devpath_len : USHRT_MAX;
 298         if (fwrite(&len, sizeof(unsigned short), 1, udev_queue_export->queue_file) != 1)
 299                 goto write_error;
 300         if (len > 0) {
 301                 if (fwrite(devpath, 1, len, udev_queue_export->queue_file) != len)
 302                         goto write_error;
 303         }
 304
 305         /* *must* flush output; caller may fork */
 306         if (fflush(udev_queue_export->queue_file) != 0)
 307                 goto write_error;
 308
 309         return 0;
 310
 311 write_error:
 312         /* if we failed half way through writing a record to a file,
 313            we should not try to write any further records to it. */
 314         err(udev_queue_export->udev, "error writing to queue file: %m\n");
 315         fclose(udev_queue_export->queue_file);
 316         udev_queue_export->queue_file = NULL;
 317
 318         return -1;
 319 }
 320
 321 enum device_state {
 322         DEVICE_QUEUED,
 323         DEVICE_FINISHED,
 324 };
 325
 326 static inline size_t queue_record_size(size_t devpath_len)
 327 {
 328         return sizeof(unsigned long long int) + sizeof(unsigned short int) + devpath_len;
 329 }
 330
 331 static int update_queue(struct udev_queue_export *udev_queue_export,
 332                          struct udev_device *udev_device, enum device_state state)
 333 {
 334         unsigned long long int seqnum = udev_device_get_seqnum(udev_device);
 335         const char *devpath = NULL;
 336         size_t devpath_len = 0;
 337         int bytes;
 338         int err;
 339
 340         /* FINISHED records have a zero length devpath */
 341         if (state == DEVICE_QUEUED) {
 342                 devpath = udev_device_get_devpath(udev_device);
 343                 devpath_len = strlen(devpath);
 344         }
 345
 346         /* recover from an earlier failed rebuild */
 347         if (udev_queue_export->queue_file == NULL) {
 348                 if (rebuild_queue_file(udev_queue_export) != 0)
 349                         return -1;
 350         }
 351
 352         /* if we're removing the last event from the queue, that's the best time to rebuild it */
 353         if (state != DEVICE_QUEUED && udev_queue_export->queued_count == 1) {
 354                 /* we don't need to read the old queue file */
 355                 fclose(udev_queue_export->queue_file);
 356                 udev_queue_export->queue_file = NULL;
 357                 rebuild_queue_file(udev_queue_export);
 358                 return 0;
 359         }
 360
 361         /* try to rebuild the queue files before they grow larger than one page. */
 362         bytes = ftell(udev_queue_export->queue_file) + queue_record_size(devpath_len);
 363         if ((udev_queue_export->waste_bytes > bytes / 2) && bytes > 4096)
 364                 rebuild_queue_file(udev_queue_export);
 365
 366         /* don't record a finished event, if we already dropped the event in a failed rebuild */
 367         if (seqnum < udev_queue_export->seqnum_max)
 368                 return 0;
 369
 370         /* now write to the queue */
 371         if (state == DEVICE_QUEUED) {
 372                 udev_queue_export->queued_count++;
 373                 udev_queue_export->seqnum_min = seqnum;
 374         } else {
 375                 udev_queue_export->waste_bytes += queue_record_size(devpath_len) + queue_record_size(0);
 376                 udev_queue_export->queued_count--;
 377         }
 378         err = write_queue_record(udev_queue_export, seqnum, devpath, devpath_len);
 379
 380         /* try to handle ENOSPC */
 381         if (err != 0 && udev_queue_export->queued_count == 0) {
 382                 udev_queue_export_cleanup(udev_queue_export);
 383                 err = rebuild_queue_file(udev_queue_export);
 384         }
 385
 386         return err;
 387 }
 388
 389 static int update(struct udev_queue_export *udev_queue_export,
 390                   struct udev_device *udev_device, enum device_state state)
 391 {
 392         if (update_queue(udev_queue_export, udev_device, state) != 0)
 393                 return -1;
 394
 395         return 0;
 396 }
 397
 398 int udev_queue_export_device_queued(struct udev_queue_export *udev_queue_export, struct udev_device *udev_device)
 399 {
 400         return update(udev_queue_export, udev_device, DEVICE_QUEUED);
 401 }
 402
 403 int udev_queue_export_device_finished(struct udev_queue_export *udev_queue_export, struct udev_device *udev_device)
 404 {
 405         return update(udev_queue_export, udev_device, DEVICE_FINISHED);
 406 }