src/third_party/WebKit/Source/core/dom/custom/CustomElementUpgradeCandidateMap.cpp

   1 /*
   2  * Copyright (C) 2013 Google Inc. All rights reserved.
   3  *
   4  * Redistribution and use in source and binary forms, with or without
   5  * modification, are permitted provided that the following conditions are
   6  * met:
   7  *
   8  *     * Redistributions of source code must retain the above copyright
   9  * notice, this list of conditions and the following disclaimer.
  10  *     * Redistributions in binary form must reproduce the above
  11  * copyright notice, this list of conditions and the following disclaimer
  12  * in the documentation and/or other materials provided with the
  13  * distribution.
  14  *     * Neither the name of Google Inc. nor the names of its
  15  * contributors may be used to endorse or promote products derived from
  16  * this software without specific prior written permission.
  17  *
  18  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
  19  * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
  20  * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
  21  * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
  22  * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  23  * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
  24  * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
  25  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
  26  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  27  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  28  * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  29  */
  30
  31 #include "config.h"
  32 #include "core/dom/custom/CustomElementUpgradeCandidateMap.h"
  33
  34 #include "core/dom/Element.h"
  35
  36 namespace WebCore {
  37
  38 CustomElementUpgradeCandidateMap::~CustomElementUpgradeCandidateMap()
  39 {
  40     UpgradeCandidateMap::const_iterator::Keys end = m_upgradeCandidates.end().keys();
  41     for (UpgradeCandidateMap::const_iterator::Keys it = m_upgradeCandidates.begin().keys(); it != end; ++it)
  42         unobserve(*it);
  43 }
  44
  45 void CustomElementUpgradeCandidateMap::add(const CustomElementDescriptor& descriptor, Element* element)
  46 {
  47     observe(element);
  48
  49     UpgradeCandidateMap::AddResult result = m_upgradeCandidates.add(element, descriptor);
  50     ASSERT_UNUSED(result, result.isNewEntry);
  51
  52     UnresolvedDefinitionMap::iterator it = m_unresolvedDefinitions.find(descriptor);
  53     ElementSet* elements;
  54     if (it == m_unresolvedDefinitions.end())
  55         elements = &m_unresolvedDefinitions.add(descriptor, ElementSet()).storedValue->value;
  56     else
  57         elements = &it->value;
  58     elements->add(element);
  59 }
  60
  61 void CustomElementUpgradeCandidateMap::remove(Element* element)
  62 {
  63     unobserve(element);
  64     removeCommon(element);
  65 }
  66
  67 void CustomElementUpgradeCandidateMap::elementWasDestroyed(Element* element)
  68 {
  69     CustomElementObserver::elementWasDestroyed(element);
  70     removeCommon(element);
  71 }
  72
  73 void CustomElementUpgradeCandidateMap::removeCommon(Element* element)
  74 {
  75     UpgradeCandidateMap::iterator candidate = m_upgradeCandidates.find(element);
  76     ASSERT_WITH_SECURITY_IMPLICATION(candidate != m_upgradeCandidates.end());
  77
  78     UnresolvedDefinitionMap::iterator elements = m_unresolvedDefinitions.find(candidate->value);
  79     ASSERT_WITH_SECURITY_IMPLICATION(elements != m_unresolvedDefinitions.end());
  80     elements->value.remove(element);
  81     m_upgradeCandidates.remove(candidate);
  82 }
  83
  84 void CustomElementUpgradeCandidateMap::elementDidFinishParsingChildren(Element* element)
  85 {
  86     // An upgrade candidate finished parsing; reorder so that eventual
  87     // upgrade order matches finished-parsing order.
  88     moveToEnd(element);
  89 }
  90
  91 void CustomElementUpgradeCandidateMap::moveToEnd(Element* element)
  92 {
  93     UpgradeCandidateMap::iterator candidate = m_upgradeCandidates.find(element);
  94     ASSERT_WITH_SECURITY_IMPLICATION(candidate != m_upgradeCandidates.end());
  95
  96     UnresolvedDefinitionMap::iterator elements = m_unresolvedDefinitions.find(candidate->value);
  97     ASSERT_WITH_SECURITY_IMPLICATION(elements != m_unresolvedDefinitions.end());
  98     elements->value.appendOrMoveToLast(element);
  99 }
 100
 101 ListHashSet<Element*> CustomElementUpgradeCandidateMap::takeUpgradeCandidatesFor(const CustomElementDescriptor& descriptor)
 102 {
 103     const ListHashSet<Element*>& candidates = m_unresolvedDefinitions.take(descriptor);
 104
 105     for (ElementSet::const_iterator candidate = candidates.begin(); candidate != candidates.end(); ++candidate) {
 106         unobserve(*candidate);
 107         m_upgradeCandidates.remove(*candidate);
 108     }
 109
 110     return candidates;
 111 }
 112
 113 }