Changeset 6a44ee4 in mainline for uspace/app/bdsh/exec.c


Ignore:
Timestamp:
2011-07-20T15:26:21Z (13 years ago)
Author:
Jakub Jermar <jakub@…>
Branches:
lfn, master, serial, ticket/834-toolchain-update, topic/msim-upgrade, topic/simplify-dev-export
Children:
efcebe1
Parents:
25bef0ff (diff), a701812 (diff)
Note: this is a merge changeset, the changes displayed below correspond to the merge itself.
Use the (diff) links above to see all the changes relative to each parent.
Message:

Merge mainline changes.

File:
1 edited

Legend:

Unmodified
Added
Removed
  • uspace/app/bdsh/exec.c

    r25bef0ff r6a44ee4  
    1 /* Copyright (c) 2008, Tim Post <tinkertim@gmail.com>
     1/*
     2 * Copyright (c) 2008 Tim Post
    23 * All rights reserved.
    34 *
    45 * Redistribution and use in source and binary forms, with or without
    5  * modification, are permitted provided that the following conditions are met:
     6 * modification, are permitted provided that the following conditions
     7 * are met:
    68 *
    7  * Redistributions of source code must retain the above copyright notice, this
    8  * list of conditions and the following disclaimer.
     9 * - Redistributions of source code must retain the above copyright
     10 *   notice, this list of conditions and the following disclaimer.
     11 * - Redistributions in binary form must reproduce the above copyright
     12 *   notice, this list of conditions and the following disclaimer in the
     13 *   documentation and/or other materials provided with the distribution.
     14 * - The name of the author may not be used to endorse or promote products
     15 *   derived from this software without specific prior written permission.
    916 *
    10  * Redistributions in binary form must reproduce the above copyright notice,
    11  * this list of conditions and the following disclaimer in the documentation
    12  * and/or other materials provided with the distribution.
    13  *
    14  * Neither the name of the original program's authors nor the names of its
    15  * contributors may be used to endorse or promote products derived from this
    16  * software without specific prior written permission.
    17  *
    18  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
    19  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
    20  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
    21  * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
    22  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
    23  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
    24  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
    25  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
    26  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
    27  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
    28  * POSSIBILITY OF SUCH DAMAGE.
     17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
     18 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
     19 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
     20 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
     21 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
     22 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
     23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
     24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
     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.
    2927 */
    3028
     
    5452static int try_access(const char *);
    5553
     54const char *search_dir[] = { "app", "srv", NULL };
     55
    5656/* work-around for access() */
    5757static int try_access(const char *f)
     
    7171static char *find_command(char *cmd)
    7272{
    73         char *path_tok;
    74         char *path[PATH_MAX];
    75         int n = 0, i = 0;
    76         size_t x = str_size(cmd) + 2;
     73        size_t i;
    7774
    7875        found = (char *)malloc(PATH_MAX);
     
    8380        }
    8481
    85         path_tok = str_dup(PATH);
    86 
    87         /* Extract the PATH env to a path[] array */
    88         path[n] = strtok(path_tok, PATH_DELIM);
    89         while (NULL != path[n]) {
    90                 if ((str_size(path[n]) + x ) > PATH_MAX) {
    91                         cli_error(CL_ENOTSUP,
    92                                 "Segment %d of path is too large, search ends at segment %d",
    93                                 n, n-1);
    94                         break;
    95                 }
    96                 path[++n] = strtok(NULL, PATH_DELIM);
    97         }
    98 
    9982        /* We now have n places to look for the command */
    100         for (i=0; path[i]; i++) {
     83        for (i = 0; search_dir[i] != NULL; i++) {
    10184                memset(found, 0, sizeof(found));
    102                 snprintf(found, PATH_MAX, "%s/%s", path[i], cmd);
     85                snprintf(found, PATH_MAX, "%s/%s", search_dir[i], cmd);
    10386                if (-1 != try_access(found)) {
    104                         free(path_tok);
    10587                        return (char *) found;
    10688                }
     
    10890
    10991        /* We didn't find it, just give it back as-is. */
    110         free(path_tok);
    11192        return (char *) cmd;
    11293}
    11394
    114 unsigned int try_exec(char *cmd, char **argv)
     95unsigned int try_exec(char *cmd, char **argv, iostate_t *io)
    11596{
    11697        task_id_t tid;
    11798        task_exit_t texit;
    11899        char *tmp;
    119         int rc, retval;
     100        int rc, retval, i;
     101        fdi_node_t file_nodes[3];
     102        fdi_node_t *file_nodes_p[4];
     103        FILE *files[3];
    120104
    121105        tmp = str_dup(find_command(cmd));
    122106        free(found);
     107       
     108        files[0] = io->stdin;
     109        files[1] = io->stdout;
     110        files[2] = io->stderr;
     111       
     112        for (i = 0; i < 3 && files[i] != NULL; i++) {
     113                if (fnode(files[i], &file_nodes[i]) == EOK) {
     114                        file_nodes_p[i] = &file_nodes[i];
     115                }
     116                else {
     117                        file_nodes_p[i] = NULL;
     118                }
     119        }
     120        file_nodes_p[i] = NULL;
    123121
    124         rc = task_spawnv(&tid, tmp, (const char **) argv);
     122        rc = task_spawnvf(&tid, tmp, (const char **) argv, file_nodes_p);
    125123        free(tmp);
    126124
Note: See TracChangeset for help on using the changeset viewer.