/* * Copyright 2008-2009 Sun Microsystems, Inc. All Rights Reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 only, as * published by the Free Software Foundation. Sun designates this * particular file as subject to the "Classpath" exception as provided * by Sun in the LICENSE file that accompanied this code. * * This code 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 * version 2 for more details (a copy is included in the LICENSE file that * accompanied this code). * * You should have received a copy of the GNU General Public License version * 2 along with this work; if not, write to the Free Software Foundation, * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. * * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, * CA 95054 USA or visit www.sun.com if you need additional information or * have any questions. */ package sun.nio.fs; import java.net.URI; import java.net.URISyntaxException; /** * Unix specific Path <--> URI conversion */ class UnixUriUtils { private UnixUriUtils() { } /** * Converts URI to Path */ static UnixPath fromUri(UnixFileSystem fs, URI uri) { if (!uri.isAbsolute()) throw new IllegalArgumentException("URI is not absolute"); if (uri.isOpaque()) throw new IllegalArgumentException("URI is not hierarchical"); String scheme = uri.getScheme(); if ((scheme == null) || !scheme.equalsIgnoreCase("file")) throw new IllegalArgumentException("URI scheme is not \"file\""); if (uri.getAuthority() != null) throw new IllegalArgumentException("URI has an authority component"); if (uri.getFragment() != null) throw new IllegalArgumentException("URI has a fragment component"); if (uri.getQuery() != null) throw new IllegalArgumentException("URI has a query component"); String path = uri.getPath(); if (path.equals("")) throw new IllegalArgumentException("URI path component is empty"); if (path.endsWith("/") && (path.length() > 1)) { // "/foo/" --> "/foo", but "/" --> "/" path = path.substring(0, path.length() - 1); } // preserve bytes byte[] result = new byte[path.length()]; for (int i=0; i> 4) & 0x0f]); sb.append(hexDigits[(c >> 0) & 0x0f]); } } // trailing slash if directory if (sb.charAt(sb.length()-1) != '/') { try { if (UnixFileAttributes.get(up, true).isDirectory()) sb.append('/'); } catch (UnixException x) { // ignore } } try { return new URI(sb.toString()); } catch (URISyntaxException x) { throw new AssertionError(x); // should not happen } } // The following is copied from java.net.URI // Compute the low-order mask for the characters in the given string private static long lowMask(String chars) { int n = chars.length(); long m = 0; for (int i = 0; i < n; i++) { char c = chars.charAt(i); if (c < 64) m |= (1L << c); } return m; } // Compute the high-order mask for the characters in the given string private static long highMask(String chars) { int n = chars.length(); long m = 0; for (int i = 0; i < n; i++) { char c = chars.charAt(i); if ((c >= 64) && (c < 128)) m |= (1L << (c - 64)); } return m; } // Compute a low-order mask for the characters // between first and last, inclusive private static long lowMask(char first, char last) { long m = 0; int f = Math.max(Math.min(first, 63), 0); int l = Math.max(Math.min(last, 63), 0); for (int i = f; i <= l; i++) m |= 1L << i; return m; } // Compute a high-order mask for the characters // between first and last, inclusive private static long highMask(char first, char last) { long m = 0; int f = Math.max(Math.min(first, 127), 64) - 64; int l = Math.max(Math.min(last, 127), 64) - 64; for (int i = f; i <= l; i++) m |= 1L << i; return m; } // Tell whether the given character is permitted by the given mask pair private static boolean match(char c, long lowMask, long highMask) { if (c < 64) return ((1L << c) & lowMask) != 0; if (c < 128) return ((1L << (c - 64)) & highMask) != 0; return false; } // digit = "0" | "1" | "2" | "3" | "4" | "5" | "6" | "7" | // "8" | "9" private static final long L_DIGIT = lowMask('0', '9'); private static final long H_DIGIT = 0L; // upalpha = "A" | "B" | "C" | "D" | "E" | "F" | "G" | "H" | "I" | // "J" | "K" | "L" | "M" | "N" | "O" | "P" | "Q" | "R" | // "S" | "T" | "U" | "V" | "W" | "X" | "Y" | "Z" private static final long L_UPALPHA = 0L; private static final long H_UPALPHA = highMask('A', 'Z'); // lowalpha = "a" | "b" | "c" | "d" | "e" | "f" | "g" | "h" | "i" | // "j" | "k" | "l" | "m" | "n" | "o" | "p" | "q" | "r" | // "s" | "t" | "u" | "v" | "w" | "x" | "y" | "z" private static final long L_LOWALPHA = 0L; private static final long H_LOWALPHA = highMask('a', 'z'); // alpha = lowalpha | upalpha private static final long L_ALPHA = L_LOWALPHA | L_UPALPHA; private static final long H_ALPHA = H_LOWALPHA | H_UPALPHA; // alphanum = alpha | digit private static final long L_ALPHANUM = L_DIGIT | L_ALPHA; private static final long H_ALPHANUM = H_DIGIT | H_ALPHA; // mark = "-" | "_" | "." | "!" | "~" | "*" | "'" | // "(" | ")" private static final long L_MARK = lowMask("-_.!~*'()"); private static final long H_MARK = highMask("-_.!~*'()"); // unreserved = alphanum | mark private static final long L_UNRESERVED = L_ALPHANUM | L_MARK; private static final long H_UNRESERVED = H_ALPHANUM | H_MARK; // pchar = unreserved | escaped | // ":" | "@" | "&" | "=" | "+" | "$" | "," private static final long L_PCHAR = L_UNRESERVED | lowMask(":@&=+$,"); private static final long H_PCHAR = H_UNRESERVED | highMask(":@&=+$,"); // All valid path characters private static final long L_PATH = L_PCHAR | lowMask(";/"); private static final long H_PATH = H_PCHAR | highMask(";/"); private final static char[] hexDigits = { '0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F' }; }