From mboxrd@z Thu Jan 1 00:00:00 1970 From: Denis Zaitsev Subject: Re: strcmp is too heavy for its everyday usage... Date: Thu, 8 Jan 2004 06:36:36 +0500 Sender: libc-alpha-owner@sources.redhat.com Message-ID: <20040108063636.C11508@zzz.ward.six> References: <20040108060924.A4431@zzz.ward.six> <200401080113.i081DB1c000920@magilla.sf.frob.com> Mime-Version: 1.0 Return-path: List-Unsubscribe: List-Subscribe: List-Archive: List-Post: List-Help: , Content-Disposition: inline In-Reply-To: <200401080113.i081DB1c000920@magilla.sf.frob.com>; from roland@redhat.com on Wed, Jan 07, 2004 at 05:13:11PM -0800 List-Id: Content-Type: text/plain; charset="us-ascii" Content-Transfer-Encoding: 7bit To: Roland McGrath Cc: Zack Weinberg , Andreas Jaeger , Richard Henderson , libc-alpha@sources.redhat.com, linux-gcc@vger.kernel.org On Wed, Jan 07, 2004 at 05:13:11PM -0800, Roland McGrath wrote: > The optimized string functions already do word comparisons when that > is possible and advantageous. The comparisons to extract the > ordering vs just equality/nonequality are only on the first > nonmatching byte. But it's an overhead anyway. Then, it's bad enough for the inlining. And then, where is such a strcmp in GLIBC?