kitaev@213: /* kitaev@213: * Copyright (c) 2011 TMate Software Ltd kitaev@213: * kitaev@213: * This program is free software; you can redistribute it and/or modify kitaev@213: * it under the terms of the GNU General Public License as published by kitaev@213: * the Free Software Foundation; version 2 of the License. kitaev@213: * kitaev@213: * This program is distributed in the hope that it will be useful, kitaev@213: * but WITHOUT ANY WARRANTY; without even the implied warranty of kitaev@213: * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the kitaev@213: * GNU General Public License for more details. kitaev@213: * kitaev@213: * For information on how to redistribute this software under kitaev@213: * the terms of a license other than GNU General Public License kitaev@213: * contact TMate Software at support@hg4j.com kitaev@213: */ kitaev@213: package org.tmatesoft.hg.internal; kitaev@213: kitaev@213: import static org.tmatesoft.hg.internal.Filter.Direction.FromRepo; kitaev@213: import static org.tmatesoft.hg.internal.Filter.Direction.ToRepo; kitaev@213: import static org.tmatesoft.hg.internal.KeywordFilter.copySlice; kitaev@213: kitaev@213: import java.io.File; kitaev@213: import java.io.FileInputStream; kitaev@213: import java.io.FileOutputStream; kitaev@213: import java.nio.ByteBuffer; kitaev@213: import java.util.ArrayList; kitaev@213: import java.util.Map; kitaev@213: kitaev@213: import org.tmatesoft.hg.repo.HgInternals; kitaev@213: import org.tmatesoft.hg.repo.HgRepository; kitaev@213: import org.tmatesoft.hg.util.Path; kitaev@213: kitaev@213: /** kitaev@213: * kitaev@213: * @author Artem Tikhomirov kitaev@213: * @author TMate Software Ltd. kitaev@213: */ kitaev@213: public class NewlineFilter implements Filter { kitaev@213: kitaev@213: // if allowInconsistent is true, filter simply pass incorrect newline characters (single \r or \r\n on *nix and single \n on Windows) as is, kitaev@213: // i.e. doesn't try to convert them into appropriate newline characters. XXX revisit if Keyword extension behaves differently kitaev@213: private final boolean allowInconsistent; kitaev@213: private final boolean winToNix; kitaev@213: kitaev@213: private NewlineFilter(boolean failIfInconsistent, int transform) { kitaev@213: winToNix = transform == 0; kitaev@213: allowInconsistent = !failIfInconsistent; kitaev@213: } kitaev@213: kitaev@213: public ByteBuffer filter(ByteBuffer src) { kitaev@213: if (winToNix) { kitaev@213: return win2nix(src); kitaev@213: } else { kitaev@213: return nix2win(src); kitaev@213: } kitaev@213: } kitaev@213: kitaev@213: private ByteBuffer win2nix(ByteBuffer src) { kitaev@213: int x = src.position(); // source index kitaev@213: int lookupStart = x; kitaev@213: ByteBuffer dst = null; kitaev@213: while (x < src.limit()) { kitaev@213: // x, lookupStart, ir and in are absolute positions within src buffer, which is never read with modifying operations kitaev@213: int ir = indexOf('\r', src, lookupStart); kitaev@213: int in = indexOf('\n', src, lookupStart); kitaev@213: if (ir == -1) { kitaev@213: if (in == -1 || allowInconsistent) { kitaev@213: if (dst != null) { kitaev@213: copySlice(src, x, src.limit(), dst); kitaev@213: x = src.limit(); // consumed all kitaev@213: } kitaev@213: break; kitaev@213: } else { kitaev@213: fail(src, in); kitaev@213: } kitaev@213: } kitaev@213: // in == -1 while ir != -1 may be valid case if ir is the last char of the buffer, we check below for that kitaev@213: if (in != -1 && in != ir+1 && !allowInconsistent) { kitaev@213: fail(src, in); kitaev@213: } kitaev@213: if (dst == null) { kitaev@213: dst = ByteBuffer.allocate(src.remaining()); kitaev@213: } kitaev@213: copySlice(src, x, ir, dst); kitaev@213: if (ir+1 == src.limit()) { kitaev@213: // last char of the buffer - kitaev@213: // consume src till that char and let next iteration work on it kitaev@213: x = ir; kitaev@213: break; kitaev@213: } kitaev@213: if (in != ir + 1) { kitaev@213: x = ir+1; // generally in, but if allowInconsistent==true and \r is not followed by \n, then kitaev@213: // cases like "one \r two \r\n three" shall be processed correctly (second pair would be ignored if x==in) kitaev@213: lookupStart = ir+1; kitaev@213: } else { kitaev@213: x = in; kitaev@213: lookupStart = x+1; // skip \n for next lookup kitaev@213: } kitaev@213: } kitaev@213: src.position(x); // mark we've consumed up to x kitaev@213: return dst == null ? src : (ByteBuffer) dst.flip(); kitaev@213: } kitaev@213: kitaev@213: private ByteBuffer nix2win(ByteBuffer src) { kitaev@213: int x = src.position(); kitaev@213: ByteBuffer dst = null; kitaev@213: while (x < src.limit()) { kitaev@213: int in = indexOf('\n', src, x); kitaev@213: int ir = indexOf('\r', src, x, in == -1 ? src.limit() : in); kitaev@213: if (in == -1) { kitaev@213: if (ir == -1 || allowInconsistent) { kitaev@213: break; kitaev@213: } else { kitaev@213: fail(src, ir); kitaev@213: } kitaev@213: } else if (ir != -1 && !allowInconsistent) { kitaev@213: fail(src, ir); kitaev@213: } kitaev@213: kitaev@213: // x <= in < src.limit kitaev@213: // allowInconsistent && x <= ir < in || ir == -1 kitaev@213: if (dst == null) { kitaev@213: // buffer full of \n grows as much as twice in size kitaev@213: dst = ByteBuffer.allocate(src.remaining() * 2); kitaev@213: } kitaev@213: copySlice(src, x, in, dst); kitaev@213: if (ir == -1 || ir+1 != in) { kitaev@213: dst.put((byte) '\r'); kitaev@213: } // otherwise (ir!=-1 && ir+1==in) we found \r\n pair, don't convert to \r\r\n kitaev@213: // we may copy \n at src[in] on the next iteration, but would need extra lookupIndex variable then. kitaev@213: dst.put((byte) '\n'); kitaev@213: x = in+1; kitaev@213: } kitaev@213: src.position(x); kitaev@213: return dst == null ? src : (ByteBuffer) dst.flip(); kitaev@213: } kitaev@213: kitaev@213: kitaev@213: private void fail(ByteBuffer b, int pos) { kitaev@213: throw new RuntimeException(String.format("Inconsistent newline characters in the stream (char 0x%x, local index:%d)", b.get(pos), pos)); kitaev@213: } kitaev@213: kitaev@213: private static int indexOf(char ch, ByteBuffer b, int from) { kitaev@213: return indexOf(ch, b, from, b.limit()); kitaev@213: } kitaev@213: kitaev@213: // looks up in buf[from..to) kitaev@213: private static int indexOf(char ch, ByteBuffer b, int from, int to) { kitaev@213: for (int i = from; i < to; i++) { kitaev@213: byte c = b.get(i); kitaev@213: if (ch == c) { kitaev@213: return i; kitaev@213: } kitaev@213: } kitaev@213: return -1; kitaev@213: } kitaev@213: kitaev@213: public static class Factory implements Filter.Factory { kitaev@213: private boolean failIfInconsistent = true; kitaev@213: private Path.Matcher lfMatcher; kitaev@213: private Path.Matcher crlfMatcher; kitaev@213: private Path.Matcher binMatcher; kitaev@213: private Path.Matcher nativeMatcher; kitaev@213: private String nativeRepoFormat; kitaev@213: private String nativeOSFormat; kitaev@213: kitaev@213: public void initialize(HgRepository hgRepo, ConfigFile cfg) { kitaev@213: failIfInconsistent = cfg.getBoolean("eol", "only-consistent", true); kitaev@213: File cfgFile = new File(new HgInternals(hgRepo).getRepositoryDir().getParentFile(), ".hgeol"); kitaev@213: if (!cfgFile.canRead()) { kitaev@213: return; kitaev@213: } kitaev@213: // XXX if .hgeol is not checked out, we may get it from repository kitaev@213: // HgDataFile cfgFileNode = hgRepo.getFileNode(".hgeol"); kitaev@213: // if (!cfgFileNode.exists()) { kitaev@213: // return; kitaev@213: // } kitaev@213: // XXX perhaps, add HgDataFile.hasWorkingCopy and workingCopyContent()? kitaev@213: ConfigFile hgeol = new ConfigFile(); kitaev@213: hgeol.addLocation(cfgFile); kitaev@213: nativeRepoFormat = hgeol.getSection("repository").get("native"); kitaev@213: if (nativeRepoFormat == null) { kitaev@213: nativeRepoFormat = "LF"; kitaev@213: } kitaev@213: final String os = System.getProperty("os.name"); // XXX need centralized set of properties kitaev@213: nativeOSFormat = os.indexOf("Windows") != -1 ? "CRLF" : "LF"; kitaev@213: // I assume pattern ordering in .hgeol is not important kitaev@213: ArrayList lfPatterns = new ArrayList(); kitaev@213: ArrayList crlfPatterns = new ArrayList(); kitaev@213: ArrayList nativePatterns = new ArrayList(); kitaev@213: ArrayList binPatterns = new ArrayList(); kitaev@213: for (Map.Entry e : hgeol.getSection("patterns").entrySet()) { kitaev@213: if ("CRLF".equals(e.getValue())) { kitaev@213: crlfPatterns.add(e.getKey()); kitaev@213: } else if ("LF".equals(e.getValue())) { kitaev@213: lfPatterns.add(e.getKey()); kitaev@213: } else if ("native".equals(e.getValue())) { kitaev@213: nativePatterns.add(e.getKey()); kitaev@213: } else if ("BIN".equals(e.getValue())) { kitaev@213: binPatterns.add(e.getKey()); kitaev@213: } else { kitaev@213: System.out.printf("Can't recognize .hgeol entry: %s for %s", e.getValue(), e.getKey()); // FIXME log warning kitaev@213: } kitaev@213: } kitaev@213: if (!crlfPatterns.isEmpty()) { kitaev@213: crlfMatcher = new PathGlobMatcher(crlfPatterns.toArray(new String[crlfPatterns.size()])); kitaev@213: } kitaev@213: if (!lfPatterns.isEmpty()) { kitaev@213: lfMatcher = new PathGlobMatcher(lfPatterns.toArray(new String[lfPatterns.size()])); kitaev@213: } kitaev@213: if (!binPatterns.isEmpty()) { kitaev@213: binMatcher = new PathGlobMatcher(binPatterns.toArray(new String[binPatterns.size()])); kitaev@213: } kitaev@213: if (!nativePatterns.isEmpty()) { kitaev@213: nativeMatcher = new PathGlobMatcher(nativePatterns.toArray(new String[nativePatterns.size()])); kitaev@213: } kitaev@213: } kitaev@213: kitaev@213: public Filter create(Path path, Options opts) { kitaev@213: if (binMatcher == null && crlfMatcher == null && lfMatcher == null && nativeMatcher == null) { kitaev@213: // not initialized - perhaps, no .hgeol found kitaev@213: return null; kitaev@213: } kitaev@213: if (binMatcher != null && binMatcher.accept(path)) { kitaev@213: return null; kitaev@213: } kitaev@213: if (crlfMatcher != null && crlfMatcher.accept(path)) { kitaev@213: return new NewlineFilter(failIfInconsistent, 1); kitaev@213: } else if (lfMatcher != null && lfMatcher.accept(path)) { kitaev@213: return new NewlineFilter(failIfInconsistent, 0); kitaev@213: } else if (nativeMatcher != null && nativeMatcher.accept(path)) { kitaev@213: if (nativeOSFormat.equals(nativeRepoFormat)) { kitaev@213: return null; kitaev@213: } kitaev@213: if (opts.getDirection() == FromRepo) { kitaev@213: int transform = "CRLF".equals(nativeOSFormat) ? 1 : 0; kitaev@213: return new NewlineFilter(failIfInconsistent, transform); kitaev@213: } else if (opts.getDirection() == ToRepo) { kitaev@213: int transform = "CRLF".equals(nativeOSFormat) ? 0 : 1; kitaev@213: return new NewlineFilter(failIfInconsistent, transform); kitaev@213: } kitaev@213: return null; kitaev@213: } kitaev@213: return null; kitaev@213: } kitaev@213: } kitaev@213: kitaev@213: public static void main(String[] args) throws Exception { kitaev@213: FileInputStream fis = new FileInputStream(new File("/temp/design.lf.txt")); kitaev@213: FileOutputStream fos = new FileOutputStream(new File("/temp/design.newline.out")); kitaev@213: ByteBuffer b = ByteBuffer.allocate(12); kitaev@213: NewlineFilter nlFilter = new NewlineFilter(true, 1); kitaev@213: while (fis.getChannel().read(b) != -1) { kitaev@213: b.flip(); // get ready to be read kitaev@213: ByteBuffer f = nlFilter.filter(b); kitaev@213: fos.getChannel().write(f); // XXX in fact, f may not be fully consumed kitaev@213: if (b.hasRemaining()) { kitaev@213: b.compact(); kitaev@213: } else { kitaev@213: b.clear(); kitaev@213: } kitaev@213: } kitaev@213: fis.close(); kitaev@213: fos.flush(); kitaev@213: fos.close(); kitaev@213: } kitaev@213: kitaev@213: }