hash.h 2.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960
  1. /* SPDX-License-Identifier: GPL-2.0 */
  2. #ifndef _ASM_HASH_H
  3. #define _ASM_HASH_H
  4. /*
  5. * If CONFIG_M68000=y (original mc68000/010), this file is #included
  6. * to work around the lack of a MULU.L instruction.
  7. */
  8. #define HAVE_ARCH__HASH_32 1
  9. /*
  10. * While it would be legal to substitute a different hash operation
  11. * entirely, let's keep it simple and just use an optimized multiply
  12. * by GOLDEN_RATIO_32 = 0x61C88647.
  13. *
  14. * The best way to do that appears to be to multiply by 0x8647 with
  15. * shifts and adds, and use mulu.w to multiply the high half by 0x61C8.
  16. *
  17. * Because the 68000 has multi-cycle shifts, this addition chain is
  18. * chosen to minimise the shift distances.
  19. *
  20. * Despite every attempt to spoon-feed it simple operations, GCC
  21. * 6.1.1 doggedly insists on doing annoying things like converting
  22. * "lsl.l #2,<reg>" (12 cycles) to two adds (8+8 cycles).
  23. *
  24. * It also likes to notice two shifts in a row, like "a = x << 2" and
  25. * "a <<= 7", and convert that to "a = x << 9". But shifts longer
  26. * than 8 bits are extra-slow on m68k, so that's a lose.
  27. *
  28. * Since the 68000 is a very simple in-order processor with no
  29. * instruction scheduling effects on execution time, we can safely
  30. * take it out of GCC's hands and write one big asm() block.
  31. *
  32. * Without calling overhead, this operation is 30 bytes (14 instructions
  33. * plus one immediate constant) and 166 cycles.
  34. *
  35. * (Because %2 is fetched twice, it can't be postincrement, and thus it
  36. * can't be a fully general "g" or "m". Register is preferred, but
  37. * offsettable memory or immediate will work.)
  38. */
  39. static inline u32 __attribute_const__ __hash_32(u32 x)
  40. {
  41. u32 a, b;
  42. asm( "move.l %2,%0" /* a = x * 0x0001 */
  43. "\n lsl.l #2,%0" /* a = x * 0x0004 */
  44. "\n move.l %0,%1"
  45. "\n lsl.l #7,%0" /* a = x * 0x0200 */
  46. "\n add.l %2,%0" /* a = x * 0x0201 */
  47. "\n add.l %0,%1" /* b = x * 0x0205 */
  48. "\n add.l %0,%0" /* a = x * 0x0402 */
  49. "\n add.l %0,%1" /* b = x * 0x0607 */
  50. "\n lsl.l #5,%0" /* a = x * 0x8040 */
  51. : "=&d,d" (a), "=&r,r" (b)
  52. : "r,roi?" (x)); /* a+b = x*0x8647 */
  53. return ((u16)(x*0x61c8) << 16) + a + b;
  54. }
  55. #endif /* _ASM_HASH_H */