1 /* 2 * Copyright (c) 1997, 2012, Oracle and/or its affiliates. All rights reserved. 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 4 * 5 * This code is free software; you can redistribute it and/or modify it 6 * under the terms of the GNU General Public License version 2 only, as 7 * published by the Free Software Foundation. Oracle designates this 8 * particular file as subject to the "Classpath" exception as provided 9 * by Oracle in the LICENSE file that accompanied this code. 10 * 11 * This code is distributed in the hope that it will be useful, but WITHOUT 12 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 13 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 14 * version 2 for more details (a copy is included in the LICENSE file that 15 * accompanied this code). 16 * 17 * You should have received a copy of the GNU General Public License version 18 * 2 along with this work; if not, write to the Free Software Foundation, 19 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 20 * 21 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 22 * or visit www.oracle.com if you need additional information or have any 23 * questions. 24 */ 25 26 package com.sun.xml.internal.bind.marshaller; 27 28 import java.io.IOException; 29 import java.io.Writer; 30 31 /** 32 * Performs no character escaping. Usable only when the output encoding 33 * is UTF, but this handler gives the maximum performance. 34 * 35 * @author 36 * Kohsuke Kawaguchi (kohsuke.kawaguchi@sun.com) 37 */ 38 public class MinimumEscapeHandler implements CharacterEscapeHandler { 39 40 private MinimumEscapeHandler() {} // no instanciation please 41 42 public static final CharacterEscapeHandler theInstance = new MinimumEscapeHandler(); 43 44 public void escape(char[] ch, int start, int length, boolean isAttVal, Writer out) throws IOException { 45 // avoid calling the Writerwrite method too much by assuming 46 // that the escaping occurs rarely. 47 // profiling revealed that this is faster than the naive code. 48 int limit = start+length; 49 for (int i = start; i < limit; i++) { 50 char c = ch[i]; 51 if(c == '&' || c == '<' || c == '>' || c == '\r' || (c == '\"' && isAttVal) ) { 52 if(i!=start) 53 out.write(ch,start,i-start); 54 start = i+1; 55 switch (ch[i]) { 56 case '&': 57 out.write("&"); 58 break; 59 case '<': 60 out.write("<"); 61 break; 62 case '>': 63 out.write(">"); 64 break; 65 case '\"': 66 out.write("""); 67 break; 68 } 69 } 70 } 71 72 if( start!=limit ) 73 out.write(ch,start,limit-start); 74 } 75 76 }