bitfield.h 4.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125
  1. /* <!-- copyright */
  2. /*
  3. * aria2 - The high speed download utility
  4. *
  5. * Copyright (C) 2009 Tatsuhiro Tsujikawa
  6. *
  7. * This program is free software; you can redistribute it and/or modify
  8. * it under the terms of the GNU General Public License as published by
  9. * the Free Software Foundation; either version 2 of the License, or
  10. * (at your option) any later version.
  11. *
  12. * This program is distributed in the hope that it will be useful,
  13. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  14. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  15. * GNU General Public License for more details.
  16. *
  17. * You should have received a copy of the GNU General Public License
  18. * along with this program; if not, write to the Free Software
  19. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  20. *
  21. * In addition, as a special exception, the copyright holders give
  22. * permission to link the code of portions of this program with the
  23. * OpenSSL library under certain conditions as described in each
  24. * individual source file, and distribute linked combinations
  25. * including the two.
  26. * You must obey the GNU General Public License in all respects
  27. * for all of the code used other than OpenSSL. If you modify
  28. * file(s) with this exception, you may extend this exception to your
  29. * version of the file(s), but you are not obligated to do so. If you
  30. * do not wish to do so, delete this exception statement from your
  31. * version. If you delete this exception statement from all source
  32. * files in the program, then also delete it here.
  33. */
  34. /* copyright --> */
  35. #ifndef _D_BITFIELD_H_
  36. #define _D_BITFIELD_H_
  37. #include "common.h"
  38. #include <cassert>
  39. #include <cstdlib>
  40. #include <cstring>
  41. #include "util.h"
  42. namespace aria2 {
  43. namespace bitfield {
  44. // Returns the bit mask for the last byte. For example, nbits = 9,
  45. // then 0x80 is returned. nbits = 12, then 0xf0 is returned.
  46. inline unsigned char lastByteMask(size_t nbits)
  47. {
  48. return -256 >> (8-((nbits+7)/8*8-nbits));
  49. }
  50. // Returns true if index-th bits is set. Otherwise returns false.
  51. template<typename Array>
  52. inline bool test(const Array& bitfield, size_t nbits, size_t index)
  53. {
  54. assert(index < nbits);
  55. unsigned char mask = 128 >> (index%8);
  56. return (bitfield[index/8]&mask) != 0;
  57. }
  58. inline size_t countBit32(uint32_t n)
  59. {
  60. static const int nbits[] = {
  61. 0, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 4,
  62. 1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5,
  63. 1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5,
  64. 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6,
  65. 1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5,
  66. 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6,
  67. 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6,
  68. 3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7,
  69. 1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5,
  70. 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6,
  71. 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6,
  72. 3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7,
  73. 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6,
  74. 3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7,
  75. 3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7,
  76. 4, 5, 5, 6, 5, 6, 6, 7, 5, 6, 6, 7, 6, 7, 7, 8,
  77. };
  78. return
  79. nbits[n&0xffu]+
  80. nbits[(n >> 8)&0xffu]+
  81. nbits[(n >> 16)&0xffu]+
  82. nbits[(n >> 24)&0xffu];
  83. }
  84. // Counts set bit in bitfield.
  85. inline size_t countSetBit(const unsigned char* bitfield, size_t nbits)
  86. {
  87. if(nbits == 0) {
  88. return 0;
  89. }
  90. size_t count = 0;
  91. size_t size = sizeof(uint32_t);
  92. size_t len = (nbits+7)/8;
  93. if(nbits%32 != 0) {
  94. --len;
  95. count +=
  96. countBit32(static_cast<uint32_t>(bitfield[len]&lastByteMask(nbits)));
  97. }
  98. size_t to = len/size;
  99. for(size_t i = 0; i < to; ++i) {
  100. uint32_t v;
  101. memcpy(&v, &bitfield[i*size], sizeof(v));
  102. count += countBit32(v);
  103. }
  104. for(size_t i = len-len%size; i < len; ++i) {
  105. count += countBit32(static_cast<uint32_t>(bitfield[i]));
  106. }
  107. return count;
  108. }
  109. void flipBit(unsigned char* data, size_t length, size_t bitIndex);
  110. } // namespace bitfield
  111. } // namespace aria2
  112. #endif // _D_BITFIELD_H_