Home
last modified time | relevance | path

Searched refs:ilist (Results 1 – 7 of 7) sorted by relevance

/linux/tools/perf/util/
H A Dintlist.c29 static void int_node__delete(struct int_node *ilist) in int_node__delete() argument
31 free(ilist); in int_node__delete()
55 int intlist__add(struct intlist *ilist, unsigned long i) in intlist__add() argument
57 return rblist__add_node(&ilist->rblist, (void *)i); in intlist__add()
60 void intlist__remove(struct intlist *ilist, struct int_node *node) in intlist__remove() argument
62 rblist__remove_node(&ilist->rblist, &node->rb_node); in intlist__remove()
65 static struct int_node *__intlist__findnew(struct intlist *ilist, in __intlist__findnew() argument
71 if (ilist == NULL) in __intlist__findnew()
75 rb_node = rblist__findnew(&ilist->rblist, (void *)i); in __intlist__findnew()
77 rb_node = rblist__find(&ilist->rblist, (void *)i); in __intlist__findnew()
[all …]
H A Dintlist.h21 void intlist__delete(struct intlist *ilist);
23 void intlist__remove(struct intlist *ilist, struct int_node *in);
24 int intlist__add(struct intlist *ilist, unsigned long i);
26 struct int_node *intlist__entry(const struct intlist *ilist, unsigned int idx);
27 struct int_node *intlist__find(struct intlist *ilist, unsigned long i);
28 struct int_node *intlist__findnew(struct intlist *ilist, unsigned long i);
30 static inline bool intlist__has_entry(struct intlist *ilist, unsigned long i) in intlist__has_entry() argument
32 return intlist__find(ilist, i) != NULL; in intlist__has_entry()
35 static inline bool intlist__empty(const struct intlist *ilist) in intlist__empty() argument
37 return rblist__empty(&ilist->rblist); in intlist__empty()
[all …]
H A Dsrcline.c42 struct inline_list *ilist; in inline_list__append()
44 ilist = zalloc(sizeof(*ilist)); in inline_list__append()
45 if (ilist == NULL) in inline_list__append()
48 ilist->symbol = symbol; in inline_list__append()
49 ilist->srcline = srcline; in inline_list__append()
52 list_add_tail(&ilist->list, &node->val); in inline_list__append()
54 list_add(&ilist->list, &node->val); in inline_list__append()
61 struct inline_list *ilist; in inline_list__append_tail()
63 ilist in inline_list__append_tail()
40 struct inline_list *ilist; inline_list__append() local
59 struct inline_list *ilist; inline_list__append_tail() local
440 struct inline_list *ilist, *tmp; inline_node__delete() local
[all...]
H A Dlibdw.c83 struct inline_list *ilist; libdw_a2l_cb() local
H A Dmachine.c2160 struct inline_list *ilist; in add_callchain_ip()
2186 list_for_each_entry(ilist, &inline_node->val, list) { in add_callchain_ip()
2187 ilist_ms.sym = ilist->symbol; in add_callchain_ip()
2191 iter_cycles, branch_from, ilist->srcline); in add_callchain_ip()
2194 NULL, 0, 0, 0, ilist->srcline); in add_callchain_ip()
2100 struct inline_list *ilist; append_inlines() local
/linux/drivers/scsi/ibmvscsi_tgt/
H A Dlibsrp.h100 struct list_head ilist; member
/linux/tools/power/pm-graph/
H A Dsleepgraph.py6352 tp, ilist = False, []
6373 ilist.append('%sx%d' % (i, elist[i]) if elist[i] > 1 else i)
6408 ilist.append(issue)
6449 'issues': ' '.join(ilist),