f988e71bc6
Add comm_str_lock to protect comm_str rb tree. The lock is only needed for multithreaded code, so using mutex wrappers provided by perf tool. Signed-off-by: Kan Liang <kan.liang@intel.com> Acked-by: Jiri Olsa <jolsa@kernel.org> Cc: Adrian Hunter <adrian.hunter@intel.com> Cc: Alexei Starovoitov <ast@kernel.org> Cc: Andi Kleen <ak@linux.intel.com> Cc: He Kuang <hekuang@huawei.com> Cc: Lukasz Odzioba <lukasz.odzioba@intel.com> Cc: Namhyung Kim <namhyung@kernel.org> Cc: Peter Zijlstra <peterz@infradead.org> Cc: Wang Nan <wangnan0@huawei.com> Link: http://lkml.kernel.org/r/1506696477-146932-3-git-send-email-kan.liang@intel.com Signed-off-by: Arnaldo Carvalho de Melo <acme@redhat.com>
146 lines
2.6 KiB
C
146 lines
2.6 KiB
C
#include "comm.h"
|
|
#include "util.h"
|
|
#include <errno.h>
|
|
#include <stdlib.h>
|
|
#include <stdio.h>
|
|
#include <string.h>
|
|
#include <linux/refcount.h>
|
|
#include "rwsem.h"
|
|
|
|
struct comm_str {
|
|
char *str;
|
|
struct rb_node rb_node;
|
|
refcount_t refcnt;
|
|
};
|
|
|
|
/* Should perhaps be moved to struct machine */
|
|
static struct rb_root comm_str_root;
|
|
static struct rw_semaphore comm_str_lock = {.lock = PTHREAD_RWLOCK_INITIALIZER,};
|
|
|
|
static struct comm_str *comm_str__get(struct comm_str *cs)
|
|
{
|
|
if (cs)
|
|
refcount_inc(&cs->refcnt);
|
|
return cs;
|
|
}
|
|
|
|
static void comm_str__put(struct comm_str *cs)
|
|
{
|
|
if (cs && refcount_dec_and_test(&cs->refcnt)) {
|
|
down_write(&comm_str_lock);
|
|
rb_erase(&cs->rb_node, &comm_str_root);
|
|
up_write(&comm_str_lock);
|
|
zfree(&cs->str);
|
|
free(cs);
|
|
}
|
|
}
|
|
|
|
static struct comm_str *comm_str__alloc(const char *str)
|
|
{
|
|
struct comm_str *cs;
|
|
|
|
cs = zalloc(sizeof(*cs));
|
|
if (!cs)
|
|
return NULL;
|
|
|
|
cs->str = strdup(str);
|
|
if (!cs->str) {
|
|
free(cs);
|
|
return NULL;
|
|
}
|
|
|
|
refcount_set(&cs->refcnt, 1);
|
|
|
|
return cs;
|
|
}
|
|
|
|
static
|
|
struct comm_str *__comm_str__findnew(const char *str, struct rb_root *root)
|
|
{
|
|
struct rb_node **p = &root->rb_node;
|
|
struct rb_node *parent = NULL;
|
|
struct comm_str *iter, *new;
|
|
int cmp;
|
|
|
|
while (*p != NULL) {
|
|
parent = *p;
|
|
iter = rb_entry(parent, struct comm_str, rb_node);
|
|
|
|
cmp = strcmp(str, iter->str);
|
|
if (!cmp)
|
|
return comm_str__get(iter);
|
|
|
|
if (cmp < 0)
|
|
p = &(*p)->rb_left;
|
|
else
|
|
p = &(*p)->rb_right;
|
|
}
|
|
|
|
new = comm_str__alloc(str);
|
|
if (!new)
|
|
return NULL;
|
|
|
|
rb_link_node(&new->rb_node, parent, p);
|
|
rb_insert_color(&new->rb_node, root);
|
|
|
|
return new;
|
|
}
|
|
|
|
static struct comm_str *comm_str__findnew(const char *str, struct rb_root *root)
|
|
{
|
|
struct comm_str *cs;
|
|
|
|
down_write(&comm_str_lock);
|
|
cs = __comm_str__findnew(str, root);
|
|
up_write(&comm_str_lock);
|
|
|
|
return cs;
|
|
}
|
|
|
|
struct comm *comm__new(const char *str, u64 timestamp, bool exec)
|
|
{
|
|
struct comm *comm = zalloc(sizeof(*comm));
|
|
|
|
if (!comm)
|
|
return NULL;
|
|
|
|
comm->start = timestamp;
|
|
comm->exec = exec;
|
|
|
|
comm->comm_str = comm_str__findnew(str, &comm_str_root);
|
|
if (!comm->comm_str) {
|
|
free(comm);
|
|
return NULL;
|
|
}
|
|
|
|
return comm;
|
|
}
|
|
|
|
int comm__override(struct comm *comm, const char *str, u64 timestamp, bool exec)
|
|
{
|
|
struct comm_str *new, *old = comm->comm_str;
|
|
|
|
new = comm_str__findnew(str, &comm_str_root);
|
|
if (!new)
|
|
return -ENOMEM;
|
|
|
|
comm_str__put(old);
|
|
comm->comm_str = new;
|
|
comm->start = timestamp;
|
|
if (exec)
|
|
comm->exec = true;
|
|
|
|
return 0;
|
|
}
|
|
|
|
void comm__free(struct comm *comm)
|
|
{
|
|
comm_str__put(comm->comm_str);
|
|
free(comm);
|
|
}
|
|
|
|
const char *comm__str(const struct comm *comm)
|
|
{
|
|
return comm->comm_str->str;
|
|
}
|