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
314
315
316
317
318
319
320
321
322
323
324
325
326
327
|
// -*- c-basic-offset: 2 -*-
/*
* This file is part of the KDE libraries
* Copyright (C) 2001 Peter Kelly (pmk@post.com)
*
* 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; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
#include "kjs_traversal.h"
#include "kjs_traversal.lut.h"
#include "kjs_proxy.h"
#include <dom/dom_node.h>
#include <xml/dom_nodeimpl.h>
#include <xml/dom_docimpl.h>
#include <khtmlview.h>
#include <khtml_part.h>
#include <kdebug.h>
namespace KJS {
// -------------------------------------------------------------------------
const ClassInfo DOMNodeIterator::info = { "NodeIterator", 0, &DOMNodeIteratorTable, 0 };
/*
@begin DOMNodeIteratorTable 5
root DOMNodeIterator::Root DontDelete|ReadOnly
whatToShow DOMNodeIterator::WhatToShow DontDelete|ReadOnly
filter DOMNodeIterator::Filter DontDelete|ReadOnly
expandEntityReferences DOMNodeIterator::ExpandEntityReferences DontDelete|ReadOnly
@end
@begin DOMNodeIteratorProtoTable 3
nextNode DOMNodeIterator::NextNode DontDelete|Function 0
previousNode DOMNodeIterator::PreviousNode DontDelete|Function 0
detach DOMNodeIterator::Detach DontDelete|Function 0
@end
*/
KJS_DEFINE_PROTOTYPE(DOMNodeIteratorProto)
IMPLEMENT_PROTOFUNC_DOM(DOMNodeIteratorProtoFunc)
KJS_IMPLEMENT_PROTOTYPE("DOMNodeIterator", DOMNodeIteratorProto,DOMNodeIteratorProtoFunc)
DOMNodeIterator::DOMNodeIterator(ExecState *exec, DOM::NodeIterator ni)
: DOMObject(DOMNodeIteratorProto::self(exec)), nodeIterator(ni) {}
DOMNodeIterator::~DOMNodeIterator()
{
ScriptInterpreter::forgetDOMObject(nodeIterator.handle());
}
Value DOMNodeIterator::tryGet(ExecState *exec, const Identifier &p) const
{
return DOMObjectLookupGetValue<DOMNodeIterator,DOMObject>(exec,p,&DOMNodeIteratorTable,this);
}
Value DOMNodeIterator::getValueProperty(ExecState *exec, int token) const
{
DOM::NodeIterator ni(nodeIterator);
switch (token) {
case Root:
return getDOMNode(exec,ni.root());
case WhatToShow:
return Number(ni.whatToShow());
case Filter:
return getDOMNodeFilter(exec,ni.filter());
case ExpandEntityReferences:
return Boolean(ni.expandEntityReferences());
default:
kdDebug(6070) << "WARNING: Unhandled token in DOMNodeIterator::getValueProperty : " << token << endl;
return Value();
}
}
Value DOMNodeIteratorProtoFunc::tryCall(ExecState *exec, Object &thisObj, const List &)
{
KJS_CHECK_THIS( KJS::DOMNodeIterator, thisObj );
DOM::NodeIterator nodeIterator = static_cast<DOMNodeIterator *>(thisObj.imp())->toNodeIterator();
switch (id) {
case DOMNodeIterator::PreviousNode:
return getDOMNode(exec,nodeIterator.previousNode());
case DOMNodeIterator::NextNode:
return getDOMNode(exec,nodeIterator.nextNode());
case DOMNodeIterator::Detach:
nodeIterator.detach();
return Undefined();
}
return Undefined();
}
Value getDOMNodeIterator(ExecState *exec, DOM::NodeIterator ni)
{
return cacheDOMObject<DOM::NodeIterator, DOMNodeIterator>(exec, ni);
}
// -------------------------------------------------------------------------
const ClassInfo NodeFilterConstructor::info = { "NodeFilterConstructor", 0, &NodeFilterConstructorTable, 0 };
/*
@begin NodeFilterConstructorTable 17
FILTER_ACCEPT DOM::NodeFilter::FILTER_ACCEPT DontDelete|ReadOnly
FILTER_REJECT DOM::NodeFilter::FILTER_REJECT DontDelete|ReadOnly
FILTER_SKIP DOM::NodeFilter::FILTER_SKIP DontDelete|ReadOnly
SHOW_ALL DOM::NodeFilter::SHOW_ALL DontDelete|ReadOnly
SHOW_ELEMENT DOM::NodeFilter::SHOW_ELEMENT DontDelete|ReadOnly
SHOW_ATTRIBUTE DOM::NodeFilter::SHOW_ATTRIBUTE DontDelete|ReadOnly
SHOW_TEXT DOM::NodeFilter::SHOW_TEXT DontDelete|ReadOnly
SHOW_CDATA_SECTION DOM::NodeFilter::SHOW_CDATA_SECTION DontDelete|ReadOnly
SHOW_ENTITY_REFERENCE DOM::NodeFilter::SHOW_ENTITY_REFERENCE DontDelete|ReadOnly
SHOW_ENTITY DOM::NodeFilter::SHOW_ENTITY DontDelete|ReadOnly
SHOW_PROCESSING_INSTRUCTION DOM::NodeFilter::SHOW_PROCESSING_INSTRUCTION DontDelete|ReadOnly
SHOW_COMMENT DOM::NodeFilter::SHOW_COMMENT DontDelete|ReadOnly
SHOW_DOCUMENT DOM::NodeFilter::SHOW_DOCUMENT DontDelete|ReadOnly
SHOW_DOCUMENT_TYPE DOM::NodeFilter::SHOW_DOCUMENT_TYPE DontDelete|ReadOnly
SHOW_DOCUMENT_FRAGMENT DOM::NodeFilter::SHOW_DOCUMENT_FRAGMENT DontDelete|ReadOnly
SHOW_NOTATION DOM::NodeFilter::SHOW_NOTATION DontDelete|ReadOnly
@end
*/
NodeFilterConstructor::NodeFilterConstructor(ExecState* exec)
: DOMObject(exec->interpreter()->builtinObjectPrototype())
{
}
Value NodeFilterConstructor::tryGet(ExecState *exec, const Identifier &p) const
{
return DOMObjectLookupGetValue<NodeFilterConstructor,DOMObject>(exec,p,&NodeFilterConstructorTable,this);
}
Value NodeFilterConstructor::getValueProperty(ExecState *, int token) const
{
// We use the token as the value to return directly
return Number(token);
}
Value getNodeFilterConstructor(ExecState *exec)
{
return cacheGlobalObject<NodeFilterConstructor>(exec, "[[nodeFilter.constructor]]");
}
// -------------------------------------------------------------------------
const ClassInfo DOMNodeFilter::info = { "NodeFilter", 0, 0, 0 };
/*
@begin DOMNodeFilterProtoTable 1
acceptNode DOMNodeFilter::AcceptNode DontDelete|Function 0
@end
*/
KJS_DEFINE_PROTOTYPE(DOMNodeFilterProto)
IMPLEMENT_PROTOFUNC_DOM(DOMNodeFilterProtoFunc)
KJS_IMPLEMENT_PROTOTYPE("DOMNodeFilter",DOMNodeFilterProto,DOMNodeFilterProtoFunc)
DOMNodeFilter::DOMNodeFilter(ExecState *exec, DOM::NodeFilter nf)
: DOMObject(DOMNodeFilterProto::self(exec)), nodeFilter(nf) {}
DOMNodeFilter::~DOMNodeFilter()
{
ScriptInterpreter::forgetDOMObject(nodeFilter.handle());
}
Value DOMNodeFilterProtoFunc::tryCall(ExecState *exec, Object &thisObj, const List &args)
{
KJS_CHECK_THIS( KJS::DOMNodeFilter, thisObj );
DOM::NodeFilter nodeFilter = static_cast<DOMNodeFilter *>(thisObj.imp())->toNodeFilter();
switch (id) {
case DOMNodeFilter::AcceptNode:
return Number(nodeFilter.acceptNode(toNode(args[0])));
}
return Undefined();
}
Value getDOMNodeFilter(ExecState *exec, DOM::NodeFilter nf)
{
return cacheDOMObject<DOM::NodeFilter, DOMNodeFilter>(exec, nf);
}
// -------------------------------------------------------------------------
const ClassInfo DOMTreeWalker::info = { "TreeWalker", 0, &DOMTreeWalkerTable, 0 };
/*
@begin DOMTreeWalkerTable 5
root DOMTreeWalker::Root DontDelete|ReadOnly
whatToShow DOMTreeWalker::WhatToShow DontDelete|ReadOnly
filter DOMTreeWalker::Filter DontDelete|ReadOnly
expandEntityReferences DOMTreeWalker::ExpandEntityReferences DontDelete|ReadOnly
currentNode DOMTreeWalker::CurrentNode DontDelete
@end
@begin DOMTreeWalkerProtoTable 7
parentNode DOMTreeWalker::ParentNode DontDelete|Function 0
firstChild DOMTreeWalker::FirstChild DontDelete|Function 0
lastChild DOMTreeWalker::LastChild DontDelete|Function 0
previousSibling DOMTreeWalker::PreviousSibling DontDelete|Function 0
nextSibling DOMTreeWalker::NextSibling DontDelete|Function 0
previousNode DOMTreeWalker::PreviousNode DontDelete|Function 0
nextNode DOMTreeWalker::NextNode DontDelete|Function 0
@end
*/
KJS_DEFINE_PROTOTYPE(DOMTreeWalkerProto)
IMPLEMENT_PROTOFUNC_DOM(DOMTreeWalkerProtoFunc)
KJS_IMPLEMENT_PROTOTYPE("DOMTreeWalker", DOMTreeWalkerProto,DOMTreeWalkerProtoFunc)
DOMTreeWalker::DOMTreeWalker(ExecState *exec, DOM::TreeWalker tw)
: DOMObject(DOMTreeWalkerProto::self(exec)), treeWalker(tw) {}
DOMTreeWalker::~DOMTreeWalker()
{
ScriptInterpreter::forgetDOMObject(treeWalker.handle());
}
Value DOMTreeWalker::tryGet(ExecState *exec, const Identifier &p) const
{
return DOMObjectLookupGetValue<DOMTreeWalker,DOMObject>(exec,p,&DOMTreeWalkerTable,this);
}
Value DOMTreeWalker::getValueProperty(ExecState *exec, int token) const
{
DOM::TreeWalker tw(treeWalker);
switch (token) {
case Root:
return getDOMNode(exec,tw.root());
case WhatToShow:
return Number(tw.whatToShow());
case Filter:
return getDOMNodeFilter(exec,tw.filter());
case ExpandEntityReferences:
return Boolean(tw.expandEntityReferences());
case CurrentNode:
return getDOMNode(exec,tw.currentNode());
default:
kdDebug(6070) << "WARNING: Unhandled token in DOMTreeWalker::getValueProperty : " << token << endl;
return Value();
}
}
void DOMTreeWalker::tryPut(ExecState *exec, const Identifier &propertyName,
const Value& value, int attr)
{
if (propertyName == "currentNode") {
treeWalker.setCurrentNode(toNode(value));
}
else
ObjectImp::put(exec, propertyName, value, attr);
}
Value DOMTreeWalkerProtoFunc::tryCall(ExecState *exec, Object &thisObj, const List &)
{
KJS_CHECK_THIS( KJS::DOMTreeWalker, thisObj );
DOM::TreeWalker treeWalker = static_cast<DOMTreeWalker *>(thisObj.imp())->toTreeWalker();
switch (id) {
case DOMTreeWalker::ParentNode:
return getDOMNode(exec,treeWalker.parentNode());
case DOMTreeWalker::FirstChild:
return getDOMNode(exec,treeWalker.firstChild());
case DOMTreeWalker::LastChild:
return getDOMNode(exec,treeWalker.lastChild());
case DOMTreeWalker::PreviousSibling:
return getDOMNode(exec,treeWalker.previousSibling());
case DOMTreeWalker::NextSibling:
return getDOMNode(exec,treeWalker.nextSibling());
case DOMTreeWalker::PreviousNode:
return getDOMNode(exec,treeWalker.previousSibling());
case DOMTreeWalker::NextNode:
return getDOMNode(exec,treeWalker.nextNode());
}
return Undefined();
}
Value getDOMTreeWalker(ExecState *exec, DOM::TreeWalker tw)
{
return cacheDOMObject<DOM::TreeWalker, DOMTreeWalker>(exec, tw);
}
DOM::NodeFilter toNodeFilter(const Value& val)
{
Object obj = Object::dynamicCast(val);
if (!obj.isValid() || !obj.inherits(&DOMNodeFilter::info))
return DOM::NodeFilter();
const DOMNodeFilter *dobj = static_cast<const DOMNodeFilter*>(obj.imp());
return dobj->toNodeFilter();
}
// -------------------------------------------------------------------------
JSNodeFilter::JSNodeFilter(Object & _filter) : DOM::CustomNodeFilter(), filter( _filter )
{
}
JSNodeFilter::~JSNodeFilter()
{
}
short JSNodeFilter::acceptNode(const DOM::Node &n)
{
KHTMLView *view = static_cast<DOM::DocumentImpl *>( n.handle()->docPtr() )->view();
if (!view)
return DOM::NodeFilter::FILTER_REJECT;
KHTMLPart *part = view->part();
KJSProxy *proxy = part->jScript();
if (proxy) {
ExecState *exec = proxy->interpreter()->globalExec();
Object acceptNodeFunc = Object::dynamicCast( filter.get(exec, "acceptNode") );
if (!acceptNodeFunc.isNull() && acceptNodeFunc.implementsCall()) {
List args;
args.append(getDOMNode(exec,n));
Value result = acceptNodeFunc.call(exec,filter,args);
if (exec->hadException())
exec->clearException();
return result.toInteger(exec);
}
}
return DOM::NodeFilter::FILTER_REJECT;
}
} //namespace KJS
|