| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2011 Google Inc. All rights reserved. | 2 * Copyright (C) 2011 Google Inc. All rights reserved. |
| 3 * | 3 * |
| 4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
| 5 * modification, are permitted provided that the following conditions | 5 * modification, are permitted provided that the following conditions |
| 6 * are met: | 6 * are met: |
| 7 * | 7 * |
| 8 * 1. Redistributions of source code must retain the above copyright | 8 * 1. Redistributions of source code must retain the above copyright |
| 9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
| 10 * 2. Redistributions in binary form must reproduce the above copyright | 10 * 2. Redistributions in binary form must reproduce the above copyright |
| (...skipping 10 matching lines...) Expand all Loading... |
| 21 * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES | 21 * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
| 22 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; | 22 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; |
| 23 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND | 23 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND |
| 24 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 24 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF | 25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
| 26 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 26 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 27 */ | 27 */ |
| 28 | 28 |
| 29 #include "config.h" | 29 #include "config.h" |
| 30 | 30 |
| 31 #include "FileException.h" | 31 #include "core/fileapi/FileException.h" |
| 32 | 32 |
| 33 namespace WebCore { | 33 namespace WebCore { |
| 34 | 34 |
| 35 static struct FileExceptionNameDescription { | 35 static struct FileExceptionNameDescription { |
| 36 const char* const name; | 36 const char* const name; |
| 37 const char* const description; | 37 const char* const description; |
| 38 } fileExceptions[] = { | 38 } fileExceptions[] = { |
| 39 { "NOT_FOUND_ERR", "A requested file or directory could not be found at the
time an operation was processed." }, | 39 { "NOT_FOUND_ERR", "A requested file or directory could not be found at the
time an operation was processed." }, |
| 40 { "SECURITY_ERR", "It was determined that certain files are unsafe for acces
s within a Web application, or that too many calls are being made on file resour
ces." }, | 40 { "SECURITY_ERR", "It was determined that certain files are unsafe for acces
s within a Web application, or that too many calls are being made on file resour
ces." }, |
| 41 { "ABORT_ERR", "An ongoing operation was aborted, typically with a call to a
bort()." }, | 41 { "ABORT_ERR", "An ongoing operation was aborted, typically with a call to a
bort()." }, |
| (...skipping 20 matching lines...) Expand all Loading... |
| 62 size_t tableSize = WTF_ARRAY_LENGTH(fileExceptions); | 62 size_t tableSize = WTF_ARRAY_LENGTH(fileExceptions); |
| 63 size_t tableIndex = ec - NOT_FOUND_ERR; | 63 size_t tableIndex = ec - NOT_FOUND_ERR; |
| 64 | 64 |
| 65 description->name = tableIndex < tableSize ? fileExceptions[tableIndex].name
: 0; | 65 description->name = tableIndex < tableSize ? fileExceptions[tableIndex].name
: 0; |
| 66 description->description = tableIndex < tableSize ? fileExceptions[tableInde
x].description : 0; | 66 description->description = tableIndex < tableSize ? fileExceptions[tableInde
x].description : 0; |
| 67 | 67 |
| 68 return true; | 68 return true; |
| 69 } | 69 } |
| 70 | 70 |
| 71 } // namespace WebCore | 71 } // namespace WebCore |
| OLD | NEW |