| 1 |
/* |
| 2 |
* Copyright (c) 2006 Kungliga Tekniska Högskolan |
| 3 |
* (Royal Institute of Technology, Stockholm, Sweden). |
| 4 |
* All rights reserved. |
| 5 |
* |
| 6 |
* Redistribution and use in source and binary forms, with or without |
| 7 |
* modification, are permitted provided that the following conditions |
| 8 |
* are met: |
| 9 |
* |
| 10 |
* 1. Redistributions of source code must retain the above copyright |
| 11 |
* notice, this list of conditions and the following disclaimer. |
| 12 |
* |
| 13 |
* 2. Redistributions in binary form must reproduce the above copyright |
| 14 |
* notice, this list of conditions and the following disclaimer in the |
| 15 |
* documentation and/or other materials provided with the distribution. |
| 16 |
* |
| 17 |
* 3. Neither the name of KTH nor the names of its contributors may be |
| 18 |
* used to endorse or promote products derived from this software without |
| 19 |
* specific prior written permission. |
| 20 |
* |
| 21 |
* THIS SOFTWARE IS PROVIDED BY KTH AND ITS CONTRIBUTORS ``AS IS'' AND ANY |
| 22 |
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 23 |
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
| 24 |
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL KTH OR ITS CONTRIBUTORS BE |
| 25 |
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
| 26 |
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
| 27 |
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR |
| 28 |
* BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, |
| 29 |
* WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR |
| 30 |
* OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF |
| 31 |
* ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ |
| 32 |
|
| 33 |
#include "sl_locl.h" |
| 34 |
|
| 35 |
struct { |
| 36 |
int ok; |
| 37 |
const char *line; |
| 38 |
int argc; |
| 39 |
const char *argv[4]; |
| 40 |
} lines[] = { |
| 41 |
{ 1, "", 1, { "" } }, |
| 42 |
{ 1, "foo", 1, { "foo" } }, |
| 43 |
{ 1, "foo bar", 2, { "foo", "bar" }}, |
| 44 |
{ 1, "foo bar baz", 3, { "foo", "bar", "baz" }}, |
| 45 |
{ 1, "foobar baz", 2, { "foobar", "baz" }}, |
| 46 |
{ 1, " foo", 1, { "foo" } }, |
| 47 |
{ 1, "foo ", 1, { "foo" } }, |
| 48 |
{ 1, " foo ", 1, { "foo" } }, |
| 49 |
{ 1, " foo bar", 2, { "foo", "bar" } }, |
| 50 |
{ 1, "foo\\ bar", 1, { "foo bar" } }, |
| 51 |
{ 1, "\"foo bar\"", 1, { "foo bar" } }, |
| 52 |
{ 1, "\"foo\\ bar\"", 1, { "foo bar" } }, |
| 53 |
{ 1, "\"foo\\\" bar\"", 1, { "foo\" bar" } }, |
| 54 |
{ 1, "\"\"f\"\"oo\"\"", 1, { "foo" } }, |
| 55 |
{ 1, "\"foobar\"baz", 1, { "foobarbaz" }}, |
| 56 |
{ 1, "foo\tbar baz", 3, { "foo", "bar", "baz" }}, |
| 57 |
{ 1, "\"foo bar\" baz", 2, { "foo bar", "baz" }}, |
| 58 |
{ 1, "\"foo bar baz\"", 1, { "foo bar baz" }}, |
| 59 |
{ 1, "\\\"foo bar baz", 3, { "\"foo", "bar", "baz" }}, |
| 60 |
{ 1, "\\ foo bar baz", 3, { " foo", "bar", "baz" }}, |
| 61 |
{ 0, "\\", 0, { "" }}, |
| 62 |
{ 0, "\"", 0, { "" }} |
| 63 |
}; |
| 64 |
|
| 65 |
int |
| 66 |
main(int argc, char **argv) |
| 67 |
{ |
| 68 |
int ret, i; |
| 69 |
|
| 70 |
for (i = 0; i < sizeof(lines)/sizeof(lines[0]); i++) { |
| 71 |
int j, rargc = 0; |
| 72 |
char **rargv = NULL; |
| 73 |
char *buf = strdup(lines[i].line); |
| 74 |
|
| 75 |
ret = sl_make_argv(buf, &rargc, &rargv); |
| 76 |
if (ret) { |
| 77 |
if (!lines[i].ok) |
| 78 |
goto next; |
| 79 |
errx(1, "sl_make_argv test %d failed", i); |
| 80 |
} else if (!lines[i].ok) |
| 81 |
errx(1, "sl_make_argv passed test %d when it shouldn't", i); |
| 82 |
if (rargc != lines[i].argc) |
| 83 |
errx(1, "result argc (%d) != should be argc (%d) for test %d", |
| 84 |
rargc, lines[i].argc, i); |
| 85 |
for (j = 0; j < rargc; j++) |
| 86 |
if (strcmp(rargv[j], lines[i].argv[j]) != 0) |
| 87 |
errx(1, "result argv (%s) != should be argv (%s) for test %d", |
| 88 |
rargv[j], lines[i].argv[j], i); |
| 89 |
next: |
| 90 |
free(buf); |
| 91 |
free(rargv); |
| 92 |
} |
| 93 |
|
| 94 |
return 0; |
| 95 |
} |