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
|
/*
Copyright (c) 2006-2009, 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 Dict.cpp
\version $Id$
\brief MXF dictionary
*/
#include "KM_mutex.h"
#include "KLV.h"
#include "MDD.cpp"
#include <map>
static Kumu::Mutex s_Lock;
static bool s_md_init = false;
static std::map<ASDCP::UL, ui32_t> s_md_lookup;
//------------------------------------------------------------------------------------------
static ASDCP::Dictionary s_SMPTEDict;
static ASDCP::Dictionary s_InteropDict;
static ASDCP::Dictionary s_CompositeDict;
const ASDCP::Dictionary&
ASDCP::DefaultSMPTEDict() { return s_SMPTEDict; }
const ASDCP::Dictionary&
ASDCP::DefaultInteropDict() { return s_InteropDict; }
const ASDCP::Dictionary&
ASDCP::DefaultCompositeDict() { return s_CompositeDict; }
// singleton wrapper
#if 0
//
const ASDCP::MDDEntry&
ASDCP::Dict::Type(MDD_t type_id)
{
return s_MDD_Table[type_id];
}
//
const ASDCP::MDDEntry*
ASDCP::Dict::FindUL(const byte_t* ul_buf)
{
if ( ! s_md_init )
{
Kumu::AutoMutex AL(s_Lock);
if ( ! s_md_init )
{
for ( ui32_t x = 0; x < s_MDD_Table_size; x++ )
s_md_lookup.insert(std::map<UL, ui32_t>::value_type(UL(s_MDD_Table[x].ul), x));
s_md_init = true;
}
}
std::map<UL, ui32_t>::iterator i = s_md_lookup.find(UL(ul_buf));
if ( i == s_md_lookup.end() )
{
byte_t tmp_ul[SMPTE_UL_LENGTH];
memcpy(tmp_ul, ul_buf, SMPTE_UL_LENGTH);
tmp_ul[SMPTE_UL_LENGTH-1] = 0;
i = s_md_lookup.find(UL(tmp_ul));
if ( i == s_md_lookup.end() )
return 0;
}
return &s_MDD_Table[(*i).second];
}
#endif
//
// end Dict.cpp
//
|
