BitMap.cpp
1.72 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
/* Copyright (C) 2010-2012 kaosu (qiupf2000@gmail.com)
* This file is part of the Interactive Text Hooker.
* Interactive Text Hooker is free software: you can redistribute it and/or
* modify it under the terms of the GNU General Public License as published
* by the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include <ITH\BitMap.h>
#include <intrin.h>
BitMap::BitMap(): size(0x20)
{
//map=new unsigned char[size];
}
BitMap::BitMap(unsigned long init_size): size(init_size>>3)
{
map=new unsigned char[size];
}
BitMap::~BitMap()
{
if (map)
{
delete map;
map=0;
}
}
bool BitMap::Check(unsigned long number)
{
if ((number>>3)>=size) return false;
return (map[number>>3]&(1<<(number&7)))!=0;
}
void BitMap::Set(unsigned long number)
{
if (number>>16) return;
unsigned long s=number>>3;
unsigned long t=s>>2;
if (s&3) t++;
s=t<<2; //Align to 4 unsigned char.
if (s>=size)
{
t=size;
while (s>=size) size<<=1;
unsigned char* temp=new unsigned char[size];
memcpy(temp,map,t);
delete map;
map=temp;
}
map[number>>3]|=1<<(number&7);
}
void BitMap::Reset()
{
memset(map,0,size);
}
void BitMap::Clear(unsigned long number)
{
if ((number>>3)>=size) return;
map[number>>3]&=~(1<<(number&7));
}