Keyboard firmwares for Atmel AVR and Cortex-M
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

util.c 2.5KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101
  1. /*
  2. Copyright 2011 Jun Wako <[email protected]>
  3. This program is free software: you can redistribute it and/or modify
  4. it under the terms of the GNU General Public License as published by
  5. the Free Software Foundation, either version 2 of the License, or
  6. (at your option) any later version.
  7. This program is distributed in the hope that it will be useful,
  8. but WITHOUT ANY WARRANTY; without even the implied warranty of
  9. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  10. GNU General Public License for more details.
  11. You should have received a copy of the GNU General Public License
  12. along with this program. If not, see <http://www.gnu.org/licenses/>.
  13. */
  14. #include "util.h"
  15. // bit population - return number of on-bit
  16. uint8_t bitpop(uint8_t bits)
  17. {
  18. uint8_t c;
  19. for (c = 0; bits; c++)
  20. bits &= bits - 1;
  21. return c;
  22. /*
  23. const uint8_t bit_count[] = { 0, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 4 };
  24. return bit_count[bits>>4] + bit_count[bits&0x0F]
  25. */
  26. }
  27. uint8_t bitpop16(uint16_t bits)
  28. {
  29. uint8_t c;
  30. for (c = 0; bits; c++)
  31. bits &= bits - 1;
  32. return c;
  33. }
  34. uint8_t bitpop32(uint32_t bits)
  35. {
  36. uint8_t c;
  37. for (c = 0; bits; c++)
  38. bits &= bits - 1;
  39. return c;
  40. }
  41. // most significant on-bit - return highest location of on-bit
  42. // NOTE: return 0 when bit0 is on or all bits are off
  43. uint8_t biton(uint8_t bits)
  44. {
  45. uint8_t n = 0;
  46. if (bits >> 4) { bits >>= 4; n += 4;}
  47. if (bits >> 2) { bits >>= 2; n += 2;}
  48. if (bits >> 1) { bits >>= 1; n += 1;}
  49. return n;
  50. }
  51. uint8_t biton16(uint16_t bits)
  52. {
  53. uint8_t n = 0;
  54. if (bits >> 8) { bits >>= 8; n += 8;}
  55. if (bits >> 4) { bits >>= 4; n += 4;}
  56. if (bits >> 2) { bits >>= 2; n += 2;}
  57. if (bits >> 1) { bits >>= 1; n += 1;}
  58. return n;
  59. }
  60. uint8_t biton32(uint32_t bits)
  61. {
  62. uint8_t n = 0;
  63. if (bits >>16) { bits >>=16; n +=16;}
  64. if (bits >> 8) { bits >>= 8; n += 8;}
  65. if (bits >> 4) { bits >>= 4; n += 4;}
  66. if (bits >> 2) { bits >>= 2; n += 2;}
  67. if (bits >> 1) { bits >>= 1; n += 1;}
  68. return n;
  69. }
  70. uint8_t bitrev(uint8_t bits)
  71. {
  72. bits = (bits & 0x0f)<<4 | (bits & 0xf0)>>4;
  73. bits = (bits & 0b00110011)<<2 | (bits & 0b11001100)>>2;
  74. bits = (bits & 0b01010101)<<1 | (bits & 0b10101010)>>1;
  75. return bits;
  76. }
  77. uint16_t bitrev16(uint16_t bits)
  78. {
  79. bits = bitrev(bits & 0x00ff)<<8 | bitrev((bits & 0xff00)>>8);
  80. return bits;
  81. }
  82. uint32_t bitrev32(uint32_t bits)
  83. {
  84. bits = (uint32_t)bitrev16(bits & 0x0000ffff)<<16 | bitrev16((bits & 0xffff0000)>>16);
  85. return bits;
  86. }