/*1* Copyright (c) 2006 Kungliga Tekniska Högskolan2* (Royal Institute of Technology, Stockholm, Sweden).3* All rights reserved.4*5* Redistribution and use in source and binary forms, with or without6* modification, are permitted provided that the following conditions7* are met:8*9* 1. Redistributions of source code must retain the above copyright10* notice, this list of conditions and the following disclaimer.11*12* 2. Redistributions in binary form must reproduce the above copyright13* notice, this list of conditions and the following disclaimer in the14* documentation and/or other materials provided with the distribution.15*16* 3. Neither the name of KTH nor the names of its contributors may be17* used to endorse or promote products derived from this software without18* specific prior written permission.19*20* THIS SOFTWARE IS PROVIDED BY KTH AND ITS CONTRIBUTORS ``AS IS'' AND ANY21* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE22* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR23* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL KTH OR ITS CONTRIBUTORS BE24* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR25* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF26* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR27* BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,28* WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR29* OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF30* ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */3132#include "sl_locl.h"3334struct {35int ok;36const char *line;37int argc;38const char *argv[4];39} lines[] = {40{ 1, "", 1, { "" } },41{ 1, "foo", 1, { "foo" } },42{ 1, "foo bar", 2, { "foo", "bar" }},43{ 1, "foo bar baz", 3, { "foo", "bar", "baz" }},44{ 1, "foobar baz", 2, { "foobar", "baz" }},45{ 1, " foo", 1, { "foo" } },46{ 1, "foo ", 1, { "foo" } },47{ 1, " foo ", 1, { "foo" } },48{ 1, " foo bar", 2, { "foo", "bar" } },49{ 1, "foo\\ bar", 1, { "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, "\"\"f\"\"oo\"\"", 1, { "foo" } },54{ 1, "\"foobar\"baz", 1, { "foobarbaz" }},55{ 1, "foo\tbar baz", 3, { "foo", "bar", "baz" }},56{ 1, "\"foo bar\" baz", 2, { "foo bar", "baz" }},57{ 1, "\"foo bar baz\"", 1, { "foo bar baz" }},58{ 1, "\\\"foo bar baz", 3, { "\"foo", "bar", "baz" }},59{ 1, "\\ foo bar baz", 3, { " foo", "bar", "baz" }},60{ 0, "\\", 0, { "" }},61{ 0, "\"", 0, { "" }}62};6364int65main(int argc, char **argv)66{67int ret, i;6869for (i = 0; i < sizeof(lines)/sizeof(lines[0]); i++) {70int j, rargc = 0;71char **rargv = NULL;72char *buf = strdup(lines[i].line);7374ret = sl_make_argv(buf, &rargc, &rargv);75if (ret) {76if (!lines[i].ok)77goto next;78errx(1, "sl_make_argv test %d failed", i);79} else if (!lines[i].ok)80errx(1, "sl_make_argv passed test %d when it shouldn't", i);81if (rargc != lines[i].argc)82errx(1, "result argc (%d) != should be argc (%d) for test %d",83rargc, lines[i].argc, i);84for (j = 0; j < rargc; j++)85if (strcmp(rargv[j], lines[i].argv[j]) != 0)86errx(1, "result argv (%s) != should be argv (%s) for test %d",87rargv[j], lines[i].argv[j], i);88next:89free(buf);90free(rargv);91}9293return 0;94}959697