summaryrefslogtreecommitdiff
path: root/gnu/xml/dom/ls/FilteredSAXEventSink.java
blob: 1c99ee524fa60828fef5267452f2e0f92984575b (plain)
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
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
/* FilteredSAXEventSink.java -- 
   Copyright (C) 1999,2000,2001 Free Software Foundation, Inc.

This file is part of GNU Classpath.

GNU Classpath is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2, or (at your option)
any later version.

GNU Classpath 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
General Public License for more details.

You should have received a copy of the GNU General Public License
along with GNU Classpath; see the file COPYING.  If not, write to the
Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
02110-1301 USA.

Linking this library statically or dynamically with other modules is
making a combined work based on this library.  Thus, the terms and
conditions of the GNU General Public License cover the whole
combination.

As a special exception, the copyright holders of this library give you
permission to link this library with independent modules to produce an
executable, regardless of the license terms of these independent
modules, and to copy and distribute the resulting executable under
terms of your choice, provided that you also meet, for each linked
independent module, the terms and conditions of the license of that
module.  An independent module is a module which is not derived from
or based on this library.  If you modify this library, you may extend
this exception to your version of the library, but you are not
obligated to do so.  If you do not wish to do so, delete this
exception statement from your version. */

package gnu.xml.dom.ls;

import java.util.LinkedList;
import org.w3c.dom.Attr;
import org.w3c.dom.Element;
import org.w3c.dom.Node;
import org.w3c.dom.Text;
import org.w3c.dom.ls.LSParserFilter;
import org.w3c.dom.traversal.NodeFilter;
import org.xml.sax.Attributes;
import org.xml.sax.SAXException;

/**
 * A SAX event sink that calls out to a parser filter in order to decide
 * whether to insert nodes into the tree.
 *
 * @author <a href='mailto:dog@gnu.org'>Chris Burdess</a>
 */
