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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
/******************************************
Copyright (C) 2009-2020 Authors of CryptoMiniSat, see AUTHORS file
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
***********************************************/
#include "watcharray.h"
#include <algorithm>
using namespace CMSat;
void watch_array::consolidate()
{
size_t total_needed = total_needed_during_consolidate();
vector<Mem> newmems;
size_t at_watches = 0;
//size_t last_needed = 0;
while(total_needed > 0) {
Mem newmem;
size_t needed = std::min<size_t>(total_needed, WATCH_MAX_SIZE_ONE_ALLOC);
assert(needed > 0);
//If last one was larger than this, let's take the last one
//needed = std::max<size_t>(needed, last_needed/2);
//last_needed = needed;
total_needed -= needed;
newmem.alloc = needed;
newmem.base_ptr = (Watched*)malloc(newmem.alloc*sizeof(Watched));
for(; at_watches < watches.size(); at_watches++) {
//Not used
if (watches[at_watches].size == 0) {
watches[at_watches] = Elem();
continue;
}
Elem& ws = watches[at_watches];
//Allow for some space to breathe
size_t toalloc = extra_space_during_consolidate(ws.size);
//Does not fit into this 'newmem'
if (newmem.next_space_offset + toalloc > newmem.alloc) {
break;
}
ws.alloc = toalloc;
Watched* orig_ptr = mems[ws.num].base_ptr + ws.offset;
Watched* new_ptr = newmem.base_ptr + newmem.next_space_offset;
memmove(new_ptr, orig_ptr, ws.size * sizeof(Watched));
ws.num = newmems.size();
ws.offset = newmem.next_space_offset;
//ws.accessed = 0;
newmem.next_space_offset += ws.alloc;
}
newmems.push_back(newmem);
}
assert(at_watches == watches.size());
assert(total_needed == 0);
for(size_t i = 0; i < mems.size(); i++) {
free(mems[i].base_ptr);
}
mems = newmems;
for(auto& mem: free_mem) {
mem.clear();
}
free_mem_used = 0;
free_mem_not_used = 0;
}
void watch_array::print_stat(bool detailed) const
{
cout
<< "c [watch] mems.size(): " << mems.size()
<< " free mem used/unused:"
<< free_mem_used << "/" << free_mem_not_used
<< " ("
<< std::fixed << std::setprecision(2)
<< stats_line_percent(free_mem_used, free_mem_not_used+free_mem_used)
<< "%)"
<< endl;
if (detailed) {
for(size_t i = 0; i < mems.size(); i++) {
const Mem& mem = mems[i];
cout
<< " c [watch] mem " << i
<< " alloc: " << mem.alloc
<< " next_space_offset: " << mem.next_space_offset
<< " base_ptr: " << mem.base_ptr
<< endl;
}
cout << "c [watch] free stats:" << endl;
for(size_t i = 0; i < free_mem.size(); i++)
{
cout << "c [watch] ->free_mem[" << i << "]: " << free_mem[i].size() << endl;
}
}
/*for(size_t i = 0; i < watches.size(); i++) {
cout << "ws[" << i << "] accessed: " << watches[i].accessed << " size: " << watches[i].size << endl;
}*/
}