Repository navigation
Expand file tree
/
Copy pathPool.cpp
More file actions
220 lines (175 loc) · 4.63 KB
/
Copy pathPool.cpp
File metadata and controls
220 lines (175 loc) · 4.63 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
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
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
/*
* Copyright (C) 2010 Gabest
* http://code.google.com/p/zfs-win/
*
* This Program 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 2, 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 GNU Make; see the file COPYING. If not, write to
* the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.
* http://www.gnu.org/copyleft/gpl.html
*
*/
#include "stdafx.h"
#include "Pool.h"
#include "Hash.h"
#include "Compress.h"
#include "String.h"
namespace ZFS
{
Pool::Pool()
: m_guid(0)
{
}
Pool::~Pool()
{
Close();
}
bool Pool::Open(const std::list<std::wstring>& paths, const wchar_t* name)
{
Close();
if(name != NULL)
{
m_name = Util::UTF16To8(name);
}
for(auto i = paths.begin(); i != paths.end(); i++)
{
Device* dev = new Device();
if(!dev->Open(i->c_str()))
{
return false;
}
if(m_name.empty())
{
m_name = dev->m_desc.pool.name;
}
if(m_name == dev->m_desc.pool.name && (m_guid == 0 || m_guid == dev->m_desc.pool.guid))
{
m_guid = dev->m_desc.pool.guid;
m_devs.push_back(dev);
auto cmp_tree = [&] (const VirtualDevice* vdev) -> bool {return vdev->guid == dev->m_desc.top.guid;};
if(std::find_if(m_vdevs.begin(), m_vdevs.end(), cmp_tree) == m_vdevs.end())
{
m_vdevs.push_back(&dev->m_desc.top);
}
}
else
{
delete dev;
}
}
if(m_devs.empty())
{
return false;
}
for(auto i = m_vdevs.begin(); i != m_vdevs.end(); i++)
{
std::list<VirtualDevice*> leaves;
VirtualDevice* vdev = *i;
vdev->GetLeaves(leaves);
uint32_t missing = 0;
for(auto j = leaves.begin(); j != leaves.end(); j++)
{
VirtualDevice* leaf = *j;
for(auto k = m_devs.begin(); k != m_devs.end(); k++)
{
Device* dev = *k;
if(leaf->guid == dev->m_desc.guid)
{
ASSERT(vdev->guid == dev->m_desc.top_guid);
leaf->dev = dev;
break;
}
}
if(leaf->dev == NULL)
{
missing++;
}
}
if(vdev->type == "raidz" && missing <= vdev->nparity
|| vdev->type == "mirror" && missing < vdev->children.size()
|| missing == 0)
{
if(missing > 0)
{
wprintf(L"WARNING: vdev %I64d has %d missing disk(s)\n", vdev->id, missing);
}
}
else
{
wprintf(L"ERROR: vdev %I64d has too many (%d) missing disk(s)\n", vdev->id, missing);
return false;
}
}
return true;
}
void Pool::Close()
{
for(auto i = m_devs.begin(); i != m_devs.end(); i++)
{
delete *i;
}
m_guid = 0;
m_name.clear();
m_devs.clear();
m_vdevs.clear();
}
bool Pool::Read(uint8_t* dst, size_t size, blkptr_t* bp)
{
ASSERT(((UINT_PTR)dst & 15) == 0);
bool succeeded = false;
size_t psize = ((size_t)bp->psize + 1) << 9;
size_t lsize = ((size_t)bp->lsize + 1) << 9;
if(size < lsize) return false;
uint8_t* src = bp->comp_type != ZIO_COMPRESS_OFF ? (uint8_t*)_aligned_malloc(psize, 16) : NULL;
for(int i = 0; i < 3 && !succeeded; i++)
{
dva_t* addr = &bp->blk_dva[i];
ASSERT(addr->gang == 0); // TODO: zio_gbh_phys_t (not used ??? never encountered one, yet)
for(auto i = m_vdevs.begin(); i != m_vdevs.end(); i++)
{
VirtualDevice* vdev = *i;
if(vdev->id == addr->vdev)
{
BYTE* ptr = src != NULL ? src : dst;
if(vdev->Read(ptr, psize, addr->offset << 9))
{
if(Verify(ptr, psize, bp->cksum_type, bp->cksum))
{
if(ptr != src || ZFS::decompress(ptr, dst, psize, lsize, bp->comp_type))
{
succeeded = true;
}
}
else
{
printf("cksum error (vdev=%I64d offset=%I64d)\n", vdev->id, addr->offset << 9);
}
}
else
{
printf("cannot read device (vdev=%I64d offset=%I64d)\n", vdev->id, addr->offset << 9);
}
break;
}
}
}
if(src != NULL) _aligned_free(src);
return succeeded;
}
bool Pool::Verify(uint8_t* buff, size_t size, uint8_t cksum_type, cksum_t& cksum)
{
cksum_t c;
ZFS::hash(buff, size, &c, cksum_type);
// ASSERT(cksum == c);
return cksum == c;
}
}