class FilteredSAXEventSink
  extends SAXEventSink
{

  final LSParserFilter filter;
  final int whatToShow;

  /**
   * Stack of elements to insert.
   */
  LinkedList nodes;
  
  /**
   * Corresponding stack of filter decisions about the nodes.
   */
  LinkedList decisions;

  /**
   * True when rejecting child nodes.
   */
  boolean rejecting;

  FilteredSAXEventSink(LSParserFilter filter)
  {
    this.filter = filter;
    whatToShow = filter.getWhatToShow();
  }

  public void startDocument()
    throws SAXException
  {
    if (interrupted)
      {
        return;
      }
    nodes = new LinkedList();
    decisions = new LinkedList();
    
    super.startDocument();
  }

  public void endDocument()
    throws SAXException
  {
    if (interrupted)
      {
        return;
      }
    super.endDocument();

    switch (getDecision(ctx, false))
      {
      case LSParserFilter.FILTER_REJECT:
        ctx = null;
        doc = null;
        break;
      }
    
    nodes = null;
    decisions = null;
  }

  public void startElement(String uri, String localName, String qName,
                           Attributes atts)
    throws SAXException
  {
    if (rejecting || interrupted)
      {
        return;
      }
    Element element = createElement(uri, localName, qName, atts);
    ctx = element;
    
    short decision = getDecision(element, true);
    nodes.addLast(element);
    decisions.addLast(new Short(decision));

    switch (decision)
      {
      case LSParserFilter.FILTER_REJECT:
        rejecting = true;
        break;
      case LSParserFilter.FILTER_INTERRUPT:
        interrupted = true;
        break;
      }
  }

  protected Attr createAttr(Attributes atts, int index)
  {
    Attr attr = super.createAttr(atts, index);
    short decision = getDecision(attr, false);
    switch (decision)
      {
      case LSParserFilter.FILTER_REJECT:
        return null;
      case LSParserFilter.FILTER_INTERRUPT:
        interrupted = true;
        return null;
      }
    return attr;
  }

  public void endElement(String uri, String localName, String qName)
    throws SAXException
  {
    if (rejecting || interrupted)
      {
        return;
      }
    super.endElement(uri, localName, qName);
    
    Element element = (Element) nodes.removeLast();
    Node parent = nodes.isEmpty() ? doc : (Node) nodes.getLast();
    ctx = parent;
    short decision = ((Short) decisions.removeLast()).shortValue();
    switch (decision)
      {
      case LSParserFilter.FILTER_SKIP:
        // Add all children of element to parent
        for (Node child = element.getFirstChild(); child != null;
             child = child.getNextSibling())
          {
            parent.insertBefore(child, element);
          }
        return;
      case LSParserFilter.FILTER_REJECT:
        rejecting = false;
        break;
      }
    decision = getDecision(element, false);
    switch (decision)
      {
      case LSParserFilter.FILTER_ACCEPT:
        parent.appendChild(element);
        break;
      case LSParserFilter.FILTER_INTERRUPT:
        interrupted = true;
        break;
      }
  }

  public void characters(char[] c, int off, int len)
    throws SAXException
  {
    if (rejecting || interrupted)
      {
        return;
      }
    Text text = createText(c, off, len);
    short decision = getDecision(text, false);
    switch (decision)
      {
      case LSParserFilter.FILTER_ACCEPT:
        ctx.appendChild(text);
        break;
      case LSParserFilter.FILTER_INTERRUPT:
        interrupted = true;
        break;
      }
  }

  public void processingInstruction(String target, String data)
    throws SAXException
  {
    if (rejecting || interrupted || inDTD)
      {
        return;
      }
    Node pi = createProcessingInstruction(target, data);
    short decision = getDecision(pi, false);
    switch (decision)
      {
      case LSParserFilter.FILTER_ACCEPT:
        ctx.appendChild(pi);
        break;
      case LSParserFilter.FILTER_INTERRUPT:
        interrupted = true;
        break;
      }
  }

  public void startDTD(String name, String publicId, String systemId)
    throws SAXException
  {
    if (interrupted)
      {
        return;
      }
    Node doctype = createDocumentType(name, publicId, systemId);
    ctx = doctype;
    inDTD = true;
    nodes.addLast(doctype);
    decisions.addLast(new Short(LSParserFilter.FILTER_ACCEPT));
  }

  public void endDTD()
    throws SAXException
  {
    if (interrupted)
      {
        return;
      }
    Node doctype = (Node) nodes.removeLast();
    decisions.removeLast();
    inDTD = false;
    ctx = doc;
    short decision = getDecision(doctype, false);
    switch (decision)
      {
      case LSParserFilter.FILTER_ACCEPT:
        ctx.appendChild(doctype);
        break;
      case LSParserFilter.FILTER_INTERRUPT:
        interrupted = true;
        break;
      }
  }

  public void comment(char[] c, int off, int len)
    throws SAXException
  {
    if (rejecting || interrupted || inDTD)
      {
        return;
      }
    Node comment = createComment(c, off, len);
    short decision = getDecision(comment, false);
    switch (decision)
      {
      case LSParserFilter.FILTER_ACCEPT:
        ctx.appendChild(comment);
        break;
      case LSParserFilter.FILTER_INTERRUPT:
        interrupted = true;
        break;
      }
  }

  // TODO declarations

  short getDecision(Node node, boolean start)
  {
    boolean show = (whatToShow == NodeFilter.SHOW_ALL);
    if (!show)
      {
        switch (node.getNodeType())
          {
          case Node.ATTRIBUTE_NODE:
            show = ((whatToShow & NodeFilter.SHOW_ATTRIBUTE) != 0);
            break;     
          case Node.TEXT_NODE:
            show = ((whatToShow & NodeFilter.SHOW_TEXT) != 0);
            break;     
          case Node.CDATA_SECTION_NODE:
            show = ((whatToShow & NodeFilter.SHOW_CDATA_SECTION) != 0);
            break;     
          case Node.ELEMENT_NODE:
            show = ((whatToShow & NodeFilter.SHOW_ELEMENT) != 0);
            break;     
          case Node.COMMENT_NODE:
            show = ((whatToShow & NodeFilter.SHOW_COMMENT) != 0);
            break;     
          case Node.DOCUMENT_NODE:
            show = ((whatToShow & NodeFilter.SHOW_DOCUMENT) != 0);
            break;     
          case Node.PROCESSING_INSTRUCTION_NODE:
            show = ((whatToShow & NodeFilter.SHOW_PROCESSING_INSTRUCTION) != 0);
            break;     
          case Node.DOCUMENT_FRAGMENT_NODE:
            show = ((whatToShow & NodeFilter.SHOW_DOCUMENT_FRAGMENT) != 0);
            break;     
          case Node.DOCUMENT_TYPE_NODE:
            show = ((whatToShow & NodeFilter.SHOW_DOCUMENT_TYPE) != 0);
            break;     
          case Node.ENTITY_REFERENCE_NODE:
            show = ((whatToShow & NodeFilter.SHOW_ENTITY_REFERENCE) != 0);
            break;     
          case Node.ENTITY_NODE:
            show = ((whatToShow & NodeFilter.SHOW_ENTITY) != 0);
            break;     
          case Node.NOTATION_NODE:
            show = ((whatToShow & NodeFilter.SHOW_NOTATION) != 0);
            break;     
          }
      }
    if (!show)
      {
        return LSParserFilter.FILTER_ACCEPT;
      }
    if (start)
      {
        return filter.startElement((Element) node);
      }
    return filter.acceptNode(node);
  }

}