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
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* This file is part of the LibreOffice project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*
* This file incorporates work covered by the following license notice:
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed
* with this work for additional information regarding copyright
* ownership. The ASF licenses this file to you under the Apache
* License, Version 2.0 (the "License"); you may not use this file
* except in compliance with the License. You may obtain a copy of
* the License at http://www.apache.org/licenses/LICENSE-2.0 .
*/
#include <vector>
#include <com/sun/star/registry/XRegistryKey.hpp>
#include <com/sun/star/registry/MergeConflictException.hpp>
#include "mergekeys.hxx"
using namespace ::rtl;
using namespace ::osl;
using namespace css::uno;
using namespace ::com::sun::star;
namespace stoc_impreg
{
struct Link
{
OUString m_name;
OUString m_target;
inline Link( OUString const & name, OUString const & target )
: m_name( name )
, m_target( target )
{}
};
typedef ::std::vector< Link > t_links;
static void mergeKeys(
Reference< registry::XRegistryKey > const & xDest,
Reference< registry::XRegistryKey > const & xSource,
t_links & links )
// throw( registry::InvalidRegistryException, registry::MergeConflictException, RuntimeException )
{
if (!xSource.is() || !xSource->isValid()) {
throw registry::InvalidRegistryException(
"source key is null or invalid!" );
}
if (!xDest.is() || !xDest->isValid()) {
throw registry::InvalidRegistryException(
"destination key is null or invalid!" );
}
// write value
switch (xSource->getValueType())
{
case registry::RegistryValueType_NOT_DEFINED:
break;
case registry::RegistryValueType_LONG:
xDest->setLongValue( xSource->getLongValue() );
break;
case registry::RegistryValueType_ASCII:
xDest->setAsciiValue( xSource->getAsciiValue() );
break;
case registry::RegistryValueType_STRING:
xDest->setStringValue( xSource->getStringValue() );
break;
case registry::RegistryValueType_BINARY:
xDest->setBinaryValue( xSource->getBinaryValue() );
break;
case registry::RegistryValueType_LONGLIST:
xDest->setLongListValue( xSource->getLongListValue() );
break;
case registry::RegistryValueType_ASCIILIST:
xDest->setAsciiListValue( xSource->getAsciiListValue() );
break;
case registry::RegistryValueType_STRINGLIST:
xDest->setStringListValue( xSource->getStringListValue() );
break;
default:
OSL_ASSERT(false);
break;
}
// sub keys
Sequence< OUString > sourceKeys( xSource->getKeyNames() );
OUString const * pSourceKeys = sourceKeys.getConstArray();
for ( sal_Int32 nPos = sourceKeys.getLength(); nPos--; )
{
// key name
OUString name( pSourceKeys[ nPos ] );
sal_Int32 nSlash = name.lastIndexOf( '/' );
if (nSlash >= 0)
{
name = name.copy( nSlash +1 );
}
if (xSource->getKeyType( name ) == registry::RegistryKeyType_KEY)
{
// try to open exisiting dest key or create new one
Reference< registry::XRegistryKey > xDestKey( xDest->createKey( name ) );
Reference< registry::XRegistryKey > xSourceKey( xSource->openKey( name ) );
mergeKeys( xDestKey, xSourceKey, links );
xSourceKey->closeKey();
xDestKey->closeKey();
}
else // link
{
// remove existing key
Reference< registry::XRegistryKey > xDestKey( xDest->openKey( name ) );
if (xDestKey.is() && xDestKey->isValid()) // something to remove
{
xDestKey->closeKey();
if (xDest->getKeyType( name ) == registry::RegistryKeyType_LINK)
{
xDest->deleteLink( name );
}
else
{
xDest->deleteKey( name );
}
}
links.push_back( Link(
pSourceKeys[ nPos ], // abs path
xSource->getResolvedName( name ) // abs resolved name
) );
}
}
}
void mergeKeys(
Reference< registry::XRegistryKey > const & xDest,
Reference< registry::XRegistryKey > const & xSource )
// throw( registry::InvalidRegistryException, registry::MergeConflictException, RuntimeException )
{
if (!xDest.is() || !xDest->isValid()) {
throw registry::InvalidRegistryException(
"destination key is null or invalid!" );
}
if (xDest->isReadOnly())
{
throw registry::InvalidRegistryException(
"destination registry is read-only! cannot merge!" );
}
t_links links;
links.reserve( 16 );
mergeKeys( xDest, xSource, links );
for ( size_t nPos = links.size(); nPos--; )
{
Link const & r = links[ nPos ];
OSL_VERIFY( xDest->createLink( r.m_name, r.m_target ) );
}
}
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
