Re: binary_search, lower_bound and upper_bound inlining

[Dimitris Xochellis <jimxoch at yahoo dot gr>]

--- Paolo Carlini <pcarlini@suse.de> wrote:

> 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...

Well, I don't feel so "lucky" today :) 
(I also agree that the code bloat will probably be rather 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?

Good idea, I will do so.

Thanks

-Jim



	

	
		
___________________________________________________________ 
Χρησιμοποιείτε Yahoo!; 
Βαρεθήκατε τα ενοχλητικά μηνύματα (spam); Το Yahoo! Mail 
διαθέτει την καλύτερη δυνατή προστασία κατά των ενοχλητικών 
μηνυμάτων http://login.yahoo.com/config/mail?.intl=gr