/*
* pidof implementation for busybox
*
- * Copyright (C) 1999,2000 by Lineo, inc. and Erik Andersen
- * Copyright (C) 1999,2000,2001 by Erik Andersen <andersee@debian.org>
- *
- * This program is free software; you can redistribute it and/or modify
- * it under the terms of the GNU General Public License as published by
- * the Free Software Foundation; either version 2 of the License, or
- * (at your option) any later version.
- *
- * This program is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
- * General Public License for more details.
- *
- * You should have received a copy of the GNU General Public License
- * along with this program; if not, write to the Free Software
- * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+ * Copyright (C) 1999-2004 by Erik Andersen <andersen@codepoet.org>
*
+ * Licensed under the GPL v2, see the file LICENSE in this tarball.
*/
-
+#include "busybox.h"
#include <stdio.h>
#include <stdlib.h>
#include <errno.h>
#include <signal.h>
#include <ctype.h>
#include <string.h>
+#include <sys/types.h>
#include <unistd.h>
-#include "busybox.h"
+#if ENABLE_FEATURE_PIDOF_SINGLE
+#define _SINGLE_COMPL(a) a
+#define SINGLE (1<<0)
+#else
+#define _SINGLE_COMPL(a)
+#define SINGLE (0)
+#endif
-extern int pidof_main(int argc, char **argv)
+#if ENABLE_FEATURE_PIDOF_OMIT
+#define _OMIT_COMPL(a) a
+#define _OMIT(a) ,a
+#if ENABLE_FEATURE_PIDOF_SINGLE
+#define OMIT (1<<1)
+#else
+#define OMIT (1<<0)
+#endif
+#else
+#define _OMIT_COMPL(a) ""
+#define _OMIT(a)
+#define OMIT (0)
+#define omitted (0)
+#endif
+
+int pidof_main(int argc, char **argv)
{
- int opt;
+ unsigned n = 0;
+ unsigned fail = 1;
+ unsigned long int opt;
+#if ENABLE_FEATURE_PIDOF_OMIT
+ llist_t *omits = NULL; /* list of pids to omit */
+ bb_opt_complementally = _OMIT_COMPL("o::");
+#endif
+ /* do unconditional option parsing */
+ opt = bb_getopt_ulflags(argc, argv,
+ _SINGLE_COMPL("s") _OMIT_COMPL("o:")
+ _OMIT(&omits));
- /* do normal option parsing */
- while ((opt = getopt(argc, argv, "ne:f:")) > 0) {
- switch (opt) {
-#if 0
- case 'g':
- break;
- case 'e':
- break;
-#endif
- default:
- show_usage();
+#if ENABLE_FEATURE_PIDOF_OMIT
+ /* fill omit list. */
+ {
+ char getppid_str[32];
+ llist_t * omits_p = omits;
+ while (omits_p) {
+ /* are we asked to exclude the parent's process ID? */
+ if (!strncmp(omits_p->data, "%PPID", 5)) {
+ llist_pop(&omits_p);
+ snprintf(getppid_str, sizeof(getppid_str), "%d", getppid());
+ llist_add_to(&omits_p, getppid_str);
+ }
+ omits_p = omits_p->link;
}
}
-
- /* if we didn't get a process name, then we need to choke and die here */
- if (argv[optind] == NULL)
- show_usage();
-
- /* Looks like everything is set to go. */
+#endif
+ /* Looks like everything is set to go. */
while(optind < argc) {
- pid_t* pidList;
+ long *pidList;
+ long *pl;
- pidList = find_pid_by_name( argv[optind]);
- if (!pidList || *pidList<=0) {
- break;
- }
+ /* reverse the pidlist like GNU pidof does. */
+ pidList = pidlist_reverse(find_pid_by_name(argv[optind]));
+ for(pl = pidList; *pl > 0; pl++) {
+#if ENABLE_FEATURE_PIDOF_OMIT
+ unsigned omitted = 0;
+ if (opt & OMIT) {
+ llist_t *omits_p = omits;
+ while (omits_p)
+ if (strtol(omits_p->data, NULL, 10) == *pl) {
+ omitted = 1; break;
+ } else
+ omits_p = omits_p->link;
+ }
+#endif
+ if (!omitted) {
+ if (n) {
+ putchar(' ');
+ } else {
+ n = 1;
+ }
+ printf("%ld", *pl);
+ }
+ fail = (!ENABLE_FEATURE_PIDOF_OMIT && omitted);
- for(; pidList && *pidList!=0; pidList++) {
- printf("%ld ", (long)*pidList);
+ if (ENABLE_FEATURE_PIDOF_SINGLE && (opt & SINGLE))
+ break;
}
- /* Note that we don't bother to free the memory
- * allocated in find_pid_by_name(). It will be freed
- * upon exit, so we can save a byte or two */
+ free(pidList);
optind++;
}
- printf("\n");
+ putchar('\n');
- return EXIT_SUCCESS;
+#if ENABLE_FEATURE_PIDOF_OMIT
+ if (ENABLE_FEATURE_CLEAN_UP)
+ llist_free(omits, NULL);
+#endif
+ return fail ? EXIT_FAILURE : EXIT_SUCCESS;
}