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
|
/*=========================================================================
Program: Visualization Toolkit
Module: vtkPartitionedArchiver.cxx
Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
All rights reserved.
See Copyright.txt or http://www.kitware.com/Copyright.htm for details.
This software is distributed WITHOUT ANY WARRANTY; without even
the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
PURPOSE. See the above copyright notice for more information.
=========================================================================*/
#include "vtkPartitionedArchiver.h"
#include <vtkObjectFactory.h>
#include <archive.h>
#include <archive_entry.h>
#include <iterator>
#include <map>
#include <string>
VTK_ABI_NAMESPACE_BEGIN
struct vtkPartitionedArchiver::Internal
{
std::map<std::string, std::pair<size_t, char*>> Buffers;
};
//------------------------------------------------------------------------------
vtkStandardNewMacro(vtkPartitionedArchiver);
//------------------------------------------------------------------------------
vtkPartitionedArchiver::vtkPartitionedArchiver()
: Internals(new vtkPartitionedArchiver::Internal)
{
this->SetArchiveName("");
}
//------------------------------------------------------------------------------
vtkPartitionedArchiver::~vtkPartitionedArchiver()
{
for (auto& bufferIt : this->Internals->Buffers)
{
free(bufferIt.second.second);
}
delete this->Internals;
}
//------------------------------------------------------------------------------
void vtkPartitionedArchiver::OpenArchive() {}
//------------------------------------------------------------------------------
void vtkPartitionedArchiver::CloseArchive() {}
//------------------------------------------------------------------------------
void vtkPartitionedArchiver::InsertIntoArchive(
const std::string& relativePath, const char* data, std::size_t size)
{
struct archive* a = archive_write_new();
// use zip format
archive_write_set_format_zip(a);
// Avoid buffer exhausted errors by guaranteeing a sane minimum buffer size.
// The value 10240 is libarchive's default buffer size when writing explicitly
// to file.
size_t bufferSize = (size > 10240 ? size : 10240);
size_t used = 0;
char* b = (char*)malloc(bufferSize);
if (b == nullptr)
{
vtkErrorMacro(<< "Error allocating memory for buffer.");
archive_write_free(a);
return;
}
{
archive_write_open_memory(a, b, bufferSize, &used);
struct archive_entry* entry;
entry = archive_entry_new();
archive_entry_set_filetype(entry, AE_IFREG);
archive_entry_set_perm(entry, 0644);
archive_entry_set_size(entry, size);
archive_entry_set_pathname(entry, relativePath.c_str());
if (archive_write_header(a, entry) != ARCHIVE_OK || archive_write_data(a, data, size) < 0)
{
vtkErrorMacro(<< "Error writing to buffer: " << archive_error_string(a));
archive_write_free(a);
free(b);
return;
}
archive_entry_free(entry);
if (archive_write_close(a) != ARCHIVE_OK)
{
vtkErrorMacro(<< "Error closing buffer: " << archive_error_string(a));
archive_write_free(a);
free(b);
return;
}
archive_write_free(a);
}
// Free previous buffer if we are overwriting a previous path
auto bufferIt = this->Internals->Buffers.find(relativePath);
if (bufferIt != this->Internals->Buffers.end())
{
free(bufferIt->second.second);
}
this->Internals->Buffers[relativePath] = std::make_pair(used, b);
}
//------------------------------------------------------------------------------
bool vtkPartitionedArchiver::Contains(const std::string& relativePath)
{
return this->Internals->Buffers.find(relativePath) != this->Internals->Buffers.end();
}
//------------------------------------------------------------------------------
const char* vtkPartitionedArchiver::GetBuffer(const char* relativePath)
{
auto bufferIt = this->Internals->Buffers.find(std::string(relativePath));
if (bufferIt != this->Internals->Buffers.end())
{
return bufferIt->second.second;
}
return nullptr;
}
//------------------------------------------------------------------------------
const void* vtkPartitionedArchiver::GetBufferAddress(const char* relativePath)
{
auto bufferIt = this->Internals->Buffers.find(std::string(relativePath));
if (bufferIt != this->Internals->Buffers.end())
{
return bufferIt->second.second;
}
return nullptr;
}
//------------------------------------------------------------------------------
std::size_t vtkPartitionedArchiver::GetBufferSize(const char* relativePath)
{
auto bufferIt = this->Internals->Buffers.find(std::string(relativePath));
if (bufferIt != this->Internals->Buffers.end())
{
return bufferIt->second.first;
}
return 0;
}
//------------------------------------------------------------------------------
std::size_t vtkPartitionedArchiver::GetNumberOfBuffers()
{
return this->Internals->Buffers.size();
}
//------------------------------------------------------------------------------
const char* vtkPartitionedArchiver::GetBufferName(size_t i)
{
if (this->Internals->Buffers.size() <= i)
{
return nullptr;
}
return std::next(this->Internals->Buffers.begin(), i)->first.c_str();
}
//------------------------------------------------------------------------------
void vtkPartitionedArchiver::PrintSelf(ostream& os, vtkIndent indent)
{
this->Superclass::PrintSelf(os, indent);
}
VTK_ABI_NAMESPACE_END
|
