[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <ZhgvE7i9HGGar1eX@x1>
Date: Thu, 11 Apr 2024 15:42:27 -0300
From: Arnaldo Carvalho de Melo <acme@...nel.org>
To: Ian Rogers <irogers@...gle.com>
Cc: Peter Zijlstra <peterz@...radead.org>, Ingo Molnar <mingo@...hat.com>,
Namhyung Kim <namhyung@...nel.org>,
Mark Rutland <mark.rutland@....com>,
Alexander Shishkin <alexander.shishkin@...ux.intel.com>,
Jiri Olsa <jolsa@...nel.org>,
Adrian Hunter <adrian.hunter@...el.com>,
Kan Liang <kan.liang@...ux.intel.com>,
James Clark <james.clark@....com>,
Athira Rajeev <atrajeev@...ux.vnet.ibm.com>,
Colin Ian King <colin.i.king@...il.com>,
Leo Yan <leo.yan@...ux.dev>, Song Liu <song@...nel.org>,
Ilkka Koskinen <ilkka@...amperecomputing.com>,
Ben Gainey <ben.gainey@....com>,
K Prateek Nayak <kprateek.nayak@....com>,
Yanteng Si <siyanteng@...ngson.cn>,
Yicong Yang <yangyicong@...ilicon.com>,
Sun Haiyong <sunhaiyong@...ngson.cn>,
Ravi Bangoria <ravi.bangoria@....com>,
Anne Macedo <retpolanne@...teo.net>,
Changbin Du <changbin.du@...wei.com>,
Andi Kleen <ak@...ux.intel.com>,
Thomas Richter <tmricht@...ux.ibm.com>,
Masami Hiramatsu <mhiramat@...nel.org>,
zhaimingbing <zhaimingbing@...s.chinamobile.com>,
Li Dong <lidong@...o.com>, Paran Lee <p4ranlee@...il.com>,
elfring@...rs.sourceforge.net,
Markus Elfring <Markus.Elfring@....de>,
Yang Jihong <yangjihong1@...wei.com>,
Chengen Du <chengen.du@...onical.com>,
linux-perf-users@...r.kernel.org, linux-kernel@...r.kernel.org,
bpf@...r.kernel.org
Subject: Re: [PATCH v3 00/12] dso/dsos memory savings and clean up
On Tue, Apr 09, 2024 at 11:42:02PM -0700, Ian Rogers wrote:
> 12 more patches from:
> https://lore.kernel.org/lkml/20240202061532.1939474-1-irogers@google.com/
> a near half year old adventure in trying to lower perf's dynamic
> memory use. Bits like the memory overhead of opendir are on the
> sidelines for now, too much fighting over how
> distributions/C-libraries present getdents. These changes are more
> good old fashioned replace an rb-tree with a sorted array and add
> reference count tracking.
>
> The changes migrate dsos code, the collection of dso structs, more
> into the dsos.c/dsos.h files. As with maps and threads, this is done
> so the internals can be changed - replacing a linked list (for fast
> iteration) and an rb-tree (for fast finds) with a lazily sorted
> array. The complexity of operations remain roughly the same, although
> iterating an array is likely faster than iterating a linked list, the
> memory usage is at least reduce by half.
Got the first 5 patches, would be nice if more people could review it,
I'll try and get back to is soon.
- Arnaldo
Powered by blists - more mailing lists