ffs.S 4.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109
  1. /* $OpenBSD: ffs.S,v 1.4 2007/11/25 18:25:36 deraadt Exp $ */
  2. /* $NetBSD: ffs.S,v 1.2 1998/11/26 19:32:10 eeh Exp $ */
  3. /*
  4. * Copyright (c) 1992, 1993
  5. * The Regents of the University of California. All rights reserved.
  6. *
  7. * This software was developed by the Computer Systems Engineering group
  8. * at Lawrence Berkeley Laboratory under DARPA contract BG 91-66 and
  9. * contributed to Berkeley.
  10. *
  11. * Redistribution and use in source and binary forms, with or without
  12. * modification, are permitted provided that the following conditions
  13. * are met:
  14. * 1. Redistributions of source code must retain the above copyright
  15. * notice, this list of conditions and the following disclaimer.
  16. * 2. Redistributions in binary form must reproduce the above copyright
  17. * notice, this list of conditions and the following disclaimer in the
  18. * documentation and/or other materials provided with the distribution.
  19. * 3. Neither the name of the University nor the names of its contributors
  20. * may be used to endorse or promote products derived from this software
  21. * without specific prior written permission.
  22. *
  23. * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  24. * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  25. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  26. * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  27. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  28. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  29. * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  30. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  31. * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  32. * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  33. * SUCH DAMAGE.
  34. *
  35. * Header: ffs.s,v 1.3 92/07/07 00:23:57 torek Exp
  36. */
  37. #include "DEFS.h"
  38. /*
  39. * ffs returns the number of the rightmost bit set in its argument,
  40. * i.e., the lowest value such that (x & (ffs(x) - 1)) is nonzero.
  41. * If no bits are set, ffs returns 0.
  42. *
  43. * We use a table lookup on each byte.
  44. *
  45. * In each section below, %o1 is the current byte (0, 1, 2, or 3).
  46. * The last byte is handled specially: for the first three,
  47. * if that byte is nonzero, we return the table value
  48. * (plus 0, 8, or 16 for the byte number), but for the last
  49. * one, we just return the table value plus 24. This means
  50. * that ffstab[0] must be -24 so that ffs(0) will return 0.
  51. */
  52. ENTRY(ffs)
  53. #ifdef PIC
  54. PICCY_SET(_C_LABEL(__ffstab), %o2, %o5)
  55. #else
  56. set _C_LABEL(__ffstab), %o2
  57. #endif
  58. andcc %o0, 0xff, %o1 ! get low byte
  59. be,a 1f ! try again if 0
  60. srl %o0, 8, %o0 ! delay slot, get ready for next byte
  61. retl ! return ffstab[%o1]
  62. ldsb [%o2 + %o1], %o0
  63. 1:
  64. andcc %o0, 0xff, %o1 ! byte 1 like byte 0...
  65. be,a 2f
  66. srl %o0, 8, %o0 ! (use delay to prepare for byte 2)
  67. ldsb [%o2 + %o1], %o0
  68. retl ! return ffstab[%o1] + 8
  69. add %o0, 8, %o0
  70. 2:
  71. andcc %o0, 0xff, %o1
  72. be,a 3f
  73. srl %o0, 8, %o0 ! (prepare for byte 3)
  74. ldsb [%o2 + %o1], %o0
  75. retl ! return ffstab[%o1] + 16
  76. add %o0, 16, %o0
  77. 3: ! just return ffstab[%o0] + 24
  78. ldsb [%o2 + %o0], %o0
  79. retl
  80. add %o0, 24, %o0
  81. .globl _C_LABEL(__ffstab)
  82. _C_LABEL(__ffstab):
  83. .byte -24,1,2,1,3,1,2,1,4,1,2,1,3,1,2,1 /* 00-0f */
  84. .byte 5,1,2,1,3,1,2,1,4,1,2,1,3,1,2,1 /* 10-1f */
  85. .byte 6,1,2,1,3,1,2,1,4,1,2,1,3,1,2,1 /* 20-2f */
  86. .byte 5,1,2,1,3,1,2,1,4,1,2,1,3,1,2,1 /* 30-3f */
  87. .byte 7,1,2,1,3,1,2,1,4,1,2,1,3,1,2,1 /* 40-4f */
  88. .byte 5,1,2,1,3,1,2,1,4,1,2,1,3,1,2,1 /* 50-5f */
  89. .byte 6,1,2,1,3,1,2,1,4,1,2,1,3,1,2,1 /* 60-6f */
  90. .byte 5,1,2,1,3,1,2,1,4,1,2,1,3,1,2,1 /* 70-7f */
  91. .byte 8,1,2,1,3,1,2,1,4,1,2,1,3,1,2,1 /* 80-8f */
  92. .byte 5,1,2,1,3,1,2,1,4,1,2,1,3,1,2,1 /* 10-9f */
  93. .byte 6,1,2,1,3,1,2,1,4,1,2,1,3,1,2,1 /* a0-af */
  94. .byte 5,1,2,1,3,1,2,1,4,1,2,1,3,1,2,1 /* b0-bf */
  95. .byte 7,1,2,1,3,1,2,1,4,1,2,1,3,1,2,1 /* c0-cf */
  96. .byte 5,1,2,1,3,1,2,1,4,1,2,1,3,1,2,1 /* d0-df */
  97. .byte 6,1,2,1,3,1,2,1,4,1,2,1,3,1,2,1 /* e0-ef */
  98. .byte 5,1,2,1,3,1,2,1,4,1,2,1,3,1,2,1 /* f0-ff */