This is the mail archive of the
libstdc++@gcc.gnu.org
mailing list for the libstdc++ project.
Re: binary_search, lower_bound and upper_bound inlining
- From: Paolo Carlini <pcarlini at suse dot de>
- To: Dimitris Xochellis <jimxoch at yahoo dot gr>
- Cc: libstdc++ <libstdc++ at gcc dot gnu dot org>
- Date: Sun, 01 Apr 2007 18:53:36 +0200
- Subject: Re: binary_search, lower_bound and upper_bound inlining
- References: <642251.96293.qm@web23110.mail.ird.yahoo.com>
Dimitris Xochellis wrote:
we can definitely mark inline binary_search, very tiny, but frankly, for
general use lower_bound and upper_bound seem too big and we risk a bad
code bloat.
I suspected so :( That's life anyway...
Well, if you can provide unbiased, compelling evidence that code bloat
isn't too big...
In general, anyway, you should refer to the gcc manual, there are
various knobs you can turn in order to change the behavior of the
inliner (-finline-limit=...)
I found nothing appropriate in the manual. (-finline-limit works for functions that are explicitly marked as inline)
That's sad. You should tell all the people, the compiler people too not
only the library developers: either the options are too hard to find or
wrongly missing. Can you send a message to gcc@gcc.gnu.org?
Thanks,
Paolo.