This is the mail archive of the
gcc-help@gcc.gnu.org
mailing list for the GCC project.
Can I enforce the inlining of the STL algorithms?
- From: Dimitris Xochellis <jimxoch at yahoo dot gr>
- To: gcc-help at gcc dot gnu dot org
- Date: Sun, 1 Apr 2007 21:05:29 +0100 (BST)
- Subject: Can I enforce the inlining of the STL algorithms?
Hello list,
There are some STL algorithms (notably the binary_search, lower_bound and upper_bound) that are
not declared as inline in libstdc++, although inlining them can sometimes lead to great
performance improvements. [1] (Code bloating is the reason why.)
Is there something that I can do, other than editing the libstdc++ files, in order to persuade the
compiler to inline these STL algorithms? (even -O3 seems not good enough).
Best regards
Jim Xochellis
References
1. http://gcc.gnu.org/ml/libstdc++/2007-04/msg00000.html
___________________________________________________________
Χρησιμοποιείτε Yahoo!;
Βαρεθήκατε τα ενοχλητικά μηνύματα (spam); Το Yahoo! Mail
διαθέτει την καλύτερη δυνατή προστασία κατά των ενοχλητικών
μηνυμάτων http://login.yahoo.com/config/mail?.intl=gr