Lines Matching defs:cmdlines
168 struct tep_cmdline *cmdlines;
171 cmdlines = malloc(sizeof(*cmdlines) * tep->cmdline_count);
172 if (!cmdlines)
177 cmdlines[i].pid = cmdlist->pid;
178 cmdlines[i].comm = cmdlist->comm;
185 qsort(cmdlines, tep->cmdline_count, sizeof(*cmdlines), cmdline_cmp);
187 tep->cmdlines = cmdlines;
201 if (!tep->cmdlines && cmdline_init(tep))
202 return "<not enough memory for cmdlines!>";
206 comm = bsearch(&key, tep->cmdlines, tep->cmdline_count,
207 sizeof(*tep->cmdlines), cmdline_cmp);
230 if (!tep->cmdlines && cmdline_init(tep))
235 comm = bsearch(&key, tep->cmdlines, tep->cmdline_count,
236 sizeof(*tep->cmdlines), cmdline_cmp);
245 * we must add this pid. This is much slower than when cmdlines
251 struct tep_cmdline *cmdlines = tep->cmdlines;
263 cmdline = bsearch(&key, tep->cmdlines, tep->cmdline_count,
264 sizeof(*tep->cmdlines), cmdline_cmp);
281 cmdlines = realloc(cmdlines, sizeof(*cmdlines) * (tep->cmdline_count + 1));
282 if (!cmdlines) {
286 tep->cmdlines = cmdlines;
296 tep->cmdlines[0] = key;
302 cmdline = bsearch(&key, tep->cmdlines, tep->cmdline_count - 1,
303 sizeof(*tep->cmdlines), cmdline_slot_cmp);
309 cnt -= cmdline - tep->cmdlines;
313 if (key.pid > tep->cmdlines[tep->cmdline_count - 1].pid) {
314 tep->cmdlines[tep->cmdline_count++] = key;
317 cmdline = &tep->cmdlines[0];
332 if (tep->cmdlines)
383 if (!tep->cmdlines && cmdline_init(tep)) {
5930 * If the cmdlines have not been converted yet, then use
5933 if (!tep->cmdlines)
5939 * a previous call before cmdlines were created
5941 if (next < tep->cmdlines ||
5942 next >= tep->cmdlines + tep->cmdline_count)
5949 cmdline = tep->cmdlines;
5951 while (cmdline < tep->cmdlines + tep->cmdline_count) {
5975 * If cmdlines have not been created yet, or cmdline is
5978 if (!tep->cmdlines ||
5979 cmdline < tep->cmdlines ||
5980 cmdline >= tep->cmdlines + tep->cmdline_count)
7535 if (tep->cmdlines) {
7537 free(tep->cmdlines[i].comm);
7538 free(tep->cmdlines);