rblist
struct rblist orig_metric_events;
struct rblist;
struct rblist metric_events;
rblist__init(&ilist->rblist);
ilist->rblist.node_cmp = intlist__node_cmp;
ilist->rblist.node_new = intlist__node_new;
ilist->rblist.node_delete = intlist__node_delete;
static struct rb_node *intlist__node_new(struct rblist *rblist __maybe_unused,
rblist__delete(&ilist->rblist);
rb_node = rblist__entry(&ilist->rblist, idx);
static void intlist__node_delete(struct rblist *rblist __maybe_unused,
return rblist__add_node(&ilist->rblist, (void *)i);
rblist__remove_node(&ilist->rblist, &node->rb_node);
rb_node = rblist__findnew(&ilist->rblist, (void *)i);
rb_node = rblist__find(&ilist->rblist, (void *)i);
struct rblist rblist;
return rblist__empty(&ilist->rblist);
return rblist__nr_entries(&ilist->rblist);
struct rb_node *rn = rb_first_cached(&ilist->rblist.entries);
void metricgroup__rblist_init(struct rblist *metric_events)
void metricgroup__rblist_exit(struct rblist *metric_events)
struct rblist *new_metric_events,
struct rblist *old_metric_events)
struct metric_event *metricgroup__lookup(struct rblist *metric_events,
static struct rb_node *metric_event_new(struct rblist *rblist __maybe_unused,
static void metric_event_delete(struct rblist *rblist __maybe_unused,
struct rblist;
struct metric_event *metricgroup__lookup(struct rblist *metric_events,
void metricgroup__rblist_init(struct rblist *metric_events);
void metricgroup__rblist_exit(struct rblist *metric_events);
struct rblist *new_metric_events,
struct rblist *old_metric_events);
static struct rb_node *mep_new(struct rblist *rl __maybe_unused, const void *entry)
static void mep_delete(struct rblist *rl __maybe_unused,
static struct mep *mep_lookup(struct rblist *groups, const char *metric_group,
struct rblist *groups = vdata;
struct rblist groups;
void rblist__init(struct rblist *rblist)
if (rblist != NULL) {
rblist->entries = RB_ROOT_CACHED;
rblist->nr_entries = 0;
void rblist__exit(struct rblist *rblist)
struct rb_node *pos, *next = rb_first_cached(&rblist->entries);
rblist__remove_node(rblist, pos);
void rblist__delete(struct rblist *rblist)
if (rblist != NULL) {
rblist__exit(rblist);
free(rblist);
struct rb_node *rblist__entry(const struct rblist *rblist, unsigned int idx)
int rblist__add_node(struct rblist *rblist, const void *new_entry)
for (node = rb_first_cached(&rblist->entries); node;
struct rb_node **p = &rblist->entries.rb_root.rb_node;
rc = rblist->node_cmp(parent, new_entry);
new_node = rblist->node_new(rblist, new_entry);
rb_insert_color_cached(new_node, &rblist->entries, leftmost);
++rblist->nr_entries;
void rblist__remove_node(struct rblist *rblist, struct rb_node *rb_node)
rb_erase_cached(rb_node, &rblist->entries);
--rblist->nr_entries;
rblist->node_delete(rblist, rb_node);
static struct rb_node *__rblist__findnew(struct rblist *rblist,
struct rb_node **p = &rblist->entries.rb_root.rb_node;
rc = rblist->node_cmp(parent, entry);
new_node = rblist->node_new(rblist, entry);
&rblist->entries, leftmost);
++rblist->nr_entries;
struct rb_node *rblist__find(struct rblist *rblist, const void *entry)
return __rblist__findnew(rblist, entry, false);
struct rb_node *rblist__findnew(struct rblist *rblist, const void *entry)
return __rblist__findnew(rblist, entry, true);
struct rb_node *(*node_new)(struct rblist *rlist, const void *new_entry);
void (*node_delete)(struct rblist *rblist, struct rb_node *rb_node);
void rblist__init(struct rblist *rblist);
void rblist__exit(struct rblist *rblist);
void rblist__delete(struct rblist *rblist);
int rblist__add_node(struct rblist *rblist, const void *new_entry);
void rblist__remove_node(struct rblist *rblist, struct rb_node *rb_node);
struct rb_node *rblist__find(struct rblist *rblist, const void *entry);
struct rb_node *rblist__findnew(struct rblist *rblist, const void *entry);
struct rb_node *rblist__entry(const struct rblist *rblist, unsigned int idx);
static inline bool rblist__empty(const struct rblist *rblist)
return rblist->nr_entries == 0;
static inline unsigned int rblist__nr_entries(const struct rblist *rblist)
return rblist->nr_entries;
struct rblist *metric_events = &evsel->evlist->metric_events;
struct rb_node *strlist__node_new(struct rblist *rblist __maybe_unused, const void *entry)
rblist__init(&slist->rblist);
slist->rblist.node_cmp = strlist__node_cmp;
slist->rblist.node_new = strlist__node_new;
slist->rblist.node_delete = strlist__node_delete;
rblist__delete(&slist->rblist);
rb_node = rblist__entry(&slist->rblist, idx);
void strlist__node_delete(struct rblist *rblist __maybe_unused, struct rb_node *rb_node)
return rblist__add_node(&slist->rblist, new_entry);
rblist__remove_node(&slist->rblist, &snode->rb_node);
struct rb_node *rb_node = rblist__find(&slist->rblist, entry);
struct rblist rblist;
return rblist__empty(&slist->rblist);
return rblist__nr_entries(&slist->rblist);
struct rb_node *rn = rb_first_cached(&slist->rblist.entries);