1 /* Licensed under LGPL - see LICENSE file for details */
2 #include <ccan/failtest/failtest.h>
12 #include <sys/types.h>
19 #include <ccan/time/time.h>
20 #include <ccan/read_write_all/read_write_all.h>
21 #include <ccan/failtest/failtest_proto.h>
22 #include <ccan/build_assert/build_assert.h>
23 #include <ccan/hash/hash.h>
24 #include <ccan/htable/htable_type.h>
25 #include <ccan/str/str.h>
27 enum failtest_result (*failtest_hook)(struct tlist_calls *);
29 static int tracefd = -1;
32 unsigned int failtest_timeout_ms = 20000;
35 const char *debugpath;
47 /* end is inclusive: you can't have a 0-byte lock. */
52 /* We hash the call location together with its backtrace. */
53 static size_t hash_call(const struct failtest_call *call)
55 return hash(call->file, strlen(call->file),
57 hash(call->backtrace, call->backtrace_num,
61 static bool call_eq(const struct failtest_call *call1,
62 const struct failtest_call *call2)
66 if (strcmp(call1->file, call2->file) != 0
67 || call1->line != call2->line
68 || call1->type != call2->type
69 || call1->backtrace_num != call2->backtrace_num)
72 for (i = 0; i < call1->backtrace_num; i++)
73 if (call1->backtrace[i] != call2->backtrace[i])
79 /* Defines struct failtable. */
80 HTABLE_DEFINE_TYPE(struct failtest_call, (struct failtest_call *), hash_call,
83 bool (*failtest_exit_check)(struct tlist_calls *history);
85 static struct tlist_calls history = TLIST_INIT(history);
86 static int control_fd = -1;
87 static struct timeval start;
88 static bool probing = false;
89 static struct failtable failtable;
91 static struct write_call *child_writes = NULL;
92 static unsigned int child_writes_num = 0;
94 static pid_t lock_owner;
95 static struct lock_info *locks = NULL;
96 static unsigned int lock_num = 0;
98 static pid_t orig_pid;
100 static const char info_to_arg[] = "mceoxprwfa";
102 /* Dummy call used for failtest_undo wrappers. */
103 static struct failtest_call unrecorded_call;
106 #include <execinfo.h>
108 static void **get_backtrace(unsigned int *num)
110 static unsigned int max_back = 100;
114 ret = malloc(max_back * sizeof(void *));
115 *num = backtrace(ret, max_back);
116 if (*num == max_back) {
124 /* This will test slightly less, since will consider all of the same
125 * calls as identical. But, it's slightly faster! */
126 static void **get_backtrace(unsigned int *num)
131 #endif /* HAVE_BACKTRACE */
133 static struct failtest_call *add_history_(enum failtest_call_type type,
139 struct failtest_call *call;
141 /* NULL file is how we suppress failure. */
143 return &unrecorded_call;
145 call = malloc(sizeof *call);
149 call->cleanup = NULL;
150 call->backtrace = get_backtrace(&call->backtrace_num);
151 memcpy(&call->u, elem, elem_size);
152 tlist_add_tail(&history, call, list);
156 #define add_history(type, file, line, elem) \
157 add_history_((type), (file), (line), (elem), sizeof(*(elem)))
159 /* We do a fake call inside a sizeof(), to check types. */
160 #define set_cleanup(call, clean, type) \
161 (call)->cleanup = (void *)((void)sizeof(clean((type *)NULL),1), (clean))
164 /* Dup the fd to a high value (out of the way I hope!), and close the old fd. */
165 static int move_fd_to_high(int fd)
169 for (i = FD_SETSIZE - 1; i >= 0; i--) {
170 if (fcntl(i, F_GETFL) == -1 && errno == EBADF) {
171 if (dup2(fd, i) == -1)
172 err(1, "Failed to dup fd %i to %i", fd, i);
177 /* Nothing? Really? Er... ok? */
181 static bool read_write_info(int fd)
183 struct write_call *w;
186 /* We don't need all of this, but it's simple. */
187 child_writes = realloc(child_writes,
188 (child_writes_num+1) * sizeof(child_writes[0]));
189 w = &child_writes[child_writes_num];
190 if (!read_all(fd, w, sizeof(*w)))
193 w->buf = buf = malloc(w->count);
194 if (!read_all(fd, buf, w->count))
201 static char *failpath_string(void)
203 struct failtest_call *i;
204 char *ret = strdup("");
207 /* Inefficient, but who cares? */
208 tlist_for_each(&history, i, list) {
209 ret = realloc(ret, len + 2);
210 ret[len] = info_to_arg[i->type];
212 ret[len] = toupper(ret[len]);
218 static void warn_via_fd(int e, const char *fmt, va_list ap)
220 char *p = failpath_string();
222 vdprintf(warnfd, fmt, ap);
224 dprintf(warnfd, ": %s", strerror(e));
225 dprintf(warnfd, " [%s]\n", p);
229 static void fwarn(const char *fmt, ...)
235 warn_via_fd(e, fmt, ap);
240 static void fwarnx(const char *fmt, ...)
245 warn_via_fd(-1, fmt, ap);
249 static void tell_parent(enum info_type type)
251 if (control_fd != -1)
252 write_all(control_fd, &type, sizeof(type));
255 static void child_fail(const char *out, size_t outlen, const char *fmt, ...)
258 char *path = failpath_string();
261 vfprintf(stderr, fmt, ap);
264 fprintf(stderr, "%.*s", (int)outlen, out);
265 printf("To reproduce: --failpath=%s\n", path);
267 tell_parent(FAILURE);
271 static void trace(const char *fmt, ...)
279 vdprintf(tracefd, fmt, ap);
285 static void hand_down(int signum)
290 static void release_locks(void)
292 /* Locks were never acquired/reacquired? */
296 /* We own them? Release them all. */
297 if (lock_owner == getpid()) {
301 fl.l_whence = SEEK_SET;
305 for (i = 0; i < lock_num; i++)
306 fcntl(locks[i].fd, F_SETLK, &fl);
308 /* Our parent must have them; pass request up. */
309 enum info_type type = RELEASE_LOCKS;
310 assert(control_fd != -1);
311 write_all(control_fd, &type, sizeof(type));
316 /* off_t is a signed type. Getting its max is non-trivial. */
317 static off_t off_max(void)
319 BUILD_ASSERT(sizeof(off_t) == 4 || sizeof(off_t) == 8);
320 if (sizeof(off_t) == 4)
321 return (off_t)0x7FFFFFF;
323 return (off_t)0x7FFFFFFFFFFFFFFULL;
326 static void get_locks(void)
331 if (lock_owner == getpid())
334 if (lock_owner != 0) {
335 enum info_type type = RELEASE_LOCKS;
336 assert(control_fd != -1);
337 write_all(control_fd, &type, sizeof(type));
340 fl.l_whence = SEEK_SET;
342 for (i = 0; i < lock_num; i++) {
343 fl.l_type = locks[i].type;
344 fl.l_start = locks[i].start;
345 if (locks[i].end == off_max())
348 fl.l_len = locks[i].end - locks[i].start + 1;
350 if (fcntl(locks[i].fd, F_SETLKW, &fl) != 0)
353 lock_owner = getpid();
357 struct saved_file *next;
363 static struct saved_file *save_file(struct saved_file *next, int fd)
365 struct saved_file *s = malloc(sizeof(*s));
369 s->off = lseek(fd, 0, SEEK_CUR);
370 /* Special file? Erk... */
371 assert(s->off != -1);
372 s->len = lseek(fd, 0, SEEK_END);
373 lseek(fd, 0, SEEK_SET);
374 s->contents = malloc(s->len);
375 if (read(fd, s->contents, s->len) != s->len)
376 err(1, "Failed to save %zu bytes", (size_t)s->len);
377 lseek(fd, s->off, SEEK_SET);
381 /* We have little choice but to save and restore open files: mmap means we
382 * can really intercept changes in the child.
384 * We could do non-mmap'ed files on demand, however. */
385 static struct saved_file *save_files(void)
387 struct saved_file *files = NULL;
388 struct failtest_call *i;
390 /* Figure out the set of live fds. */
391 tlist_for_each_rev(&history, i, list) {
392 if (i->type == FAILTEST_OPEN) {
393 int fd = i->u.open.ret;
394 /* Only do successful, writable fds. */
398 /* If it was closed, cleanup == NULL. */
402 if ((i->u.open.flags & O_RDWR) == O_RDWR) {
403 files = save_file(files, fd);
404 } else if ((i->u.open.flags & O_WRONLY)
406 /* FIXME: Handle O_WRONLY. Open with O_RDWR? */
415 static void restore_files(struct saved_file *s)
418 struct saved_file *next = s->next;
420 lseek(s->fd, 0, SEEK_SET);
421 if (write(s->fd, s->contents, s->len) != s->len)
422 err(1, "Failed to restore %zu bytes", (size_t)s->len);
423 if (ftruncate(s->fd, s->len) != 0)
424 err(1, "Failed to trim file to length %zu",
427 lseek(s->fd, s->off, SEEK_SET);
433 static void free_files(struct saved_file *s)
436 struct saved_file *next = s->next;
443 static void free_call(struct failtest_call *call)
445 /* We don't do this in cleanup: needed even for failed opens. */
446 if (call->type == FAILTEST_OPEN)
447 free((char *)call->u.open.pathname);
448 free(call->backtrace);
449 tlist_del_from(&history, call, list);
453 /* Free up memory, so valgrind doesn't report leaks. */
454 static void free_everything(void)
456 struct failtest_call *i;
458 while ((i = tlist_top(&history, struct failtest_call, list)) != NULL)
461 failtable_clear(&failtable);
464 static NORETURN void failtest_cleanup(bool forced_cleanup, int status)
466 struct failtest_call *i;
468 /* For children, we don't care if they "failed" the testing. */
469 if (control_fd != -1)
472 if (forced_cleanup) {
473 /* We didn't actually do final operation: remove it. */
474 i = tlist_tail(&history, struct failtest_call, list);
478 /* Cleanup everything, in reverse order. */
479 tlist_for_each_rev(&history, i, list) {
482 if (!forced_cleanup) {
483 printf("Leak at %s:%u: --failpath=%s\n",
484 i->file, i->line, failpath_string());
492 tell_parent(SUCCESS);
494 tell_parent(FAILURE);
498 static bool following_path(void)
502 /* + means continue after end, like normal. */
503 if (*failpath == '+') {
510 static bool follow_path(struct failtest_call *call)
512 if (*failpath == '\0') {
513 /* Continue, but don't inject errors. */
514 return call->fail = false;
517 if (tolower((unsigned char)*failpath) != info_to_arg[call->type])
518 errx(1, "Failpath expected '%s' got '%c'\n",
519 failpath, info_to_arg[call->type]);
520 call->fail = cisupper(*(failpath++));
524 static bool should_fail(struct failtest_call *call)
527 int control[2], output[2];
528 enum info_type type = UNEXPECTED;
531 struct saved_file *files;
532 struct failtest_call *dup;
534 if (call == &unrecorded_call)
537 if (following_path())
538 return follow_path(call);
540 /* Attach debugger if they asked for it. */
544 /* Pretend this last call matches whatever path wanted:
545 * keeps valgrind happy. */
546 call->fail = cisupper(debugpath[strlen(debugpath)-1]);
547 path = failpath_string();
549 if (streq(path, debugpath)) {
553 signal(SIGUSR1, SIG_IGN);
554 sprintf(str, "xterm -e gdb /proc/%d/exe %d &",
556 if (system(str) == 0)
559 /* Ignore last character: could be upper or lower. */
560 path[strlen(path)-1] = '\0';
561 if (!strstarts(debugpath, path)) {
563 "--debugpath not followed: %s\n", path);
570 /* Are we probing? If so, we never fail twice. */
572 return call->fail = false;
574 /* Don't more than once in the same place. */
575 dup = failtable_get(&failtable, call);
577 return call->fail = false;
580 switch (failtest_hook(&history)) {
594 /* Add it to our table of calls. */
595 failtable_add(&failtable, call);
597 files = save_files();
599 /* We're going to fail in the child. */
601 if (pipe(control) != 0 || pipe(output) != 0)
602 err(1, "opening pipe");
604 /* Prevent double-printing (in child and parent) */
608 err(1, "forking failed");
615 struct failtest_call *c;
617 c = tlist_tail(&history, struct failtest_call, list);
618 diff = time_sub(time_now(), start);
619 failpath = failpath_string();
620 trace("%u->%u (%u.%02u): %s (", getppid(), getpid(),
621 (int)diff.tv_sec, (int)diff.tv_usec / 10000,
624 p = strrchr(c->file, '/');
628 trace("%s", c->file);
629 trace(":%u)\n", c->line);
633 dup2(output[1], STDOUT_FILENO);
634 dup2(output[1], STDERR_FILENO);
635 if (output[1] != STDOUT_FILENO && output[1] != STDERR_FILENO)
637 control_fd = move_fd_to_high(control[1]);
638 /* Valgrind spots the leak if we don't free these. */
643 signal(SIGUSR1, hand_down);
648 /* We grab output so we can display it; we grab writes so we
651 struct pollfd pfd[2];
654 pfd[0].fd = output[0];
655 pfd[0].events = POLLIN|POLLHUP;
656 pfd[1].fd = control[0];
657 pfd[1].events = POLLIN|POLLHUP;
660 ret = poll(pfd, 1, failtest_timeout_ms);
662 ret = poll(pfd, 2, failtest_timeout_ms);
669 err(1, "Poll returned %i", ret);
672 if (pfd[0].revents & POLLIN) {
675 out = realloc(out, outlen + 8192);
676 len = read(output[0], out + outlen, 8192);
678 } else if (type != SUCCESS && (pfd[1].revents & POLLIN)) {
679 if (read_all(control[0], &type, sizeof(type))) {
681 if (!read_write_info(control[0]))
683 } else if (type == RELEASE_LOCKS) {
685 /* FIXME: Tell them we're done... */
688 } else if (pfd[0].revents & POLLHUP) {
691 } while (type != FAILURE);
695 waitpid(child, &status, 0);
696 if (!WIFEXITED(status)) {
697 if (WTERMSIG(status) == SIGUSR1)
698 child_fail(out, outlen, "Timed out");
700 child_fail(out, outlen, "Killed by signal %u: ",
703 /* Child printed failure already, just pass up exit code. */
704 if (type == FAILURE) {
705 fprintf(stderr, "%.*s", (int)outlen, out);
707 exit(WEXITSTATUS(status) ? WEXITSTATUS(status) : 1);
709 if (WEXITSTATUS(status) != 0)
710 child_fail(out, outlen, "Exited with status %i: ",
711 WEXITSTATUS(status));
714 signal(SIGUSR1, SIG_DFL);
716 restore_files(files);
718 /* Only child does probe. */
721 /* We continue onwards without failing. */
726 static void cleanup_calloc(struct calloc_call *call)
731 void *failtest_calloc(size_t nmemb, size_t size,
732 const char *file, unsigned line)
734 struct failtest_call *p;
735 struct calloc_call call;
738 p = add_history(FAILTEST_CALLOC, file, line, &call);
740 if (should_fail(p)) {
741 p->u.calloc.ret = NULL;
744 p->u.calloc.ret = calloc(nmemb, size);
745 set_cleanup(p, cleanup_calloc, struct calloc_call);
748 return p->u.calloc.ret;
751 static void cleanup_malloc(struct malloc_call *call)
756 void *failtest_malloc(size_t size, const char *file, unsigned line)
758 struct failtest_call *p;
759 struct malloc_call call;
762 p = add_history(FAILTEST_MALLOC, file, line, &call);
763 if (should_fail(p)) {
764 p->u.malloc.ret = NULL;
767 p->u.malloc.ret = malloc(size);
768 set_cleanup(p, cleanup_malloc, struct malloc_call);
771 return p->u.malloc.ret;
774 static void cleanup_realloc(struct realloc_call *call)
779 /* Walk back and find out if we got this ptr from a previous routine. */
780 static void fixup_ptr_history(void *ptr)
782 struct failtest_call *i;
784 /* Start at end of history, work back. */
785 tlist_for_each_rev(&history, i, list) {
787 case FAILTEST_REALLOC:
788 if (i->u.realloc.ret == ptr) {
793 case FAILTEST_MALLOC:
794 if (i->u.malloc.ret == ptr) {
799 case FAILTEST_CALLOC:
800 if (i->u.calloc.ret == ptr) {
811 void *failtest_realloc(void *ptr, size_t size, const char *file, unsigned line)
813 struct failtest_call *p;
814 struct realloc_call call;
816 p = add_history(FAILTEST_REALLOC, file, line, &call);
818 /* FIXME: Try one child moving allocation, one not. */
819 if (should_fail(p)) {
820 p->u.realloc.ret = NULL;
823 /* Don't catch this one in the history fixup... */
824 p->u.realloc.ret = NULL;
825 fixup_ptr_history(ptr);
826 p->u.realloc.ret = realloc(ptr, size);
827 set_cleanup(p, cleanup_realloc, struct realloc_call);
830 return p->u.realloc.ret;
833 /* FIXME: Record free, so we can terminate fixup_ptr_history correctly.
834 * If there's an alloc we don't see, it could get confusing if it matches
835 * a previous allocation we did see. */
836 void failtest_free(void *ptr)
838 fixup_ptr_history(ptr);
842 static void cleanup_open(struct open_call *call)
847 int failtest_open(const char *pathname,
848 const char *file, unsigned line, ...)
850 struct failtest_call *p;
851 struct open_call call;
854 call.pathname = strdup(pathname);
856 call.flags = va_arg(ap, int);
857 if (call.flags & O_CREAT) {
858 call.mode = va_arg(ap, int);
861 p = add_history(FAILTEST_OPEN, file, line, &call);
862 /* Avoid memory leak! */
863 if (p == &unrecorded_call)
864 free((char *)call.pathname);
865 p->u.open.ret = open(pathname, call.flags, call.mode);
867 if (p->u.open.ret == -1) {
868 if (following_path())
872 } else if (should_fail(p)) {
873 close(p->u.open.ret);
875 /* FIXME: Play with error codes? */
878 set_cleanup(p, cleanup_open, struct open_call);
881 return p->u.open.ret;
884 void *failtest_mmap(void *addr, size_t length, int prot, int flags,
885 int fd, off_t offset, const char *file, unsigned line)
887 struct failtest_call *p;
888 struct mmap_call call;
891 call.length = length;
894 call.offset = offset;
897 p = add_history(FAILTEST_MMAP, file, line, &call);
898 if (should_fail(p)) {
899 p->u.mmap.ret = MAP_FAILED;
902 p->u.mmap.ret = mmap(addr, length, prot, flags, fd, offset);
905 return p->u.mmap.ret;
908 static void cleanup_pipe(struct pipe_call *call)
910 if (!call->closed[0])
912 if (!call->closed[1])
916 int failtest_pipe(int pipefd[2], const char *file, unsigned line)
918 struct failtest_call *p;
919 struct pipe_call call;
921 p = add_history(FAILTEST_PIPE, file, line, &call);
922 if (should_fail(p)) {
924 /* FIXME: Play with error codes? */
927 p->u.pipe.ret = pipe(p->u.pipe.fds);
928 p->u.pipe.closed[0] = p->u.pipe.closed[1] = false;
929 set_cleanup(p, cleanup_pipe, struct pipe_call);
931 /* This causes valgrind to notice if they use pipefd[] after failure */
932 memcpy(pipefd, p->u.pipe.fds, sizeof(p->u.pipe.fds));
934 return p->u.pipe.ret;
937 ssize_t failtest_pread(int fd, void *buf, size_t count, off_t off,
938 const char *file, unsigned line)
940 struct failtest_call *p;
941 struct read_call call;
946 p = add_history(FAILTEST_READ, file, line, &call);
948 /* FIXME: Try partial read returns. */
949 if (should_fail(p)) {
953 p->u.read.ret = pread(fd, buf, count, off);
956 return p->u.read.ret;
959 ssize_t failtest_pwrite(int fd, const void *buf, size_t count, off_t off,
960 const char *file, unsigned line)
962 struct failtest_call *p;
963 struct write_call call;
969 p = add_history(FAILTEST_WRITE, file, line, &call);
971 /* If we're a child, we need to make sure we write the same thing
972 * to non-files as the parent does, so tell it. */
973 if (control_fd != -1 && off == (off_t)-1) {
974 enum info_type type = WRITE;
976 write_all(control_fd, &type, sizeof(type));
977 write_all(control_fd, &p->u.write, sizeof(p->u.write));
978 write_all(control_fd, buf, count);
981 /* FIXME: Try partial write returns. */
982 if (should_fail(p)) {
986 /* FIXME: We assume same write order in parent and child */
987 if (off == (off_t)-1 && child_writes_num != 0) {
988 if (child_writes[0].fd != fd)
989 errx(1, "Child wrote to fd %u, not %u?",
990 child_writes[0].fd, fd);
991 if (child_writes[0].off != p->u.write.off)
992 errx(1, "Child wrote to offset %zu, not %zu?",
993 (size_t)child_writes[0].off,
994 (size_t)p->u.write.off);
995 if (child_writes[0].count != count)
996 errx(1, "Child wrote length %zu, not %zu?",
997 child_writes[0].count, count);
998 if (memcmp(child_writes[0].buf, buf, count)) {
1000 "Child wrote differently to"
1001 " fd %u than we did!\n", fd);
1003 free((char *)child_writes[0].buf);
1005 memmove(&child_writes[0], &child_writes[1],
1006 sizeof(child_writes[0]) * child_writes_num);
1008 /* Is this is a socket or pipe, child wrote it
1010 if (p->u.write.off == (off_t)-1) {
1011 p->u.write.ret = count;
1013 return p->u.write.ret;
1016 p->u.write.ret = pwrite(fd, buf, count, off);
1019 return p->u.write.ret;
1022 ssize_t failtest_read(int fd, void *buf, size_t count,
1023 const char *file, unsigned line)
1025 return failtest_pread(fd, buf, count, lseek(fd, 0, SEEK_CUR),
1029 ssize_t failtest_write(int fd, const void *buf, size_t count,
1030 const char *file, unsigned line)
1032 return failtest_pwrite(fd, buf, count, lseek(fd, 0, SEEK_CUR),
1036 static struct lock_info *WARN_UNUSED_RESULT
1037 add_lock(struct lock_info *locks, int fd, off_t start, off_t end, int type)
1040 struct lock_info *l;
1042 for (i = 0; i < lock_num; i++) {
1047 /* Four cases we care about:
1061 if (start > l->start && end < l->end) {
1062 /* Mid overlap: trim entry, add new one. */
1063 off_t new_start, new_end;
1064 new_start = end + 1;
1067 locks = add_lock(locks,
1068 fd, new_start, new_end, l->type);
1070 } else if (start <= l->start && end >= l->end) {
1071 /* Total overlap: eliminate entry. */
1074 } else if (end >= l->start && end < l->end) {
1075 /* Start overlap: trim entry. */
1077 } else if (start > l->start && start <= l->end) {
1078 /* End overlap: trim entry. */
1081 /* Nothing left? Remove it. */
1082 if (l->end < l->start) {
1083 memmove(l, l + 1, (--lock_num - i) * sizeof(l[0]));
1088 if (type != F_UNLCK) {
1089 locks = realloc(locks, (lock_num + 1) * sizeof(*locks));
1090 l = &locks[lock_num++];
1099 /* We trap this so we can record it: we don't fail it. */
1100 int failtest_close(int fd, const char *file, unsigned line)
1102 struct failtest_call *i;
1103 struct close_call call;
1104 struct failtest_call *p;
1107 p = add_history(FAILTEST_CLOSE, file, line, &call);
1110 /* Consume close from failpath (shouldn't tell us to fail). */
1111 if (following_path()) {
1119 /* Trace history to find source of fd. */
1120 tlist_for_each_rev(&history, i, list) {
1124 if (i->u.pipe.fds[0] == fd) {
1125 assert(!i->u.pipe.closed[0]);
1126 i->u.pipe.closed[0] = true;
1127 if (i->u.pipe.closed[1])
1131 if (i->u.pipe.fds[1] == fd) {
1132 assert(!i->u.pipe.closed[1]);
1133 i->u.pipe.closed[1] = true;
1134 if (i->u.pipe.closed[0])
1140 if (i->u.open.ret == fd) {
1141 assert((void *)i->cleanup
1142 == (void *)cleanup_open);
1153 locks = add_lock(locks, fd, 0, off_max(), F_UNLCK);
1157 /* Zero length means "to end of file" */
1158 static off_t end_of(off_t start, off_t len)
1162 return start + len - 1;
1165 /* FIXME: This only handles locks, really. */
1166 int failtest_fcntl(int fd, const char *file, unsigned line, int cmd, ...)
1168 struct failtest_call *p;
1169 struct fcntl_call call;
1175 /* Argument extraction. */
1180 call.arg.l = va_arg(ap, long);
1182 return fcntl(fd, cmd, call.arg.l);
1185 return fcntl(fd, cmd);
1189 call.arg.fl = *va_arg(ap, struct flock *);
1191 return fcntl(fd, cmd, &call.arg.fl);
1195 call.arg.fl = *va_arg(ap, struct flock *);
1199 /* This means you need to implement it here. */
1200 err(1, "failtest: unknown fcntl %u", cmd);
1203 p = add_history(FAILTEST_FCNTL, file, line, &call);
1205 if (should_fail(p)) {
1206 p->u.fcntl.ret = -1;
1207 if (p->u.fcntl.cmd == F_SETLK)
1213 p->u.fcntl.ret = fcntl(p->u.fcntl.fd, p->u.fcntl.cmd,
1214 &p->u.fcntl.arg.fl);
1215 if (p->u.fcntl.ret == -1)
1218 /* We don't handle anything else yet. */
1219 assert(p->u.fcntl.arg.fl.l_whence == SEEK_SET);
1220 locks = add_lock(locks,
1222 p->u.fcntl.arg.fl.l_start,
1223 end_of(p->u.fcntl.arg.fl.l_start,
1224 p->u.fcntl.arg.fl.l_len),
1225 p->u.fcntl.arg.fl.l_type);
1229 return p->u.fcntl.ret;
1232 pid_t failtest_getpid(const char *file, unsigned line)
1234 /* You must call failtest_init first! */
1239 void failtest_init(int argc, char *argv[])
1243 orig_pid = getpid();
1245 warnfd = move_fd_to_high(dup(STDERR_FILENO));
1246 for (i = 1; i < argc; i++) {
1247 if (!strncmp(argv[i], "--failpath=", strlen("--failpath="))) {
1248 failpath = argv[i] + strlen("--failpath=");
1249 } else if (strcmp(argv[i], "--tracepath") == 0) {
1251 failtest_timeout_ms = -1;
1252 } else if (!strncmp(argv[i], "--debugpath=",
1253 strlen("--debugpath="))) {
1254 debugpath = argv[i] + strlen("--debugpath=");
1257 failtable_init(&failtable);
1261 bool failtest_has_failed(void)
1263 return control_fd != -1;
1266 void failtest_exit(int status)
1268 if (failtest_exit_check) {
1269 if (!failtest_exit_check(&history))
1270 child_fail(NULL, 0, "failtest_exit_check failed\n");
1273 failtest_cleanup(false, status);