1/*
2 * Copyright (C) 2005 Frerich Raabe <raabe@kde.org>
3 * Copyright (C) 2006, 2009 Apple Inc.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 *
9 * 1. Redistributions of source code must retain the above copyright
10 *    notice, this list of conditions and the following disclaimer.
11 * 2. Redistributions in binary form must reproduce the above copyright
12 *    notice, this list of conditions and the following disclaimer in the
13 *    documentation and/or other materials provided with the distribution.
14 *
15 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
16 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
17 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
18 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
19 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
20 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
21 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
22 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
23 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
24 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
25 */
26
27#include "config.h"
28#include "XPathUtil.h"
29
30#include "ContainerNode.h"
31#include "NodeTraversal.h"
32#include <wtf/text/StringBuilder.h>
33
34namespace WebCore {
35namespace XPath {
36
37bool isRootDomNode(Node* node)
38{
39    return node && !node->parentNode();
40}
41
42String stringValue(Node* node)
43{
44    switch (node->nodeType()) {
45        case Node::ATTRIBUTE_NODE:
46        case Node::PROCESSING_INSTRUCTION_NODE:
47        case Node::COMMENT_NODE:
48        case Node::TEXT_NODE:
49        case Node::CDATA_SECTION_NODE:
50        case Node::XPATH_NAMESPACE_NODE:
51            return node->nodeValue();
52        default:
53            if (isRootDomNode(node) || node->nodeType() == Node::ELEMENT_NODE) {
54                StringBuilder result;
55                result.reserveCapacity(1024);
56
57                for (Node* n = node->firstChild(); n; n = NodeTraversal::next(n, node)) {
58                    if (n->isTextNode()) {
59                        const String& nodeValue = n->nodeValue();
60                        result.append(nodeValue);
61                    }
62                }
63
64                return result.toString();
65            }
66    }
67
68    return String();
69}
70
71bool isValidContextNode(Node* node)
72{
73    if (!node)
74        return false;
75    switch (node->nodeType()) {
76        case Node::ATTRIBUTE_NODE:
77        case Node::CDATA_SECTION_NODE:
78        case Node::COMMENT_NODE:
79        case Node::DOCUMENT_NODE:
80        case Node::ELEMENT_NODE:
81        case Node::PROCESSING_INSTRUCTION_NODE:
82        case Node::XPATH_NAMESPACE_NODE:
83            return true;
84        case Node::DOCUMENT_FRAGMENT_NODE:
85        case Node::DOCUMENT_TYPE_NODE:
86        case Node::ENTITY_NODE:
87        case Node::ENTITY_REFERENCE_NODE:
88        case Node::NOTATION_NODE:
89            return false;
90        case Node::TEXT_NODE:
91            return !(node->parentNode() && node->parentNode()->isAttributeNode());
92    }
93    ASSERT_NOT_REACHED();
94    return false;
95}
96
97}
98}
99