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
|
/*
Copyright (c) 2005-2018, John Hurst
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. The name of the author may not be used to endorse or promote products
derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
/*! \file KLV.h
\version $Id$
\brief KLV objects
*/
#ifndef _KLV_H_
#define _KLV_H_
#include <KM_fileio.h>
#include <KM_memio.h>
#include "AS_DCP.h"
#include "MDD.h"
#include <map>
namespace ASDCP
{
const ui32_t MXF_BER_LENGTH = 4;
const ui32_t MXF_TAG_LENGTH = 2;
const ui32_t SMPTE_UL_LENGTH = 16;
const ui32_t SMPTE_UMID_LENGTH = 32;
const byte_t SMPTE_UL_START[4] = { 0x06, 0x0e, 0x2b, 0x34 };
#ifndef MAX_KLV_PACKET_LENGTH
const ui32_t MAX_KLV_PACKET_LENGTH = 1024*1024*64;
#endif
const ui32_t IdentBufferLen = 128;
const ui32_t IntBufferLen = 64;
inline const char* i64sz(i64_t i, char* buf)
{
assert(buf);
#ifdef WIN32
snprintf(buf, IntBufferLen, "%I64d", i);
#else
snprintf(buf, IntBufferLen, "%lld", i);
#endif
return buf;
}
inline const char* ui64sz(ui64_t i, char* buf)
{
assert(buf);
#ifdef WIN32
snprintf(buf, IntBufferLen, "%I64u", i);
#else
snprintf(buf, IntBufferLen, "%llu", i);
#endif
return buf;
}
struct TagValue
{
byte_t a;
byte_t b;
inline bool operator<(const TagValue& rhs) const {
if ( a < rhs.a ) return true;
if ( a == rhs.a && b < rhs.b ) return true;
return false;
}
inline bool operator==(const TagValue& rhs) const {
if ( a != rhs.a ) return false;
if ( b != rhs.b ) return false;
return true;
}
};
using Kumu::UUID;
// Universal Label
class UL : public Kumu::Identifier<SMPTE_UL_LENGTH>
{
public:
UL() {}
UL(const UL& rhs) : Kumu::Identifier<SMPTE_UL_LENGTH>(rhs) {}
UL(const byte_t* value) : Kumu::Identifier<SMPTE_UL_LENGTH>(value) {}
virtual ~UL() {}
const char* EncodeString(char* str_buf, ui32_t buf_len) const;
bool operator==(const UL& rhs) const;
bool MatchIgnoreStream(const UL& rhs) const;
bool MatchExact(const UL& rhs) const;
};
// UMID
class UMID : public Kumu::Identifier<SMPTE_UMID_LENGTH>
{
public:
UMID() {}
UMID(const UMID& rhs) : Kumu::Identifier<SMPTE_UMID_LENGTH>(rhs) {}
UMID(const byte_t* value) : Kumu::Identifier<SMPTE_UMID_LENGTH>(value) {}
virtual ~UMID() {}
void MakeUMID(int Type);
void MakeUMID(int Type, const UUID& ID);
const char* EncodeString(char* str_buf, ui32_t buf_len) const;
};
const byte_t nil_UMID[SMPTE_UMID_LENGTH] = {0};
const UMID NilUMID(nil_UMID);
//
struct MDDEntry
{
byte_t ul[SMPTE_UL_LENGTH];
TagValue tag;
bool optional;
const char* name;
};
const MDDEntry& MXFInterop_OPAtom_Entry();
const MDDEntry& SMPTE_390_OPAtom_Entry();
//
class Dictionary
{
std::map<ASDCP::UL, ui32_t> m_md_lookup;
std::map<std::string, ui32_t> m_md_sym_lookup;
std::map<ui32_t, ASDCP::UL> m_md_rev_lookup;
ASDCP_NO_COPY_CONSTRUCT(Dictionary);
public:
MDDEntry m_MDD_Table[(ui32_t)ASDCP::MDD_Max];
Dictionary();
~Dictionary();
void Init();
bool AddEntry(const MDDEntry& Entry, ui32_t index);
bool DeleteEntry(ui32_t index);
const MDDEntry* FindULAnyVersion(const byte_t*) const;
const MDDEntry* FindULExact(const byte_t*) const;
const MDDEntry* FindSymbol(const std::string&) const;
const MDDEntry& Type(MDD_t type_id) const;
MDDEntry& MutableType(MDD_t type_id);
inline const byte_t* ul(MDD_t type_id) const {
return Type(type_id).ul;
}
void Dump(FILE* = 0) const;
};
const Dictionary& AtmosSMPTEDict();
const Dictionary& DefaultSMPTEDict();
const Dictionary& DefaultInteropDict();
const Dictionary& DefaultCompositeDict();
void default_md_object_init();
//
class IPrimerLookup
{
public:
virtual ~IPrimerLookup() {}
virtual void ClearTagList() = 0;
virtual Result_t InsertTag(const MDDEntry& Entry, ASDCP::TagValue& Tag) = 0;
virtual Result_t TagForKey(const ASDCP::UL& Key, ASDCP::TagValue& Tag) = 0;
};
//
class KLVPacket
{
ASDCP_NO_COPY_CONSTRUCT(KLVPacket);
protected:
const byte_t* m_KeyStart;
ui32_t m_KLLength;
const byte_t* m_ValueStart;
ui64_t m_ValueLength;
UL m_UL;
public:
KLVPacket() : m_KeyStart(0), m_KLLength(0), m_ValueStart(0), m_ValueLength(0) {}
virtual ~KLVPacket() {}
inline ui64_t PacketLength() {
return m_KLLength + m_ValueLength;
}
inline ui64_t ValueLength() {
return m_ValueLength;
}
inline ui32_t KLLength() {
return m_KLLength;
}
virtual UL GetUL();
virtual bool SetUL(const UL&);
virtual bool HasUL(const byte_t*);
virtual Result_t InitFromBuffer(const byte_t*, ui32_t);
virtual Result_t InitFromBuffer(const byte_t*, ui32_t, const UL& label);
virtual Result_t WriteKLToBuffer(ASDCP::FrameBuffer&, const UL& label, ui32_t length);
virtual Result_t WriteKLToBuffer(ASDCP::FrameBuffer& fb, ui32_t length)
{
if ( ! m_UL.HasValue() )
{
return RESULT_STATE;
}
return WriteKLToBuffer(fb, m_UL, length);
}
virtual void Dump(FILE*, const Dictionary& Dict, bool show_value);
};
//
class KLVFilePacket : public KLVPacket
{
ASDCP_NO_COPY_CONSTRUCT(KLVFilePacket);
public:
ASDCP::FrameBuffer m_Buffer;
KLVFilePacket() {}
virtual ~KLVFilePacket() {}
virtual Result_t InitFromFile(const Kumu::FileReader&);
virtual Result_t InitFromFile(const Kumu::FileReader&, const UL& label);
virtual Result_t WriteKLToFile(Kumu::FileWriter& Writer, const UL& label, ui32_t length);
};
} // namespace ASDCP
#endif // _KLV_H_
//
// end KLV.h
//
|