File: NodeIteratorBase.cpp

package info (click to toggle)
chromium-browser 57.0.2987.98-1~deb8u1
  • links: PTS, VCS
  • area: main
  • in suites: jessie
  • size: 2,637,852 kB
  • ctags: 2,544,394
  • sloc: cpp: 12,815,961; ansic: 3,676,222; python: 1,147,112; asm: 526,608; java: 523,212; xml: 286,794; perl: 92,654; sh: 86,408; objc: 73,271; makefile: 27,698; cs: 18,487; yacc: 13,031; tcl: 12,957; pascal: 4,875; ml: 4,716; lex: 3,904; sql: 3,862; ruby: 1,982; lisp: 1,508; php: 1,368; exp: 404; awk: 325; csh: 117; jsp: 39; sed: 37
file content (61 lines) | stat: -rw-r--r-- 2,213 bytes parent folder | download
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
/*
 * Copyright (C) 1999 Lars Knoll (knoll@kde.org)
 * Copyright (C) 2000 Frederik Holljen (frederik.holljen@hig.no)
 * Copyright (C) 2001 Peter Kelly (pmk@post.com)
 * Copyright (C) 2006 Samuel Weinig (sam.weinig@gmail.com)
 * Copyright (C) 2004, 2008 Apple Inc. All rights reserved.
 *
 * 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 "core/dom/NodeIteratorBase.h"

#include "bindings/core/v8/ExceptionState.h"
#include "core/dom/Node.h"
#include "core/dom/NodeFilter.h"

namespace blink {

NodeIteratorBase::NodeIteratorBase(void* childThis,
                                   Node* rootNode,
                                   unsigned whatToShow,
                                   NodeFilter* nodeFilter)
    : m_root(rootNode),
      m_whatToShow(whatToShow),
      m_filter(childThis, nodeFilter) {}

unsigned NodeIteratorBase::acceptNode(Node* node,
                                      ExceptionState& exceptionState) const {
  // The bit twiddling here is done to map DOM node types, which are given as
  // integers from 1 through 14, to whatToShow bit masks.
  if (!(((1 << (node->getNodeType() - 1)) & m_whatToShow)))
    return NodeFilter::kFilterSkip;
  if (!m_filter)
    return NodeFilter::kFilterAccept;
  return m_filter->acceptNode(node, exceptionState);
}

DEFINE_TRACE(NodeIteratorBase) {
  visitor->trace(m_root);
  visitor->trace(m_filter);
}

DEFINE_TRACE_WRAPPERS(NodeIteratorBase) {
  visitor->traceWrappers(m_filter);
}

}  // namespace blink