perf maps: Do simple merge if given map doesn't overlap
Simplify merge in for the simple case of a non-overlapping map. Signed-off-by: Ian Rogers <irogers@google.com> Cc: Adrian Hunter <adrian.hunter@intel.com> Cc: Alexander Shishkin <alexander.shishkin@linux.intel.com> Cc: Andi Kleen <ak@linux.intel.com> Cc: Athira Rajeev <atrajeev@linux.vnet.ibm.com> Cc: Changbin Du <changbin.du@huawei.com> Cc: Colin Ian King <colin.i.king@gmail.com> Cc: Dmitrii Dolgov <9erthalion6@gmail.com> Cc: German Gomez <german.gomez@arm.com> Cc: Guilherme Amadio <amadio@gentoo.org> Cc: Huacai Chen <chenhuacai@kernel.org> Cc: Ingo Molnar <mingo@redhat.com> Cc: James Clark <james.clark@arm.com> Cc: Jiri Olsa <jolsa@kernel.org> Cc: K Prateek Nayak <kprateek.nayak@amd.com> Cc: Kajol Jain <kjain@linux.ibm.com> Cc: Kan Liang <kan.liang@linux.intel.com> Cc: Leo Yan <leo.yan@linaro.org> Cc: Li Dong <lidong@vivo.com> Cc: Liam Howlett <liam.howlett@oracle.com> Cc: Mark Rutland <mark.rutland@arm.com> Cc: Masami Hiramatsu <mhiramat@kernel.org> Cc: Miguel Ojeda <ojeda@kernel.org> Cc: Ming Wang <wangming01@loongson.cn> Cc: Namhyung Kim <namhyung@kernel.org> Cc: Nick Terrell <terrelln@fb.com> Cc: Paolo Bonzini <pbonzini@redhat.com> Cc: Peter Zijlstra <peterz@infradead.org> Cc: Ravi Bangoria <ravi.bangoria@amd.com> Cc: Sandipan Das <sandipan.das@amd.com> Cc: Sean Christopherson <seanjc@google.com> Cc: Steinar H. Gunderson <sesse@google.com> Cc: Vincent Whitchurch <vincent.whitchurch@axis.com> Cc: Wenyu Liu <liuwenyu7@huawei.com> Cc: Yang Jihong <yangjihong1@huawei.com> Link: https://lore.kernel.org/r/20231207011722.1220634-18-irogers@google.com Signed-off-by: Arnaldo Carvalho de Melo <acme@redhat.com>
This commit is contained in:
parent
07ef14d50c
commit
980d792721
@ -697,9 +697,20 @@ void maps__fixup_end(struct maps *maps)
|
||||
int maps__merge_in(struct maps *kmaps, struct map *new_map)
|
||||
{
|
||||
struct map_rb_node *rb_node;
|
||||
struct rb_node *first;
|
||||
bool overlaps;
|
||||
LIST_HEAD(merged);
|
||||
int err = 0;
|
||||
|
||||
down_read(maps__lock(kmaps));
|
||||
first = first_ending_after(kmaps, new_map);
|
||||
rb_node = first ? rb_entry(first, struct map_rb_node, rb_node) : NULL;
|
||||
overlaps = rb_node && map__start(rb_node->map) < map__end(new_map);
|
||||
up_read(maps__lock(kmaps));
|
||||
|
||||
if (!overlaps)
|
||||
return maps__insert(kmaps, new_map);
|
||||
|
||||
maps__for_each_entry(kmaps, rb_node) {
|
||||
struct map *old_map = rb_node->map;
|
||||
|
||||
|
Loading…
Reference in New Issue
Block a user