274 lines
8.8 KiB
C++
274 lines
8.8 KiB
C++
|
/*************************************************************************
|
||
|
|
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
||
|
|
*
|
||
|
|
* Copyright 2009 by Sun Microsystems, Inc.
|
||
|
|
*
|
||
|
|
* OpenOffice.org - a multi-platform office productivity suite
|
||
|
|
*
|
||
|
|
* $RCSfile: code,v $
|
||
|
|
*
|
||
|
|
* $Revision: 1.4 $
|
||
|
|
*
|
||
|
|
* This file is part of OpenOffice.org.
|
||
|
|
*
|
||
|
|
* OpenOffice.org is free software: you can redistribute it and/or modify
|
||
|
|
* it under the terms of the GNU Lesser General Public License version 3
|
||
|
|
* only, as published by the Free Software Foundation.
|
||
|
|
*
|
||
|
|
* OpenOffice.org 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 Lesser General Public License version 3 for more details
|
||
|
|
* (a copy is included in the LICENSE file that accompanied this code).
|
||
|
|
*
|
||
|
|
* You should have received a copy of the GNU Lesser General Public License
|
||
|
|
* version 3 along with OpenOffice.org. If not, see
|
||
|
|
* <http://www.openoffice.org/license.html>
|
||
|
|
* for a copy of the LGPLv3 License.
|
||
|
|
************************************************************************/
|
||
|
|
|
||
|
|
#include "precompiled_configmgr.hxx"
|
||
|
|
#include "sal/config.h"
|
||
|
|
|
||
|
|
#include <algorithm>
|
||
|
|
|
||
|
|
#include "com/sun/star/uno/RuntimeException.hpp"
|
||
|
|
#include "com/sun/star/uno/XInterface.hpp"
|
||
|
|
#include "osl/diagnose.h"
|
||
|
|
#include "rtl/ref.hxx"
|
||
|
|
#include "rtl/string.h"
|
||
|
|
#include "rtl/ustrbuf.hxx"
|
||
|
|
#include "rtl/ustring.h"
|
||
|
|
#include "rtl/ustring.hxx"
|
||
|
|
#include "sal/types.h"
|
||
|
|
|
||
|
|
#include "data.hxx"
|
||
|
|
#include "groupnode.hxx"
|
||
|
|
#include "layer.hxx"
|
||
|
|
#include "node.hxx"
|
||
|
|
#include "nodemap.hxx"
|
||
|
|
#include "setnode.hxx"
|
||
|
|
#include "xml.hxx"
|
||
|
|
|
||
|
|
namespace configmgr {
|
||
|
|
|
||
|
|
namespace {
|
||
|
|
|
||
|
|
namespace css = com::sun::star;
|
||
|
|
|
||
|
|
bool isPrefix(rtl::OUString const & prefix, rtl::OUString const & path) {
|
||
|
|
return prefix.getLength() < path.getLength() && path.match(prefix) &&
|
||
|
|
path[prefix.getLength()] == '/';
|
||
|
|
}
|
||
|
|
|
||
|
|
}
|
||
|
|
|
||
|
|
rtl::OUString Data::createSegment(
|
||
|
|
rtl::OUString const & templateName, rtl::OUString const & name)
|
||
|
|
{
|
||
|
|
if (templateName.getLength() == 0) {
|
||
|
|
return name;
|
||
|
|
}
|
||
|
|
rtl::OUStringBuffer buf(templateName);
|
||
|
|
//TODO: verify template name contains no bad chars?
|
||
|
|
buf.appendAscii(RTL_CONSTASCII_STRINGPARAM("['"));
|
||
|
|
for (sal_Int32 i = 0; i < name.getLength(); ++i) {
|
||
|
|
sal_Unicode c = name[i];
|
||
|
|
switch (c) {
|
||
|
|
case '&':
|
||
|
|
buf.appendAscii(RTL_CONSTASCII_STRINGPARAM("&"));
|
||
|
|
break;
|
||
|
|
case '"':
|
||
|
|
buf.appendAscii(RTL_CONSTASCII_STRINGPARAM("""));
|
||
|
|
break;
|
||
|
|
case '\'':
|
||
|
|
buf.appendAscii(RTL_CONSTASCII_STRINGPARAM("'"));
|
||
|
|
break;
|
||
|
|
default:
|
||
|
|
buf.append(c);
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
buf.appendAscii(RTL_CONSTASCII_STRINGPARAM("']"));
|
||
|
|
return buf.makeStringAndClear();
|
||
|
|
}
|
||
|
|
|
||
|
|
sal_Int32 Data::parseSegment(
|
||
|
|
rtl::OUString const & path, sal_Int32 index, rtl::OUString * name,
|
||
|
|
bool * setElement, rtl::OUString * templateName)
|
||
|
|
{
|
||
|
|
OSL_ASSERT(
|
||
|
|
index >= 0 && index <= path.getLength() && name != 0 &&
|
||
|
|
setElement != 0);
|
||
|
|
sal_Int32 i = index;
|
||
|
|
while (i < path.getLength() && path[i] != '/' && path[i] != '[') {
|
||
|
|
++i;
|
||
|
|
}
|
||
|
|
if (i == path.getLength() || path[i] == '/') {
|
||
|
|
*name = path.copy(index, i - index);
|
||
|
|
*setElement = false;
|
||
|
|
return i;
|
||
|
|
}
|
||
|
|
if (templateName != 0) {
|
||
|
|
if (i - index == 1 && path[index] == '*') {
|
||
|
|
*templateName = rtl::OUString();
|
||
|
|
} else {
|
||
|
|
*templateName = path.copy(index, i - index);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
if (++i == path.getLength()) {
|
||
|
|
return -1;
|
||
|
|
}
|
||
|
|
sal_Unicode del = path[i++];
|
||
|
|
if (del != '\'' && del != '"') {
|
||
|
|
return -1;
|
||
|
|
}
|
||
|
|
sal_Int32 j = path.indexOf(del, i);
|
||
|
|
if (j == -1 || j + 1 == path.getLength() || path[j + 1] != ']' ||
|
||
|
|
!xml::decodeXml(path, i, j, name))
|
||
|
|
{
|
||
|
|
return -1;
|
||
|
|
}
|
||
|
|
*setElement = true;
|
||
|
|
return j + 2;
|
||
|
|
}
|
||
|
|
|
||
|
|
rtl::Reference< Node > Data::findNode(
|
||
|
|
int layer, NodeMap const & map, rtl::OUString const & name)
|
||
|
|
{
|
||
|
|
NodeMap::const_iterator i(map.find(name));
|
||
|
|
return
|
||
|
|
(i == map.end() || i->second->getLayer() > layer ||
|
||
|
|
i->second->isRemoved())
|
||
|
|
? rtl::Reference< Node >() : i->second;
|
||
|
|
}
|
||
|
|
|
||
|
|
rtl::Reference< Node > Data::resolvePath(
|
||
|
|
rtl::OUString const & path, rtl::OUString * firstSegment,
|
||
|
|
rtl::OUString * lastSegment, rtl::OUString * canonicalPath,
|
||
|
|
rtl::Reference< Node > * parent, int * finalizedLayer) const
|
||
|
|
{
|
||
|
|
if (path.getLength() == 0 || path[0] != '/') {
|
||
|
|
throw css::uno::RuntimeException(
|
||
|
|
rtl::OUString(RTL_CONSTASCII_USTRINGPARAM("bad path ")) + path, 0);
|
||
|
|
}
|
||
|
|
rtl::OUString seg;
|
||
|
|
bool setElement;
|
||
|
|
sal_Int32 n = parseSegment(path, 1, &seg, &setElement, 0);
|
||
|
|
if (n == -1 || setElement)
|
||
|
|
{
|
||
|
|
throw css::uno::RuntimeException(
|
||
|
|
rtl::OUString(RTL_CONSTASCII_USTRINGPARAM("bad path ")) + path, 0);
|
||
|
|
}
|
||
|
|
if (firstSegment != 0) {
|
||
|
|
*firstSegment = seg;
|
||
|
|
}
|
||
|
|
NodeMap::const_iterator i(components.find(seg));
|
||
|
|
rtl::OUStringBuffer canonic;
|
||
|
|
rtl::Reference< Node > par;
|
||
|
|
int finalized = NO_LAYER;
|
||
|
|
for (rtl::Reference< Node > p(i == components.end() ? 0 : i->second);;) {
|
||
|
|
if (!p.is()) {
|
||
|
|
return p;
|
||
|
|
}
|
||
|
|
if (canonicalPath != 0) {
|
||
|
|
canonic.append(sal_Unicode('/'));
|
||
|
|
canonic.append(createSegment(p->getTemplateName(), seg));
|
||
|
|
}
|
||
|
|
finalized = std::min(finalized, p->getFinalized());
|
||
|
|
if (n != path.getLength() && path[n++] != '/') {
|
||
|
|
throw css::uno::RuntimeException(
|
||
|
|
rtl::OUString(RTL_CONSTASCII_USTRINGPARAM("bad path ")) + path,
|
||
|
|
css::uno::Reference< css::uno::XInterface >());
|
||
|
|
}
|
||
|
|
// for backwards compatibility, ignore a final slash
|
||
|
|
if (n == path.getLength()) {
|
||
|
|
if (lastSegment != 0) {
|
||
|
|
*lastSegment = seg;
|
||
|
|
}
|
||
|
|
if (canonicalPath != 0) {
|
||
|
|
*canonicalPath = canonic.makeStringAndClear();
|
||
|
|
}
|
||
|
|
if (parent != 0) {
|
||
|
|
*parent = par;
|
||
|
|
}
|
||
|
|
if (finalizedLayer != 0) {
|
||
|
|
*finalizedLayer = finalized;
|
||
|
|
}
|
||
|
|
return p;
|
||
|
|
}
|
||
|
|
par = p;
|
||
|
|
rtl::OUString templateName;
|
||
|
|
n = parseSegment(path, n, &seg, &setElement, &templateName);
|
||
|
|
if (n == -1) {
|
||
|
|
throw css::uno::RuntimeException(
|
||
|
|
rtl::OUString(RTL_CONSTASCII_USTRINGPARAM("bad path ")) + path,
|
||
|
|
css::uno::Reference< css::uno::XInterface >());
|
||
|
|
}
|
||
|
|
if (setElement) {
|
||
|
|
SetNode * set = dynamic_cast< SetNode * >(p.get());
|
||
|
|
if (set == 0 ||
|
||
|
|
(templateName.getLength() != 0 &&
|
||
|
|
!set->isValidTemplate(templateName)))
|
||
|
|
{
|
||
|
|
throw css::uno::RuntimeException(
|
||
|
|
(rtl::OUString(RTL_CONSTASCII_USTRINGPARAM("bad path ")) +
|
||
|
|
path),
|
||
|
|
css::uno::Reference< css::uno::XInterface >());
|
||
|
|
}
|
||
|
|
p = set->getMember(seg);
|
||
|
|
if (templateName.getLength() != 0 && p != 0) {
|
||
|
|
rtl::OUString name;
|
||
|
|
if (GroupNode * mg = dynamic_cast< GroupNode * >(p.get())) {
|
||
|
|
name = mg->getTemplateName();
|
||
|
|
} else if (SetNode * ms = dynamic_cast< SetNode * >(p.get())) {
|
||
|
|
name = ms->getTemplateName();
|
||
|
|
} else {
|
||
|
|
OSL_ASSERT(false);
|
||
|
|
throw css::uno::RuntimeException(
|
||
|
|
rtl::OUString(
|
||
|
|
RTL_CONSTASCII_USTRINGPARAM("this cannot happen")),
|
||
|
|
css::uno::Reference< css::uno::XInterface >());
|
||
|
|
}
|
||
|
|
OSL_ASSERT(name.getLength() != 0);
|
||
|
|
if (templateName != name) {
|
||
|
|
throw css::uno::RuntimeException(
|
||
|
|
(rtl::OUString(
|
||
|
|
RTL_CONSTASCII_USTRINGPARAM("bad path ")) +
|
||
|
|
path),
|
||
|
|
css::uno::Reference< css::uno::XInterface >());
|
||
|
|
}
|
||
|
|
}
|
||
|
|
} else {
|
||
|
|
// For backwards compatibility, allow set members to be accessed
|
||
|
|
// with simple path segments, like group members:
|
||
|
|
p = p->getMember(seg);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
rtl::Reference< Node > Data::getTemplate(
|
||
|
|
int layer, rtl::OUString const & fullName) const
|
||
|
|
{
|
||
|
|
return findNode(layer, templates, fullName);
|
||
|
|
}
|
||
|
|
|
||
|
|
void Data::addModification(rtl::OUString const & path) {
|
||
|
|
//TODO
|
||
|
|
for (Modifications::iterator i(modifications.begin());
|
||
|
|
i != modifications.end();)
|
||
|
|
{
|
||
|
|
if (path == *i || isPrefix(*i, path)) {
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
if (isPrefix(path, *i)) {
|
||
|
|
modifications.erase(i++);
|
||
|
|
} else {
|
||
|
|
++i;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
modifications.push_back(path);
|
||
|
|
}
|
||
|
|
|
||
|
|
}
|