This is the mail archive of the libc-alpha@sources.redhat.com mailing list for the glibc project.

Index Nav:	[Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav:	[Date Prev] [Date Next]	[Thread Prev] [Thread Next]
Other format:	[Raw text]

Re: More backref performance - no strncmp

From: "Paolo Bonzini" <paolo dot bonzini at polimi dot it>
To: <libc-alpha at sources dot redhat dot com>
Date: Thu, 24 Oct 2002 10:25:03 +0200
Subject: Re: More backref performance - no strncmp
References: <006a01c27a79$dd47fff0$b71a1897@bonz> <20021023152659.GA10019@nevyn.them.org>
Reply-to: "Paolo Bonzini" <bonzini at gnu dot org>

Actually, note that strncmp is not as extremely optimized as memcmp (the
loop is unrolled, but no strange tricks).  So the most highly optimized
function, in the context of regex matching, turns out to be the slowest
because of the startup overheads!  Since my_memcmp is as unoptimized as
strncmp, but is inlined and simpler, it makes sense that it is faster.

Paolo

Follow-Ups:
- Re: More backref performance - no strncmp
  - From: Jakub Jelinek

References:
- More backref performance - no strncmp
  - From: Bonzini
- Re: More backref performance - no strncmp
  - From: Daniel Jacobowitz

Index Nav:	[Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav:	[Date Prev] [Date Next]	[Thread Prev] [Thread Next]