This is the mail archive of the gcc-patches@gcc.gnu.org mailing list for the GCC project.

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

Re: PATCH: Speedup hashtables, ASM_OUTPUT_SECTION_NAME

To: zackw at stanford dot edu
Subject: Re: PATCH: Speedup hashtables, ASM_OUTPUT_SECTION_NAME
From: Mark Mitchell <mark at codesourcery dot com>
Date: Sun, 26 Nov 2000 22:27:41 -0800
Cc: gcc-patches at gcc dot gnu dot org
Organization: CodeSourcery, LLC
References: <20001126202302H.mitchell@codesourcery.com><20001126220027.B2285@wolery.stanford.edu>

>>>>> "Zack" == Zack Weinberg <zackw@stanford.edu> writes:

    Zack> With suitable hash and rehash functions, we wouldn't need
    Zack> prime-sized tables at all; we could use powers of two
    Zack> instead, and avoid at least one expensive integer modulus
    Zack> per hash lookup (two if there's collisions).  See how
    Zack> stringpool.c does it, for instance.

Good point -- but one thing at a time.  This patch drops the hashing
code off the radar, which is good enough.

--
Mark Mitchell                   mark@codesourcery.com
CodeSourcery, LLC               http://www.codesourcery.com

References:
- PATCH: Speedup hashtables, ASM_OUTPUT_SECTION_NAME
  - From: Mark Mitchell
- Re: PATCH: Speedup hashtables, ASM_OUTPUT_SECTION_NAME
  - From: Zack Weinberg

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