sty.c 2.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596
  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. * sty.c
  31. *
  32. * Run a bunch of cpu pigs.
  33. *
  34. * This test should itself run correctly when the basic system calls
  35. * are complete. It may be helpful for scheduler performance analysis.
  36. */
  37. #include <unistd.h>
  38. #include <err.h>
  39. static char *hargv[2] = { (char *)"hog", NULL };
  40. #define MAXPROCS 6
  41. static int pids[MAXPROCS], npids;
  42. static
  43. void
  44. hog(void)
  45. {
  46. int pid = fork();
  47. switch (pid) {
  48. case -1:
  49. err(1, "fork");
  50. case 0:
  51. /* child */
  52. execv("/testbin/hog", hargv);
  53. err(1, "/testbin/hog");
  54. default:
  55. /* parent */
  56. pids[npids++] = pid;
  57. break;
  58. }
  59. }
  60. static
  61. void
  62. waitall(void)
  63. {
  64. int i, status;
  65. for (i=0; i<npids; i++) {
  66. if (waitpid(pids[i], &status, 0)<0) {
  67. warn("waitpid for %d", pids[i]);
  68. }
  69. else if (WIFSIGNALED(status)) {
  70. warnx("pid %d: signal %d", pids[i], WTERMSIG(status));
  71. }
  72. else if (WEXITSTATUS(status) != 0) {
  73. warnx("pid %d: exit %d", pids[i], WEXITSTATUS(status));
  74. }
  75. }
  76. }
  77. int
  78. main()
  79. {
  80. hog();
  81. hog();
  82. hog();
  83. hog();
  84. hog();
  85. hog();
  86. waitall();
  87. return 0;
  88. }