Can I enforce the inlining of the STL algorithms?

Dimitris Xochellis jimxoch@yahoo.gr
Sun Apr 1 20:05:00 GMT 2007


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 



More information about the Gcc-help mailing list