pidof.c 1.9 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879
  1. /* vi: set sw=4 ts=4: */
  2. /*
  3. * pidof implementation for busybox
  4. *
  5. * Copyright (C) 1999,2000 by Lineo, inc. and Erik Andersen
  6. * Copyright (C) 1999-2002 by Erik Andersen <andersee@debian.org>
  7. *
  8. * This program is free software; you can redistribute it and/or modify
  9. * it under the terms of the GNU General Public License as published by
  10. * the Free Software Foundation; either version 2 of the License, or
  11. * (at your option) any later version.
  12. *
  13. * This program is distributed in the hope that it will be useful,
  14. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  15. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  16. * General Public License for more details.
  17. *
  18. * You should have received a copy of the GNU General Public License
  19. * along with this program; if not, write to the Free Software
  20. * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
  21. *
  22. */
  23. #include <stdio.h>
  24. #include <stdlib.h>
  25. #include <errno.h>
  26. #include <unistd.h>
  27. #include <signal.h>
  28. #include <ctype.h>
  29. #include <string.h>
  30. #include <unistd.h>
  31. #include "busybox.h"
  32. extern int pidof_main(int argc, char **argv)
  33. {
  34. int opt, n = 0;
  35. /* do normal option parsing */
  36. while ((opt = getopt(argc, argv, "ne:f:")) > 0) {
  37. switch (opt) {
  38. #if 0
  39. case 'g':
  40. break;
  41. case 'e':
  42. break;
  43. #endif
  44. default:
  45. show_usage();
  46. }
  47. }
  48. /* if we didn't get a process name, then we need to choke and die here */
  49. if (argv[optind] == NULL)
  50. show_usage();
  51. /* Looks like everything is set to go. */
  52. while(optind < argc) {
  53. long* pidList;
  54. pidList = find_pid_by_name( argv[optind]);
  55. if (!pidList || *pidList<=0) {
  56. break;
  57. }
  58. for(; pidList && *pidList!=0; pidList++) {
  59. printf("%s%ld", (n++ ? " " : ""), (long)*pidList);
  60. }
  61. /* Note that we don't bother to free the memory
  62. * allocated in find_pid_by_name(). It will be freed
  63. * upon exit, so we can save a byte or two */
  64. optind++;
  65. }
  66. printf("\n");
  67. return EXIT_SUCCESS;
  68. }