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
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
|
/*
Copyright (C) 2012-2014 Carl Hetherington <cth@carlh.net>
This file is part of libdcp.
libdcp 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 of the License, or
(at your option) any later version.
libdcp 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 libdcp. If not, see <http://www.gnu.org/licenses/>.
In addition, as a special exception, the copyright holders give
permission to link the code of portions of this program with the
OpenSSL library under certain conditions as described in each
individual source file, and distribute linked combinations
including the two.
You must obey the GNU General Public License in all respects
for all of the code used other than OpenSSL. If you modify
file(s) with this exception, you may extend this exception to your
version of the file(s), but you are not obligated to do so. If you
do not wish to do so, delete this exception statement from your
version. If you delete this exception statement from all source
files in the program, then also delete it here.
*/
/** @file src/util.cc
* @brief Utility methods.
*/
#include "util.h"
#include "exceptions.h"
#include "types.h"
#include "certificate.h"
#include "openjpeg_image.h"
#include "dcp_assert.h"
#include "compose.hpp"
#include <openjpeg.h>
#include <asdcp/KM_util.h>
#include <asdcp/KM_fileio.h>
#include <asdcp/AS_DCP.h>
#include <xmlsec/xmldsig.h>
#include <xmlsec/dl.h>
#include <xmlsec/app.h>
#include <xmlsec/crypto.h>
#include <libxml++/nodes/element.h>
#include <libxml++/document.h>
#include <openssl/sha.h>
#include <boost/filesystem.hpp>
#include <boost/algorithm/string.hpp>
#include <boost/foreach.hpp>
#include <stdexcept>
#include <iostream>
#include <iomanip>
using std::string;
using std::wstring;
using std::cout;
using std::min;
using std::max;
using std::list;
using std::setw;
using std::setfill;
using std::ostream;
using boost::shared_ptr;
using boost::shared_array;
using boost::optional;
using boost::function;
using boost::algorithm::trim;
using namespace dcp;
/** Create a UUID.
* @return UUID.
*/
string
dcp::make_uuid ()
{
char buffer[64];
Kumu::UUID id;
Kumu::GenRandomValue (id);
id.EncodeHex (buffer, 64);
return string (buffer);
}
string
dcp::make_digest (Data data)
{
SHA_CTX sha;
SHA1_Init (&sha);
SHA1_Update (&sha, data.data().get(), data.size());
byte_t byte_buffer[SHA_DIGEST_LENGTH];
SHA1_Final (byte_buffer, &sha);
char digest[64];
return Kumu::base64encode (byte_buffer, SHA_DIGEST_LENGTH, digest, 64);
}
/** Create a digest for a file.
* @param filename File name.
* @param progress Optional progress reporting function. The function will be called
* with a progress value between 0 and 1.
* @return Digest.
*/
string
dcp::make_digest (boost::filesystem::path filename, function<void (float)> progress)
{
Kumu::FileReader reader;
Kumu::Result_t r = reader.OpenRead (filename.string().c_str ());
if (ASDCP_FAILURE (r)) {
boost::throw_exception (FileError ("could not open file to compute digest", filename, r));
}
SHA_CTX sha;
SHA1_Init (&sha);
int const buffer_size = 65536;
Kumu::ByteString read_buffer (buffer_size);
Kumu::fsize_t done = 0;
Kumu::fsize_t const size = reader.Size ();
while (1) {
ui32_t read = 0;
Kumu::Result_t r = reader.Read (read_buffer.Data(), read_buffer.Capacity(), &read);
if (r == Kumu::RESULT_ENDOFFILE) {
break;
} else if (ASDCP_FAILURE (r)) {
boost::throw_exception (FileError ("could not read file to compute digest", filename, r));
}
SHA1_Update (&sha, read_buffer.Data(), read);
if (progress) {
progress (float (done) / size);
done += read;
}
}
byte_t byte_buffer[SHA_DIGEST_LENGTH];
SHA1_Final (byte_buffer, &sha);
char digest[64];
return Kumu::base64encode (byte_buffer, SHA_DIGEST_LENGTH, digest, 64);
}
/** @param s A string.
* @return true if the string contains only space, newline or tab characters, or is empty.
*/
bool
dcp::empty_or_white_space (string s)
{
for (size_t i = 0; i < s.length(); ++i) {
if (s[i] != ' ' && s[i] != '\n' && s[i] != '\t') {
return false;
}
}
return true;
}
/** Set up various bits that the library needs. Should be called one
* by client applications.
*/
void
dcp::init ()
{
if (xmlSecInit() < 0) {
throw MiscError ("could not initialise xmlsec");
}
#ifdef XMLSEC_CRYPTO_DYNAMIC_LOADING
if (xmlSecCryptoDLLoadLibrary(BAD_CAST XMLSEC_CRYPTO) < 0) {
throw MiscError ("unable to load default xmlsec-crypto library");
}
#endif
if (xmlSecCryptoAppInit(0) < 0) {
throw MiscError ("could not initialise crypto");
}
if (xmlSecCryptoInit() < 0) {
throw MiscError ("could not initialise xmlsec-crypto");
}
OpenSSL_add_all_algorithms();
}
/** Decode a base64 string. The base64 decode routine in KM_util.cpp
* gives different values to both this and the command-line base64
* for some inputs. Not sure why.
*
* @param in base64-encoded string.
* @param out Output buffer.
* @param out_length Length of output buffer.
* @return Number of characters written to the output buffer.
*/
int
dcp::base64_decode (string const & in, unsigned char* out, int out_length)
{
BIO* b64 = BIO_new (BIO_f_base64 ());
/* This means the input should have no newlines */
BIO_set_flags (b64, BIO_FLAGS_BASE64_NO_NL);
/* Copy our input string, removing newlines */
char in_buffer[in.size() + 1];
char* p = in_buffer;
for (size_t i = 0; i < in.size(); ++i) {
if (in[i] != '\n' && in[i] != '\r') {
*p++ = in[i];
}
}
BIO* bmem = BIO_new_mem_buf (in_buffer, p - in_buffer);
bmem = BIO_push (b64, bmem);
int const N = BIO_read (bmem, out, out_length);
BIO_free_all (bmem);
return N;
}
/** @param p Path to open.
* @param t mode flags, as for fopen(3).
* @return FILE pointer or 0 on error.
*
* Apparently there is no way to create an ofstream using a UTF-8
* filename under Windows. We are hence reduced to using fopen
* with this wrapper.
*/
FILE *
dcp::fopen_boost (boost::filesystem::path p, string t)
{
#ifdef LIBDCP_WINDOWS
wstring w (t.begin(), t.end());
/* c_str() here should give a UTF-16 string */
return _wfopen (p.c_str(), w.c_str ());
#else
return fopen (p.c_str(), t.c_str ());
#endif
}
optional<boost::filesystem::path>
dcp::relative_to_root (boost::filesystem::path root, boost::filesystem::path file)
{
boost::filesystem::path::const_iterator i = root.begin ();
boost::filesystem::path::const_iterator j = file.begin ();
while (i != root.end() && j != file.end() && *i == *j) {
++i;
++j;
}
if (i != root.end ()) {
return optional<boost::filesystem::path> ();
}
boost::filesystem::path rel;
while (j != file.end ()) {
rel /= *j++;
}
return rel;
}
bool
dcp::ids_equal (string a, string b)
{
transform (a.begin(), a.end(), a.begin(), ::tolower);
transform (b.begin(), b.end(), b.begin(), ::tolower);
trim (a);
trim (b);
return a == b;
}
string
dcp::file_to_string (boost::filesystem::path p, uintmax_t max_length)
{
uintmax_t len = boost::filesystem::file_size (p);
if (len > max_length) {
throw MiscError (String::compose ("Unexpectedly long file (%1)", p.string()));
}
FILE* f = fopen_boost (p, "r");
if (!f) {
throw FileError ("could not open file", p, errno);
}
char* c = new char[len];
/* This may read less than `len' if we are on Windows and we have CRLF in the file */
int const N = fread (c, 1, len, f);
fclose (f);
string s (c, N);
delete[] c;
return s;
}
/** @param key RSA private key in PEM format (optionally with -----BEGIN... / -----END...)
* @return SHA1 fingerprint of key
*/
string
dcp::private_key_fingerprint (string key)
{
boost::replace_all (key, "-----BEGIN RSA PRIVATE KEY-----\n", "");
boost::replace_all (key, "\n-----END RSA PRIVATE KEY-----\n", "");
unsigned char buffer[4096];
int const N = base64_decode (key, buffer, sizeof (buffer));
SHA_CTX sha;
SHA1_Init (&sha);
SHA1_Update (&sha, buffer, N);
uint8_t digest[20];
SHA1_Final (digest, &sha);
char digest_base64[64];
return Kumu::base64encode (digest, 20, digest_base64, 64);
}
xmlpp::Node *
dcp::find_child (xmlpp::Node const * node, string name)
{
xmlpp::Node::NodeList c = node->get_children ();
xmlpp::Node::NodeList::iterator i = c.begin();
while (i != c.end() && (*i)->get_name() != name) {
++i;
}
DCP_ASSERT (i != c.end ());
return *i;
}
string
dcp::remove_urn_uuid (string raw)
{
DCP_ASSERT (raw.substr(0, 9) == "urn:uuid:");
return raw.substr (9);
}
string
dcp::openjpeg_version ()
{
return opj_version ();
}
string
dcp::spaces (int n)
{
string s = "";
for (int i = 0; i < n; ++i) {
s += " ";
}
return s;
}
void
dcp::indent (xmlpp::Element* element, int initial)
{
xmlpp::Node* last = 0;
BOOST_FOREACH (xmlpp::Node * n, element->get_children()) {
xmlpp::Element* e = dynamic_cast<xmlpp::Element*>(n);
if (e) {
element->add_child_text_before (e, "\n" + spaces(initial + 2));
indent (e, initial + 2);
last = n;
}
}
if (last) {
element->add_child_text (last, "\n" + spaces(initial));
}
}
/** @return true if the day represented by \ref a is less than or
* equal to the one represented by \ref b, ignoring the time parts.
*/
bool
dcp::day_less_than_or_equal (LocalTime a, LocalTime b)
{
if (a.year() != b.year()) {
return a.year() < b.year();
}
if (a.month() != b.month()) {
return a.month() < b.month();
}
return a.day() <= b.day();
}
/** @return true if the day represented by \ref a is greater than or
* equal to the one represented by \ref b, ignoring the time parts.
*/
bool
dcp::day_greater_than_or_equal (LocalTime a, LocalTime b)
{
if (a.year() != b.year()) {
return a.year() > b.year();
}
if (a.month() != b.month()) {
return a.month() > b.month();
}
return a.day() >= b.day();
}
/** Try quite hard to find a string which starts with \ref base and is
* not in \ref existing.
*/
string
dcp::unique_string (list<string> existing, string base)
{
int const max_tries = existing.size() + 1;
for (int i = 0; i < max_tries; ++i) {
string trial = String::compose("%1%2", base, i);
if (find(existing.begin(), existing.end(), trial) == existing.end()) {
return trial;
}
}
DCP_ASSERT (false);
}
|