245 lines
7.7 KiB
C++
245 lines
7.7 KiB
C++
![]() |
/*************************************************************************
|
||
|
*
|
||
|
* $RCSfile: serialization_urlencoded.cxx,v $
|
||
|
*
|
||
|
* $Revision: 1.2 $
|
||
|
*
|
||
|
* last change: $Author: obo $ $Date: 2004-11-16 10:59:55 $
|
||
|
*
|
||
|
* The Contents of this file are made available subject to the terms of
|
||
|
* either of the following licenses
|
||
|
*
|
||
|
* - GNU Lesser General Public License Version 2.1
|
||
|
* - Sun Industry Standards Source License Version 1.1
|
||
|
*
|
||
|
* Sun Microsystems Inc., October, 2000
|
||
|
*
|
||
|
* GNU Lesser General Public License Version 2.1
|
||
|
* =============================================
|
||
|
* Copyright 2000 by Sun Microsystems, Inc.
|
||
|
* 901 San Antonio Road, Palo Alto, CA 94303, USA
|
||
|
*
|
||
|
* This library is free software; you can redistribute it and/or
|
||
|
* modify it under the terms of the GNU Lesser General Public
|
||
|
* License version 2.1, as published by the Free Software Foundation.
|
||
|
*
|
||
|
* This library 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 for more details.
|
||
|
*
|
||
|
* You should have received a copy of the GNU Lesser General Public
|
||
|
* License along with this library; if not, write to the Free Software
|
||
|
* Foundation, Inc., 59 Temple Place, Suite 330, Boston,
|
||
|
* MA 02111-1307 USA
|
||
|
*
|
||
|
*
|
||
|
* Sun Industry Standards Source License Version 1.1
|
||
|
* =================================================
|
||
|
* The contents of this file are subject to the Sun Industry Standards
|
||
|
* Source License Version 1.1 (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.openoffice.org/license.html.
|
||
|
*
|
||
|
* Software provided under this License is provided on an "AS IS" basis,
|
||
|
* WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,
|
||
|
* WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,
|
||
|
* MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.
|
||
|
* See the License for the specific provisions governing your rights and
|
||
|
* obligations concerning the Software.
|
||
|
*
|
||
|
* The Initial Developer of the Original Code is: Sun Microsystems, Inc.
|
||
|
*
|
||
|
* Copyright: 2000 by Sun Microsystems, Inc.
|
||
|
*
|
||
|
* All Rights Reserved.
|
||
|
*
|
||
|
* Contributor(s): _______________________________________
|
||
|
*
|
||
|
*
|
||
|
************************************************************************/
|
||
|
|
||
|
#include <com/sun/star/xml/xpath/XPathObjectType.hpp>
|
||
|
#include <com/sun/star/xml/dom/XNode.hpp>
|
||
|
#include <com/sun/star/xml/dom/XText.hpp>
|
||
|
#include <com/sun/star/xml/dom/XNodeList.hpp>
|
||
|
#include <com/sun/star/xml/dom/NodeType.hpp>
|
||
|
|
||
|
#include <rtl/ustrbuf.hxx>
|
||
|
#include <rtl/strbuf.hxx>
|
||
|
#include <unotools/processfactory.hxx>
|
||
|
|
||
|
#include <stdio.h>
|
||
|
|
||
|
#include "serialization_urlencoded.hxx"
|
||
|
|
||
|
using namespace rtl;
|
||
|
using namespace utl;
|
||
|
using namespace CSS::uno;
|
||
|
using namespace CSS::io;
|
||
|
using namespace CSS::xml::xpath;
|
||
|
using namespace CSS::xml::dom;
|
||
|
|
||
|
CSerializationURLEncoded::CSerializationURLEncoded()
|
||
|
: m_aFactory(getProcessServiceFactory())
|
||
|
, m_aPipe(Reference< XOutputStream > (m_aFactory->createInstance(
|
||
|
OUString::createFromAscii("com.sun.star.io.Pipe")), UNO_QUERY))
|
||
|
{
|
||
|
}
|
||
|
|
||
|
|
||
|
/*
|
||
|
rfc2396
|
||
|
reserved = ";" | "/" | "?" | ":" | "@" | "&" | "=" | "+" |
|
||
|
"$" | ","
|
||
|
mark = "-" | "_" | "." | "!" | "~" | "*" | "'" | "(" | ")"
|
||
|
unreserved = alphanum | mark
|
||
|
*/
|
||
|
sal_Bool CSerializationURLEncoded::is_unreserved(sal_Char c)
|
||
|
{
|
||
|
//digit?
|
||
|
if (c >= '0' && c <= '9') return sal_True;
|
||
|
if (c >= 'A' && c <= 'Z') return sal_True;
|
||
|
if (c >= 'a' && c <= 'z') return sal_True;
|
||
|
switch (c) {
|
||
|
case '-':
|
||
|
case '_':
|
||
|
case '.':
|
||
|
case '!':
|
||
|
case '~':
|
||
|
case '*':
|
||
|
case '\'':
|
||
|
case '(':
|
||
|
case ')':
|
||
|
return sal_True;
|
||
|
break;
|
||
|
}
|
||
|
return sal_False;
|
||
|
}
|
||
|
void CSerializationURLEncoded::encode_and_append(const OUString& aString, OStringBuffer& aBuffer)
|
||
|
{
|
||
|
OString utf8String = OUStringToOString(aString, RTL_TEXTENCODING_UTF8);
|
||
|
const sal_Char *pString = utf8String.getStr();
|
||
|
sal_Char tmpChar[3];
|
||
|
|
||
|
while( *pString != 0)
|
||
|
{
|
||
|
if( *pString < 0x80 )
|
||
|
{
|
||
|
if ( is_unreserved(*pString) ) {
|
||
|
aBuffer.append(*pString);
|
||
|
} else if (*pString == 0x20) {
|
||
|
aBuffer.append('+');
|
||
|
} else if (*pString == 0x0d && *(pString+1) == 0x0a) {
|
||
|
aBuffer.append("%0D%0A");
|
||
|
pString++;
|
||
|
} else if (*pString == 0x0a) {
|
||
|
aBuffer.append("%0D%0A");
|
||
|
} else {
|
||
|
snprintf(tmpChar, 3, "%%%X", *pString % 0x100);
|
||
|
aBuffer.append(tmpChar);
|
||
|
}
|
||
|
} else {
|
||
|
snprintf(tmpChar, 3, "%%%X", *pString % 0x100);
|
||
|
aBuffer.append(tmpChar);
|
||
|
while (*pString >= 0x80) {
|
||
|
// continuation...
|
||
|
pString++;
|
||
|
snprintf(tmpChar, 3, "%%%X", *pString % 0x100);
|
||
|
aBuffer.append(tmpChar);
|
||
|
}
|
||
|
}
|
||
|
pString++;
|
||
|
}
|
||
|
}
|
||
|
|
||
|
void CSerializationURLEncoded::serialize_node(const Reference< XNode >& aNode)
|
||
|
{
|
||
|
// serialize recursive
|
||
|
// every element node E that has a text child T will be serialized in document order
|
||
|
// <E1>T1<E2>T2</E2></E1><E3>T3</E3> -> E1=T2&E2=T2&E3=T3 (En := local name)
|
||
|
|
||
|
// this node
|
||
|
Reference< XNodeList > aChildList = aNode->getChildNodes();
|
||
|
Reference< XNode > aChild;
|
||
|
// is this an element node?
|
||
|
if (aNode->getNodeType() == NodeType_ELEMENT_NODE)
|
||
|
{
|
||
|
OUString aName = aNode->getNodeName();
|
||
|
// find any text children
|
||
|
OUStringBuffer aValue;
|
||
|
Reference< XText > aText;
|
||
|
for(sal_Int32 i=0; i < aChildList->getLength(); i++)
|
||
|
{
|
||
|
aChild = aChildList->item(i);
|
||
|
if (aChild->getNodeType() == NodeType_TEXT_NODE)
|
||
|
{
|
||
|
aText = Reference< XText >(aChild, UNO_QUERY);
|
||
|
aValue.append(aText->getData());
|
||
|
}
|
||
|
}
|
||
|
|
||
|
// found anything?
|
||
|
if (aValue.getLength() > 0)
|
||
|
{
|
||
|
OUString aUnencValue = aValue.makeStringAndClear();
|
||
|
OStringBuffer aEncodedBuffer;
|
||
|
encode_and_append(aName, aEncodedBuffer);
|
||
|
aEncodedBuffer.append("=");
|
||
|
encode_and_append(aUnencValue, aEncodedBuffer);
|
||
|
aEncodedBuffer.append("&");
|
||
|
sal_Int8 *pData = (sal_Int8*)aEncodedBuffer.getStr();
|
||
|
Sequence< sal_Int8 > sData(pData, aEncodedBuffer.getLength());
|
||
|
m_aPipe->writeBytes(sData);
|
||
|
}
|
||
|
}
|
||
|
|
||
|
// element children...
|
||
|
for(sal_Int32 i=0; i < aChildList->getLength(); i++)
|
||
|
{
|
||
|
aChild = aChildList->item(i);
|
||
|
// if this is an element node, it might be a candidate for serialization
|
||
|
if (aChild.is() && aChild->getNodeType() == NodeType_ELEMENT_NODE)
|
||
|
serialize_node(aChild);
|
||
|
}
|
||
|
|
||
|
// siblings...
|
||
|
// Reference< XNode > aSibling = aNode->getNextSibling();
|
||
|
// if (aSibling.is())
|
||
|
// serialize_node(aSibling);
|
||
|
|
||
|
}
|
||
|
|
||
|
/*
|
||
|
void CSerializationURLEncoded::serialize_nodeset()
|
||
|
{
|
||
|
Reference< XNodeList > aNodeList = m_aXPathObject->getNodeList();
|
||
|
for (sal_Int32 i=0; i<aNodeList->getLength(); i++)
|
||
|
serialize_node(aNodeList->item(i));
|
||
|
m_aPipe->closeOutput();
|
||
|
}
|
||
|
*/
|
||
|
|
||
|
void CSerializationURLEncoded::serialize()
|
||
|
{
|
||
|
|
||
|
// output stream to the pipe buffer
|
||
|
Reference< XOutputStream > out(m_aPipe, UNO_QUERY);
|
||
|
|
||
|
CSS::uno::Reference< CSS::xml::dom::XNode > cur = m_aFragment->getFirstChild();
|
||
|
while (cur.is())
|
||
|
{
|
||
|
serialize_node(cur);
|
||
|
cur = cur->getNextSibling();
|
||
|
}
|
||
|
m_aPipe->closeOutput();
|
||
|
}
|
||
|
|
||
|
Reference< XInputStream > CSerializationURLEncoded::getInputStream()
|
||
|
{
|
||
|
return Reference< XInputStream >(m_aPipe, UNO_QUERY);
|
||
|
}
|
||
|
|
||
|
|
||
|
|