summary | shortlog | log | commit | commitdiff | tree
raw | patch | inline | side by side (parent: 72f8ad3)
raw | patch | inline | side by side (parent: 72f8ad3)
author | ishmal <ishmal@users.sourceforge.net> | |
Fri, 30 May 2008 20:15:16 +0000 (20:15 +0000) | ||
committer | ishmal <ishmal@users.sourceforge.net> | |
Fri, 30 May 2008 20:15:16 +0000 (20:15 +0000) |
diff --git a/src/dom/io/socket.cpp b/src/dom/io/socket.cpp
index 22b03b8b3d853869c745de75cd67fdc9466f46ce..b800d7453cdface5cbea2d919113482b9a3d869b 100644 (file)
--- a/src/dom/io/socket.cpp
+++ b/src/dom/io/socket.cpp
* Authors:
* Bob Jamison
*
- * Copyright (C) 2005 Bob Jamison
+ * Copyright (C) 2005-2008 Bob Jamison
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
WSAStartup( wVersionRequested, &wsaData );
#endif
#ifdef HAVE_SSL
- if (libssl_is_present)
- {
+ if (libssl_is_present)
+ {
sslStream = NULL;
sslContext = NULL;
- CRYPTO_set_locking_callback(cryptoLockCallback);
+ CRYPTO_set_locking_callback(cryptoLockCallback);
CRYPTO_set_id_callback(cryptoIdCallback);
SSL_library_init();
SSL_load_error_strings();
- }
+ }
#endif
tcp_socket_inited = true;
}
if (count<=0 && sslEnabled)
{
#ifdef HAVE_SSL
- if (libssl_is_present)
- {
+ if (libssl_is_present)
+ {
return SSL_pending(sslStream);
- }
+ }
#endif
}
return count;
if (sslEnabled)
{
#ifdef HAVE_SSL
- if (libssl_is_present)
- {
- int r = SSL_write(sslStream, &c, 1);
- if (r<=0)
+ if (libssl_is_present)
{
- switch(SSL_get_error(sslStream, r))
+ int r = SSL_write(sslStream, &c, 1);
+ if (r<=0)
{
- default:
+ switch(SSL_get_error(sslStream, r))
+ {
+ default:
printf("SSL write problem");
return -1;
+ }
}
}
- }
#endif
}
else
if (sslEnabled)
{
#ifdef HAVE_SSL
- if (libssl_is_present)
- {
- int r = SSL_write(sslStream, (unsigned char *)str.c_str(), len);
- if (r<=0)
+ if (libssl_is_present)
{
- switch(SSL_get_error(sslStream, r))
+ int r = SSL_write(sslStream, (unsigned char *)str.c_str(), len);
+ if (r<=0)
{
- default:
- printf("SSL write problem");
- return -1;
+ switch(SSL_get_error(sslStream, r))
+ {
+ default:
+ printf("SSL write problem");
+ return -1;
+ }
}
}
- }
#endif
}
else
if (sslEnabled)
{
#ifdef HAVE_SSL
- if (libssl_is_present)
- {
- if (!sslStream)
- return -1;
- int r = SSL_read(sslStream, &ch, 1);
- unsigned long err = SSL_get_error(sslStream, r);
- switch (err)
+ if (libssl_is_present)
{
- case SSL_ERROR_NONE:
- break;
- case SSL_ERROR_ZERO_RETURN:
- return -1;
- case SSL_ERROR_SYSCALL:
- printf("SSL read problem(syscall) %s\n",
- ERR_error_string(ERR_get_error(), NULL));
- return -1;
- default:
- printf("SSL read problem %s\n",
- ERR_error_string(ERR_get_error(), NULL));
+ if (!sslStream)
return -1;
+ int r = SSL_read(sslStream, &ch, 1);
+ unsigned long err = SSL_get_error(sslStream, r);
+ switch (err)
+ {
+ case SSL_ERROR_NONE:
+ break;
+ case SSL_ERROR_ZERO_RETURN:
+ return -1;
+ case SSL_ERROR_SYSCALL:
+ printf("SSL read problem(syscall) %s\n",
+ ERR_error_string(ERR_get_error(), NULL));
+ return -1;
+ default:
+ printf("SSL read problem %s\n",
+ ERR_error_string(ERR_get_error(), NULL));
+ return -1;
+ }
}
- }
#endif
}
else
index 6e3645ceb6d08c5eaf32e080e1312b94dbccff63..c3bb5d97d5ae9d888d8aeff0d40ed882fe22b71f 100644 (file)
*
* ---------------------------------------------------------------------
*
- * Copyright (C) 2006 Bob Jamison
+ * Copyright (C) 2006-2008 Bob Jamison
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
/**
*
*/
-bool OdfDocument::readFile(const std::string &fileName)
+bool OdfDocument::readFile(const std::string &/*fileName*/)
{
return true;
}
/**
*
*/
-bool OdfDocument::writeFile(const std::string &fileName)
+bool OdfDocument::writeFile(const std::string &/*fileName*/)
{
return true;
}
diff --git a/src/dom/xmlwriter.cpp b/src/dom/xmlwriter.cpp
index 13fe76e5af68fb2d32dbb4b76358fd49470ce585..2b056cf9fe10cf7bef82d6e31d91c328e1a22244 100644 (file)
--- a/src/dom/xmlwriter.cpp
+++ b/src/dom/xmlwriter.cpp
* Authors:
* Bob Jamison
*
- * Copyright (C) 2005 Bob Jamison
+ * Copyright (C) 2005-2008 Bob Jamison
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
/**
*
*/
-void XmlWriter::po(char *fmt, ...)
+void XmlWriter::po(const char *fmt, ...)
{
char str[257];
va_list args;
diff --git a/src/dom/xmlwriter.h b/src/dom/xmlwriter.h
index 925dacd51172b47e073a58237c9328bf82b43bcf..cd787993c411e56f580baa5eb31fbd7c8832f060 100644 (file)
--- a/src/dom/xmlwriter.h
+++ b/src/dom/xmlwriter.h
* Authors:
* Bob Jamison
*
- * Copyright (C) 2005 Bob Jamison
+ * Copyright (C) 2005-2008 Bob Jamison
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
void spaces();
- void po(char *str, ...) G_GNUC_PRINTF(2,3);
+ void po(const char *str, ...) G_GNUC_PRINTF(2,3);
void pos(const DOMString &str);
diff --git a/src/dom/xpathimpl.cpp b/src/dom/xpathimpl.cpp
index 0af7b11e595556a5a511e5c072156c09f749ea77..b7aa2c1c8d4af711d4aa24804c1364d36d58abe9 100644 (file)
--- a/src/dom/xpathimpl.cpp
+++ b/src/dom/xpathimpl.cpp
* Authors:
* Bob Jamison
*
- * Copyright (C) 2005 Bob Jamison
+ * Copyright (C) 2005-2008 Bob Jamison
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
*
*/
XPathExpression *XPathEvaluatorImpl::createExpression(
- const DOMString &expression,
- const XPathNSResolver *resolver)
+ const DOMString &/*expression*/,
+ const XPathNSResolver */*resolver*/)
throw (XPathException, dom::DOMException)
{
return NULL;
/**
*
*/
-XPathNSResolver *XPathEvaluatorImpl::createNSResolver(const Node *nodeResolver)
+XPathNSResolver *XPathEvaluatorImpl::createNSResolver(const Node */*nodeResolver*/)
{
return NULL;
}
*
*/
XPathResult *XPathEvaluatorImpl::evaluate(
- const DOMString &expression,
- const Node *contextNode,
- const XPathNSResolver *resolver,
- const unsigned short type,
- const XPathResult *result)
+ const DOMString &/*expression*/,
+ const Node */*contextNode*/,
+ const XPathNSResolver */*resolver*/,
+ const unsigned short /*type*/,
+ const XPathResult */*result*/)
throw (XPathException, dom::DOMException)
{
return NULL;
*
*/
XPathResult *XPathExpressionImpl::evaluate(
- const Node *contextNode,
- unsigned short type,
- const XPathResult *result)
+ const Node */*contextNode*/,
+ unsigned short /*type*/,
+ const XPathResult */*result*/)
throw (XPathException, dom::DOMException)
{
return NULL;
/**
*
*/
-DOMString XPathNSResolverImpl::lookupNamespaceURI(const DOMString &prefix)
+DOMString XPathNSResolverImpl::lookupNamespaceURI(const DOMString &/*prefix*/)
{
return "";
}
/**
*
*/
-Node *XPathResultImpl::snapshotItem(unsigned long index) throw (XPathException)
+Node *XPathResultImpl::snapshotItem(unsigned long /*index*/) throw (XPathException)
{
return NULL;
}
diff --git a/src/dom/xpathtoken.cpp b/src/dom/xpathtoken.cpp
index fe906f4f8351b99c7cbacaee8510db86514b89d4..921cbf04437916818ffc2f934d0bb6a45df6b20d 100644 (file)
--- a/src/dom/xpathtoken.cpp
+++ b/src/dom/xpathtoken.cpp
* Authors:
* Bob Jamison
*
- * Copyright (C) 2006 Bob Jamison
+ * Copyright (C) 2006-2008 Bob Jamison
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
return true;
}
-static bool tokAnd(Token &tok, Stack &stack)
+static bool tokAnd(Token &/*tok*/, Stack &stack)
{
StackItem item1 = stack.pop();
StackItem item2 = stack.pop();
return true;
}
-static bool tokOr(Token &tok, Stack &stack)
+static bool tokOr(Token &/*tok*/, Stack &stack)
{
StackItem item1 = stack.pop();
StackItem item2 = stack.pop();
return true;
}
-static bool tokMod(Token &tok, Stack &stack)
+static bool tokMod(Token &/*tok*/, Stack &stack)
{
StackItem item1 = stack.pop();
StackItem item2 = stack.pop();
}
-static bool tokDiv(Token &tok, Stack &stack)
+static bool tokDiv(Token &/*tok*/, Stack &stack)
{
StackItem item1 = stack.pop();
StackItem item2 = stack.pop();
return true;
}
-static bool tokMul(Token &tok, Stack &stack)
+static bool tokMul(Token &/*tok*/, Stack &stack)
{
StackItem item1 = stack.pop();
StackItem item2 = stack.pop();
return true;
}
-static bool tokPlus(Token &tok, Stack &stack)
+static bool tokPlus(Token &/*tok*/, Stack &stack)
{
StackItem item1 = stack.pop();
StackItem item2 = stack.pop();
return true;
}
-static bool tokMinus(Token &tok, Stack &stack)
+static bool tokMinus(Token &/*tok*/, Stack &stack)
{
StackItem item1 = stack.pop();
StackItem item2 = stack.pop();
}
-static bool tokNeg(Token &tok, Stack &stack)
+static bool tokNeg(Token &/*tok*/, Stack &stack)
{
StackItem item = stack.pop();
item.dval = -item.dval;
}
-static bool tokEquals(Token &tok, Stack &stack)
+static bool tokEquals(Token &/*tok*/, Stack &stack)
{
StackItem item1 = stack.pop();
StackItem item2 = stack.pop();
}
-static bool tokNotEquals(Token &tok, Stack &stack)
+static bool tokNotEquals(Token &/*tok*/, Stack &stack)
{
StackItem item1 = stack.pop();
StackItem item2 = stack.pop();
}
-static bool tokLessThan(Token &tok, Stack &stack)
+static bool tokLessThan(Token &/*tok*/, Stack &stack)
{
StackItem item1 = stack.pop();
StackItem item2 = stack.pop();
}
-static bool tokLessThanEquals(Token &tok, Stack &stack)
+static bool tokLessThanEquals(Token &/*tok*/, Stack &stack)
{
StackItem item1 = stack.pop();
StackItem item2 = stack.pop();
}
-static bool tokGreaterThanEquals(Token &tok, Stack &stack)
+static bool tokGreaterThanEquals(Token &/*tok*/, Stack &stack)
{
StackItem item1 = stack.pop();
StackItem item2 = stack.pop();
}
-static bool tokGreaterThan(Token &tok, Stack &stack)
+static bool tokGreaterThan(Token &/*tok*/, Stack &stack)
{
StackItem item1 = stack.pop();
StackItem item2 = stack.pop();
//# X P A T H I T E M S
//###########################
-static bool tokAbsolute(Token &tok, Stack &stack)
+static bool tokAbsolute(Token &/*tok*/, Stack &/*stack*/)
{
return true;
}
-static bool tokRelative(Token &tok, Stack &stack)
+static bool tokRelative(Token &/*tok*/, Stack &/*stack*/)
{
return true;
}
-static bool tokStep(Token &tok, Stack &stack)
+static bool tokStep(Token &/*tok*/, Stack &/*stack*/)
{
return true;
}
-static bool tokNameTest(Token &tok, Stack &stack)
+static bool tokNameTest(Token &/*tok*/, Stack &/*stack*/)
{
return true;
}
-static bool tokExpr(Token &tok, Stack &stack)
+static bool tokExpr(Token &/*tok*/, Stack &/*stack*/)
{
return true;
}
-static bool tokUnion(Token &tok, Stack &stack)
+static bool tokUnion(Token &/*tok*/, Stack &/*stack*/)
{
return true;
}
//###########################
-static bool tokAxisAncestorOrSelf(Token &tok, Stack &stack)
+static bool tokAxisAncestorOrSelf(Token &/*tok*/, Stack &/*stack*/)
{
return true;
}
-static bool tokAxisAncestor(Token &tok, Stack &stack)
+static bool tokAxisAncestor(Token &/*tok*/, Stack &/*stack*/)
{
return true;
}
-static bool tokAxisAttribute(Token &tok, Stack &stack)
+static bool tokAxisAttribute(Token &/*tok*/, Stack &/*stack*/)
{
return true;
}
-static bool tokAxisChild(Token &tok, Stack &stack)
+static bool tokAxisChild(Token &/*tok*/, Stack &/*stack*/)
{
return true;
}
-static bool tokAxisDescendantOrSelf(Token &tok, Stack &stack)
+static bool tokAxisDescendantOrSelf(Token &/*tok*/, Stack &/*stack*/)
{
return true;
}
-static bool tokAxisDescendant(Token &tok, Stack &stack)
+static bool tokAxisDescendant(Token &/*tok*/, Stack &/*stack*/)
{
return true;
}
-static bool tokAxisFollowingSibling(Token &tok, Stack &stack)
+static bool tokAxisFollowingSibling(Token &/*tok*/, Stack &/*stack*/)
{
return true;
}
-static bool tokAxisFollowing(Token &tok, Stack &stack)
+static bool tokAxisFollowing(Token &/*tok*/, Stack &/*stack*/)
{
return true;
}
-static bool tokAxisNamespace(Token &tok, Stack &stack)
+static bool tokAxisNamespace(Token &/*tok*/, Stack &/*stack*/)
{
return true;
}
-static bool tokAxisParent(Token &tok, Stack &stack)
+static bool tokAxisParent(Token &/*tok*/, Stack &/*stack*/)
{
return true;
}
-static bool tokAxisPrecedingSibling(Token &tok, Stack &stack)
+static bool tokAxisPrecedingSibling(Token &/*tok*/, Stack &/*stack*/)
{
return true;
}
-static bool tokAxisPreceding(Token &tok, Stack &stack)
+static bool tokAxisPreceding(Token &/*tok*/, Stack &/*stack*/)
{
return true;
}
-static bool tokAxisSelf(Token &tok, Stack &stack)
+static bool tokAxisSelf(Token &/*tok*/, Stack &/*stack*/)
{
return true;
}
//###########################
-static bool tokFuncLast(Token &tok, Stack &stack)
+static bool tokFuncLast(Token &/*tok*/, Stack &/*stack*/)
{
return true;
}
-static bool tokFuncPosition(Token &tok, Stack &stack)
+static bool tokFuncPosition(Token &/*tok*/, Stack &/*stack*/)
{
return true;
}
-static bool tokFuncCount(Token &tok, Stack &stack)
+static bool tokFuncCount(Token &/*tok*/, Stack &/*stack*/)
{
return true;
}
-static bool tokFuncId(Token &tok, Stack &stack)
+static bool tokFuncId(Token &/*tok*/, Stack &/*stack*/)
{
return true;
}
-static bool tokFuncLocalName(Token &tok, Stack &stack)
+static bool tokFuncLocalName(Token &/*tok*/, Stack &/*stack*/)
{
return true;
}
-static bool tokFuncNamespaceUri(Token &tok, Stack &stack)
+static bool tokFuncNamespaceUri(Token &/*tok*/, Stack &/*stack*/)
{
return true;
}
-static bool tokFuncName(Token &tok, Stack &stack)
+static bool tokFuncName(Token &/*tok*/, Stack &/*stack*/)
{
return true;
}
-static bool tokFuncString(Token &tok, Stack &stack)
+static bool tokFuncString(Token &/*tok*/, Stack &/*stack*/)
{
return true;
}
-static bool tokFuncConcat(Token &tok, Stack &stack)
+static bool tokFuncConcat(Token &/*tok*/, Stack &/*stack*/)
{
return true;
}
-static bool tokFuncStartsWith(Token &tok, Stack &stack)
+static bool tokFuncStartsWith(Token &/*tok*/, Stack &/*stack*/)
{
return true;
}
-static bool tokFuncContains(Token &tok, Stack &stack)
+static bool tokFuncContains(Token &/*tok*/, Stack &/*stack*/)
{
return true;
}
-static bool tokFuncSubstringBefore(Token &tok, Stack &stack)
+static bool tokFuncSubstringBefore(Token &/*tok*/, Stack &/*stack*/)
{
return true;
}
-static bool tokFuncSubstringAfter(Token &tok, Stack &stack)
+static bool tokFuncSubstringAfter(Token &/*tok*/, Stack &/*stack*/)
{
return true;
}
-static bool tokFuncSubstring(Token &tok, Stack &stack)
+static bool tokFuncSubstring(Token &/*tok*/, Stack &/*stack*/)
{
return true;
}
-static bool tokFuncStringLength(Token &tok, Stack &stack)
+static bool tokFuncStringLength(Token &/*tok*/, Stack &/*stack*/)
{
return true;
}
-static bool tokFuncNormalizeSpace(Token &tok, Stack &stack)
+static bool tokFuncNormalizeSpace(Token &/*tok*/, Stack &/*stack*/)
{
return true;
}
-static bool tokFuncTranslate(Token &tok, Stack &stack)
+static bool tokFuncTranslate(Token &/*tok*/, Stack &/*stack*/)
{
return true;
}
-static bool tokFuncBoolean(Token &tok, Stack &stack)
+static bool tokFuncBoolean(Token &/*tok*/, Stack &/*stack*/)
{
return true;
}
-static bool tokFuncNot(Token &tok, Stack &stack)
+static bool tokFuncNot(Token &/*tok*/, Stack &/*stack*/)
{
return true;
}
-static bool tokFuncTrue(Token &tok, Stack &stack)
+static bool tokFuncTrue(Token &/*tok*/, Stack &/*stack*/)
{
return true;
}
-static bool tokFuncFalse(Token &tok, Stack &stack)
+static bool tokFuncFalse(Token &/*tok*/, Stack &/*stack*/)
{
return true;
}
-static bool tokFuncLang(Token &tok, Stack &stack)
+static bool tokFuncLang(Token &/*tok*/, Stack &/*stack*/)
{
return true;
}
-static bool tokFuncNumber(Token &tok, Stack &stack)
+static bool tokFuncNumber(Token &/*tok*/, Stack &/*stack*/)
{
return true;
}
-static bool tokFuncSum(Token &tok, Stack &stack)
+static bool tokFuncSum(Token &/*tok*/, Stack &/*stack*/)
{
return true;
}
-static bool tokFuncFloor(Token &tok, Stack &stack)
+static bool tokFuncFloor(Token &/*tok*/, Stack &/*stack*/)
{
return true;
}
-static bool tokFuncCeiling(Token &tok, Stack &stack)
+static bool tokFuncCeiling(Token &/*tok*/, Stack &/*stack*/)
{
return true;
}
-static bool tokFuncRound(Token &tok, Stack &stack)
+static bool tokFuncRound(Token &/*tok*/, Stack &/*stack*/)
{
return true;
}
*/
int TokenExecutor::execute(std::vector<Token> &tokens,
int position,
- const NodePtr node,
+ const NodePtr /*node*/,
NodeList &result)
{
Stack stack(*this);