1 /*
2 * Copyright (C) 2006, 2008, 2009 Apple Inc. All rights reserved.
3 *
4 * This library is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU Library General Public
6 * License as published by the Free Software Foundation; either
7 * version 2 of the License, or (at your option) any later version.
8 *
9 * This library is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12 * Library General Public License for more details.
13 *
14 * You should have received a copy of the GNU Library General Public License
15 * along with this library; see the file COPYING.LIB. If not, write to
16 * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
17 * Boston, MA 02110-1301, USA.
18 */
19
20 #include "config.h"
21 #include "JSTreeWalker.h"
22
23 #include "JSNode.h"
24 #include "Node.h"
25 #include "NodeFilter.h"
26 #include "TreeWalker.h"
27
28 using namespace JSC;
29
30 namespace WebCore {
31
markChildren(MarkStack & markStack)32 void JSTreeWalker::markChildren(MarkStack& markStack)
33 {
34 Base::markChildren(markStack);
35
36 if (NodeFilter* filter = m_impl->filter())
37 filter->markAggregate(markStack);
38 }
39
parentNode(ExecState * exec,const ArgList &)40 JSValue JSTreeWalker::parentNode(ExecState* exec, const ArgList&)
41 {
42 Node* node = impl()->parentNode(exec);
43 if (exec->hadException())
44 return jsUndefined();
45 return toJS(exec, node);
46 }
47
firstChild(ExecState * exec,const ArgList &)48 JSValue JSTreeWalker::firstChild(ExecState* exec, const ArgList&)
49 {
50 Node* node = impl()->firstChild(exec);
51 if (exec->hadException())
52 return jsUndefined();
53 return toJS(exec, node);
54 }
55
lastChild(ExecState * exec,const ArgList &)56 JSValue JSTreeWalker::lastChild(ExecState* exec, const ArgList&)
57 {
58 Node* node = impl()->lastChild(exec);
59 if (exec->hadException())
60 return jsUndefined();
61 return toJS(exec, node);
62 }
63
nextSibling(ExecState * exec,const ArgList &)64 JSValue JSTreeWalker::nextSibling(ExecState* exec, const ArgList&)
65 {
66 Node* node = impl()->nextSibling(exec);
67 if (exec->hadException())
68 return jsUndefined();
69 return toJS(exec, node);
70 }
71
previousSibling(ExecState * exec,const ArgList &)72 JSValue JSTreeWalker::previousSibling(ExecState* exec, const ArgList&)
73 {
74 Node* node = impl()->previousSibling(exec);
75 if (exec->hadException())
76 return jsUndefined();
77 return toJS(exec, node);
78 }
79
previousNode(ExecState * exec,const ArgList &)80 JSValue JSTreeWalker::previousNode(ExecState* exec, const ArgList&)
81 {
82 Node* node = impl()->previousNode(exec);
83 if (exec->hadException())
84 return jsUndefined();
85 return toJS(exec, node);
86 }
87
nextNode(ExecState * exec,const ArgList &)88 JSValue JSTreeWalker::nextNode(ExecState* exec, const ArgList&)
89 {
90 Node* node = impl()->nextNode(exec);
91 if (exec->hadException())
92 return jsUndefined();
93 return toJS(exec, node);
94 }
95
96 }
97