1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
|
/* vi: set sw=4 ts=4: */
/*
* pidof implementation for busybox
*
* Copyright (C) 1999-2003 by Erik Andersen <andersen@codepoet.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
*
*/
#include <stdio.h>
#include <stdlib.h>
#include <errno.h>
#include <unistd.h>
#include <signal.h>
#include <ctype.h>
#include <string.h>
#include <unistd.h>
#include "busybox.h"
extern int pidof_main(int argc, char **argv)
{
int opt, n = 0;
int single_flag = 0;
int fail = 1;
/* do normal option parsing */
while ((opt = getopt(argc, argv, "s")) > 0) {
switch (opt) {
case 's':
single_flag = 1;
break;
default:
bb_show_usage();
}
}
/* Looks like everything is set to go. */
while(optind < argc) {
long *pidList;
long *pl;
pidList = find_pid_by_name(argv[optind]);
for(pl = pidList; *pl > 0; pl++) {
printf("%s%ld", (n++ ? " " : ""), *pl);
fail = 0;
if (single_flag)
break;
}
free(pidList);
optind++;
}
printf("\n");
return fail ? EXIT_FAILURE : EXIT_SUCCESS;
}
|
