aboutsummaryrefslogtreecommitdiffstats
path: root/tools/perf/scripts/python/bin/syscall-counts-by-pid-report
blob: 16eb8d65c54335e08d1a95e7068e6d0df55be6b5 (plain) (blame)
1
2
3
4
5
6
7
8
9
10
#!/bin/bash
# description: system-wide syscall counts, by pid
# args: [comm]
if [ $# -gt 0 ] ; then
    if ! expr match "$1" "-" > /dev/null ; then
	comm=$1
	shift
    fi
fi
perf script $@ -s "$PERF_EXEC_PATH"/scripts/python/syscall-counts-by-pid.py $comm
tter Linus Torvalds <torvalds@g5.osdl.org> 2005-11-07 10:54:05 -0500 [PATCH] kfree cleanup: misc remaining drivers' href='/cgit/cgit.cgi/litmus-rt-pandaboard.git/commit/drivers/parport/probe.c?id=6044ec8882c726e325017bd948aa0cd94ad33abc'>6044ec8882c
543537bd922
1da177e4c3f




6044ec8882c
543537bd922
1da177e4c3f


6044ec8882c



1da177e4c3f











c660629059a


































efad798b9f0
c660629059a


































145046d31ec
c660629059a













145046d31ec
c660629059a



































1da177e4c3f
c660629059a
1da177e4c3f

5712cb3d815
1da177e4c3f




c660629059a


1da177e4c3f




c660629059a
1da177e4c3f
c660629059a

1da177e4c3f

1da177e4c3f



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
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
  









                                                             
                       

                        


                          

































                                                                         





























                                                                              
                                                 
                                                                     
                                                                              
                                                   
                                                                       

                                                                              

                                                        
                                                                            











                                                                                                                        
                                                    
                                                                        




                                                                                    
                                                         
                                                                             


                         



                                  











                                                                           


































                                                                          
                                                                     


































                                                                                 
                                                                                













                                                                           
                                                                                



































                                                                              
                             
                                                                  

                                
                                                                         




                                     


                                                                      




                                                                              
                                                                           
                                                                    

                                                                     

         



                              
/*
 * Parallel port device probing code
 *
 * Authors:    Carsten Gross, carsten@sol.wohnheim.uni-ulm.de
 *             Philip Blundell <philb@gnu.org>
 */

#include <linux/module.h>
#include <linux/parport.h>
#include <linux/ctype.h>
#include <linux/string.h>
#include <linux/slab.h>
#include <asm/uaccess.h>

static const struct {
	const char *token;
	const char *descr;
} classes[] = {
	{ "",            "Legacy device" },
	{ "PRINTER",     "Printer" },
	{ "MODEM",       "Modem" },
	{ "NET",         "Network device" },
	{ "HDC",       	 "Hard disk" },
	{ "PCMCIA",      "PCMCIA" },
	{ "MEDIA",       "Multimedia device" },
	{ "FDC",         "Floppy disk" },
	{ "PORTS",       "Ports" },
	{ "SCANNER",     "Scanner" },
	{ "DIGICAM",     "Digital camera" },
	{ "",            "Unknown device" },
	{ "",            "Unspecified" },
	{ "SCSIADAPTER", "SCSI adapter" },
	{ NULL,          NULL }
};

static void pretty_print(struct parport *port, int device)
{
	struct parport_device_info *info = &port->probe_info[device + 1];

	printk(KERN_INFO "%s", port->name);

	if (device >= 0)
		printk (" (addr %d)", device);

	printk (": %s", classes[info->class].descr);
	if (info->class)
		printk(", %s %s", info->mfr, info->model);

	printk("\n");
}

static void parse_data(struct parport *port, int device, char *str)
{
	char *txt = kmalloc(strlen(str)+1, GFP_KERNEL);
	char *p = txt, *q;
	int guessed_class = PARPORT_CLASS_UNSPEC;
	struct parport_device_info *info = &port->probe_info[device + 1];

	if (!txt) {
		printk(KERN_WARNING "%s probe: memory squeeze\n", port->name);
		return;
	}
	strcpy(txt, str);
	while (p) {
		char *sep;
		q = strchr(p, ';');
		if (q) *q = 0;
		sep = strchr(p, ':');
		if (sep) {
			char *u;
			*(sep++) = 0;
			/* Get rid of trailing blanks */
			u = sep + strlen (sep) - 1;
			while (u >= p && *u == ' ')
				*u-- = '\0';
			u = p;
			while (*u) {
				*u = toupper(*u);