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 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313
|
/*
* Copyright (C) 1999 Lars Knoll (knoll@kde.org)
* (C) 1999 Antti Koivisto (koivisto@kde.org)
* (C) 2001 Peter Kelly (pmk@post.com)
* (C) 2001 Dirk Mueller (mueller@kde.org)
* Copyright (C) 2004, 2005, 2006, 2007, 2008 Apple Inc. All rights reserved.
* (C) 2007 Eric Seidel (eric@webkit.org)
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Library General Public
* License as published by the Free Software Foundation; either
* version 2 of the License, or (at your option) any later version.
*
* 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
* Library General Public License for more details.
*
* You should have received a copy of the GNU Library General Public License
* along with this library; see the file COPYING.LIB. If not, write to
* the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
* Boston, MA 02110-1301, USA.
*/
#include "config.h"
#include "NamedAttrMap.h"
#include "Document.h"
#include "Element.h"
#include "ExceptionCode.h"
#include "HTMLNames.h"
namespace WebCore {
using namespace HTMLNames;
static inline bool shouldIgnoreAttributeCase(const Element* e)
{
return e && e->document()->isHTMLDocument() && e->isHTMLElement();
}
NamedAttrMap::~NamedAttrMap()
{
NamedAttrMap::clearAttributes(); // virtual function, qualify to be explicit and slightly faster
}
bool NamedAttrMap::isMappedAttributeMap() const
{
return false;
}
PassRefPtr<Node> NamedAttrMap::getNamedItem(const String& name) const
{
String localName = shouldIgnoreAttributeCase(m_element) ? name.lower() : name;
Attribute* a = getAttributeItem(localName);
if (!a)
return 0;
return a->createAttrIfNeeded(m_element);
}
PassRefPtr<Node> NamedAttrMap::getNamedItemNS(const String& namespaceURI, const String& localName) const
{
return getNamedItem(QualifiedName(nullAtom, localName, namespaceURI));
}
PassRefPtr<Node> NamedAttrMap::removeNamedItem(const String& name, ExceptionCode& ec)
{
String localName = shouldIgnoreAttributeCase(m_element) ? name.lower() : name;
Attribute* a = getAttributeItem(localName);
if (!a) {
ec = NOT_FOUND_ERR;
return 0;
}
return removeNamedItem(a->name(), ec);
}
PassRefPtr<Node> NamedAttrMap::removeNamedItemNS(const String& namespaceURI, const String& localName, ExceptionCode& ec)
{
return removeNamedItem(QualifiedName(nullAtom, localName, namespaceURI), ec);
}
PassRefPtr<Node> NamedAttrMap::getNamedItem(const QualifiedName& name) const
{
Attribute* a = getAttributeItem(name);
if (!a)
return 0;
return a->createAttrIfNeeded(m_element);
}
PassRefPtr<Node> NamedAttrMap::setNamedItem(Node* arg, ExceptionCode& ec)
{
if (!m_element || !arg) {
ec = NOT_FOUND_ERR;
return 0;
}
// WRONG_DOCUMENT_ERR: Raised if arg was created from a different document than the one that created this map.
if (arg->document() != m_element->document()) {
ec = WRONG_DOCUMENT_ERR;
return 0;
}
// Not mentioned in spec: throw a HIERARCHY_REQUEST_ERROR if the user passes in a non-attribute node
if (!arg->isAttributeNode()) {
ec = HIERARCHY_REQUEST_ERR;
return 0;
}
Attr *attr = static_cast<Attr*>(arg);
Attribute* a = attr->attr();
Attribute* old = getAttributeItem(a->name());
if (old == a)
return RefPtr<Node>(arg); // we know about it already
// INUSE_ATTRIBUTE_ERR: Raised if arg is an Attr that is already an attribute of another Element object.
// The DOM user must explicitly clone Attr nodes to re-use them in other elements.
if (attr->ownerElement()) {
ec = INUSE_ATTRIBUTE_ERR;
return 0;
}
if (a->name() == idAttr)
m_element->updateId(old ? old->value() : nullAtom, a->value());
// ### slightly inefficient - resizes attribute array twice.
RefPtr<Node> r;
if (old) {
r = old->createAttrIfNeeded(m_element);
removeAttribute(a->name());
}
addAttribute(a);
return r.release();
}
// The DOM2 spec doesn't say that removeAttribute[NS] throws NOT_FOUND_ERR
// if the attribute is not found, but at this level we have to throw NOT_FOUND_ERR
// because of removeNamedItem, removeNamedItemNS, and removeAttributeNode.
PassRefPtr<Node> NamedAttrMap::removeNamedItem(const QualifiedName& name, ExceptionCode& ec)
{
Attribute* a = getAttributeItem(name);
if (!a) {
ec = NOT_FOUND_ERR;
return 0;
}
RefPtr<Node> r = a->createAttrIfNeeded(m_element);
if (name == idAttr)
m_element->updateId(a->value(), nullAtom);
removeAttribute(name);
return r.release();
}
PassRefPtr<Node> NamedAttrMap::item (unsigned index) const
{
if (index >= length())
return 0;
return m_attributes[index]->createAttrIfNeeded(m_element);
}
Attribute* NamedAttrMap::getAttributeItem(const String& name) const
{
unsigned len = length();
for (unsigned i = 0; i < len; ++i) {
if (!m_attributes[i]->name().hasPrefix() &&
m_attributes[i]->name().localName() == name)
return m_attributes[i].get();
if (m_attributes[i]->name().toString() == name)
return m_attributes[i].get();
}
return 0;
}
Attribute* NamedAttrMap::getAttributeItem(const QualifiedName& name) const
{
unsigned len = length();
for (unsigned i = 0; i < len; ++i) {
if (m_attributes[i]->name().matches(name))
return m_attributes[i].get();
}
return 0;
}
void NamedAttrMap::clearAttributes()
{
unsigned len = length();
for (unsigned i = 0; i < len; i++)
if (Attr* attr = m_attributes[i]->attr())
attr->m_element = 0;
m_attributes.clear();
}
void NamedAttrMap::detachFromElement()
{
// we allow a NamedAttrMap w/o an element in case someone still has a reference
// to if after the element gets deleted - but the map is now invalid
m_element = 0;
clearAttributes();
}
void NamedAttrMap::setAttributes(const NamedAttrMap& other)
{
// clone all attributes in the other map, but attach to our element
if (!m_element)
return;
// If assigning the map changes the id attribute, we need to call
// updateId.
Attribute *oldId = getAttributeItem(idAttr);
Attribute *newId = other.getAttributeItem(idAttr);
if (oldId || newId)
m_element->updateId(oldId ? oldId->value() : nullAtom, newId ? newId->value() : nullAtom);
clearAttributes();
unsigned newLength = other.length();
m_attributes.resize(newLength);
for (unsigned i = 0; i < newLength; i++)
m_attributes[i] = other.m_attributes[i]->clone();
// FIXME: This is wasteful. The class list could be preserved on a copy, and we
// wouldn't have to waste time reparsing the attribute.
// The derived class, HTMLNamedAttrMap, which manages a parsed class list for the CLASS attribute,
// will update its member variable when parse attribute is called.
for (unsigned i = 0; i < newLength; i++)
m_element->attributeChanged(m_attributes[i].get(), true);
}
void NamedAttrMap::addAttribute(PassRefPtr<Attribute> prpAttribute)
{
RefPtr<Attribute> attribute = prpAttribute;
// Add the attribute to the list
m_attributes.append(attribute);
if (Attr* attr = attribute->attr())
attr->m_element = m_element;
// Notify the element that the attribute has been added, and dispatch appropriate mutation events
// Note that element may be null here if we are called from insertAttr() during parsing
if (m_element) {
m_element->attributeChanged(attribute.get());
// Because of our updateStyleAttribute() style modification events are never sent at the right time, so don't bother sending them.
if (attribute->name() != styleAttr) {
m_element->dispatchAttrAdditionEvent(attribute.get());
m_element->dispatchSubtreeModifiedEvent();
}
}
}
void NamedAttrMap::removeAttribute(const QualifiedName& name)
{
unsigned len = length();
unsigned index = len + 1;
for (unsigned i = 0; i < len; ++i)
if (m_attributes[i]->name().matches(name)) {
index = i;
break;
}
if (index >= len)
return;
// Remove the attribute from the list
RefPtr<Attribute> attr = m_attributes[index].get();
if (Attr* a = m_attributes[index]->attr())
a->m_element = 0;
m_attributes.remove(index);
// Notify the element that the attribute has been removed
// dispatch appropriate mutation events
if (m_element && !attr->m_value.isNull()) {
AtomicString value = attr->m_value;
attr->m_value = nullAtom;
m_element->attributeChanged(attr.get());
attr->m_value = value;
}
if (m_element) {
m_element->dispatchAttrRemovalEvent(attr.get());
m_element->dispatchSubtreeModifiedEvent();
}
}
bool NamedAttrMap::mapsEquivalent(const NamedAttrMap* otherMap) const
{
if (!otherMap)
return false;
unsigned len = length();
if (len != otherMap->length())
return false;
for (unsigned i = 0; i < len; i++) {
Attribute *attr = attributeItem(i);
Attribute *otherAttr = otherMap->getAttributeItem(attr->name());
if (!otherAttr || attr->value() != otherAttr->value())
return false;
}
return true;
}
}
|