Date: Tue, 9 Apr 2013 20:47:26 +0200 From: =?iso-8859-2?Q?Edward_Tomasz_Napiera=B3a?= <trasz@FreeBSD.org> To: Freddie Cash <fjwcash@gmail.com> Cc: Wojciech Puchar <wojtek@wojtek.tensor.gdynia.pl>, Alfred Perlstein <bright@mu.org>, Amit Rawat <aamitr4@gmail.com>, FreeBSD Hackers <freebsd-hackers@freebsd.org> Subject: Re: GSOC 2013 project " Kernel Size Reduction for Embedded System " Message-ID: <92799D4C-797C-4304-B299-DD1DBA49CFFC@FreeBSD.org> In-Reply-To: <CAOjFWZ6ytuKFHYBvrNTMwK8f=_ZDnGY5-naVqscC6YWZ33P8UA@mail.gmail.com> References: <CAOhv3dpTM9J9oiLpdw8xOAToXT_tQ3VW4Mv1F%2B8n7xhG%2BJK93w@mail.gmail.com> <alpine.BSF.2.00.1304091935490.13342@wojtek.tensor.gdynia.pl> <516452C7.7040607@mu.org> <alpine.BSF.2.00.1304091953060.13438@wojtek.tensor.gdynia.pl> <CAOjFWZ6ytuKFHYBvrNTMwK8f=_ZDnGY5-naVqscC6YWZ33P8UA@mail.gmail.com>
next in thread | previous in thread | raw e-mail | index | archive | help
In order to optimize - in this case for size - we need a way to measure what should we focus on, and it looks like we don't have it yet. Would it be possible to write a tool - e.g. by instrumenting LLVM - that would make it possible to calculate, for every function in the call graph, the amount of code in that function and everything it "pulls in", i.e. all the code paths that it might call. When we have that, clustering the graph should give us some idea what to focus on. Or perhaps such a tool already exists? -- If you cut off my head, what would I say? Me and my head, or me and my body?
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?92799D4C-797C-4304-B299-DD1DBA49CFFC>