pidof.c 1.6 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071
  1. /* vi: set sw=4 ts=4: */
  2. /*
  3. * pidof implementation for busybox
  4. *
  5. * Copyright (C) 1999-2004 by Erik Andersen <andersen@codepoet.org>
  6. *
  7. * This program is free software; you can redistribute it and/or modify
  8. * it under the terms of the GNU General Public License as published by
  9. * the Free Software Foundation; either version 2 of the License, or
  10. * (at your option) any later version.
  11. *
  12. * This program is distributed in the hope that it will be useful,
  13. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  14. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  15. * General Public License for more details.
  16. *
  17. * You should have received a copy of the GNU General Public License
  18. * along with this program; if not, write to the Free Software
  19. * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
  20. *
  21. */
  22. #include <stdio.h>
  23. #include <stdlib.h>
  24. #include <errno.h>
  25. #include <unistd.h>
  26. #include <signal.h>
  27. #include <ctype.h>
  28. #include <string.h>
  29. #include <unistd.h>
  30. #include "busybox.h"
  31. extern int pidof_main(int argc, char **argv)
  32. {
  33. int opt, n = 0;
  34. int single_flag = 0;
  35. int fail = 1;
  36. /* do normal option parsing */
  37. while ((opt = getopt(argc, argv, "s")) > 0) {
  38. switch (opt) {
  39. case 's':
  40. single_flag = 1;
  41. break;
  42. default:
  43. bb_show_usage();
  44. }
  45. }
  46. /* Looks like everything is set to go. */
  47. while(optind < argc) {
  48. long *pidList;
  49. long *pl;
  50. pidList = find_pid_by_name(argv[optind]);
  51. for(pl = pidList; *pl > 0; pl++) {
  52. printf("%s%ld", (n++ ? " " : ""), *pl);
  53. fail = 0;
  54. if (single_flag)
  55. break;
  56. }
  57. free(pidList);
  58. optind++;
  59. }
  60. printf("\n");
  61. return fail ? EXIT_FAILURE : EXIT_SUCCESS;
  62. }