triple.c 2.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111
  1. /*
  2. * Copyright (c) 2000, 2001, 2002, 2003, 2004, 2005, 2008, 2009
  3. * The President and Fellows of Harvard College.
  4. *
  5. * Redistribution and use in source and binary forms, with or without
  6. * modification, are permitted provided that the following conditions
  7. * are met:
  8. * 1. Redistributions of source code must retain the above copyright
  9. * notice, this list of conditions and the following disclaimer.
  10. * 2. Redistributions in binary form must reproduce the above copyright
  11. * notice, this list of conditions and the following disclaimer in the
  12. * documentation and/or other materials provided with the distribution.
  13. * 3. Neither the name of the University nor the names of its contributors
  14. * may be used to endorse or promote products derived from this software
  15. * without specific prior written permission.
  16. *
  17. * THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY AND CONTRIBUTORS ``AS IS'' AND
  18. * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  19. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  20. * ARE DISCLAIMED. IN NO EVENT SHALL THE UNIVERSITY OR CONTRIBUTORS BE LIABLE
  21. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  22. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  23. * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  24. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  25. * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  26. * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  27. * SUCH DAMAGE.
  28. */
  29. /*
  30. * triple.c
  31. *
  32. * Runs three copies of some subprogram.
  33. */
  34. #include <stdio.h>
  35. #include <unistd.h>
  36. #include <err.h>
  37. #include "triple.h"
  38. static
  39. pid_t
  40. spawnv(const char *prog, char **argv)
  41. {
  42. pid_t pid = fork();
  43. switch (pid) {
  44. case -1:
  45. err(1, "fork");
  46. case 0:
  47. /* child */
  48. execv(prog, argv);
  49. err(1, "%s: execv", prog);
  50. default:
  51. /* parent */
  52. break;
  53. }
  54. return pid;
  55. }
  56. static
  57. int
  58. dowait(int index, int pid)
  59. {
  60. int status;
  61. if (waitpid(pid, &status, 0)<0) {
  62. warn("waitpid for copy #%d (pid %d)", index, pid);
  63. return 1;
  64. }
  65. else if (WIFSIGNALED(status)) {
  66. warnx("copy #%d (pid %d): signal %d", index, pid,
  67. WTERMSIG(status));
  68. return 1;
  69. }
  70. else if (WEXITSTATUS(status) != 0) {
  71. warnx("copy #%d (pid %d): exit %d", index, pid,
  72. WEXITSTATUS(status));
  73. return 1;
  74. }
  75. return 0;
  76. }
  77. void
  78. triple(const char *prog)
  79. {
  80. pid_t pids[3];
  81. int i, failures = 0;
  82. char *args[2];
  83. /* set up the argv */
  84. args[0]=(char *)prog;
  85. args[1]=NULL;
  86. warnx("Starting: running three copies of %s...", prog);
  87. for (i=0; i<3; i++) {
  88. pids[i]=spawnv(args[0], args);
  89. }
  90. for (i=0; i<3; i++) {
  91. failures += dowait(i, pids[i]);
  92. }
  93. if (failures > 0) {
  94. warnx("%d failures", failures);
  95. }
  96. else {
  97. warnx("Congratulations! You passed.");
  98. }
  99. }