Subversion Repositories HelenOS

Rev

Rev 4153 | Blame | Compare with Previous | Last modification | View Log | Download | RSS feed

  1. /* Copyright (c) 2008, Tim Post <tinkertim@gmail.com>
  2.  * All rights reserved.
  3.  *
  4.  * Redistribution and use in source and binary forms, with or without
  5.  * modification, are permitted provided that the following conditions are met:
  6.  *
  7.  * Redistributions of source code must retain the above copyright notice, this
  8.  * list of conditions and the following disclaimer.
  9.  *
  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.
  29.  */
  30.  
  31. #include <stdio.h>
  32. #include <stdlib.h>
  33. #include <unistd.h>
  34. #include <getopt.h>
  35. #include <string.h>
  36. #include <fcntl.h>
  37. #include "config.h"
  38. #include "util.h"
  39. #include "errors.h"
  40. #include "entry.h"
  41. #include "cp.h"
  42. #include "cmds.h"
  43.  
  44. #define CP_VERSION "0.0.1"
  45. #define CP_DEFAULT_BUFLEN  1024
  46.  
  47. static const char *cmdname = "cp";
  48.  
  49. static struct option const long_options[] = {
  50.     { "buffer", required_argument, 0, 'b' },
  51.     { "force", no_argument, 0, 'f' },
  52.     { "recursive", no_argument, 0, 'r' },
  53.     { "help", no_argument, 0, 'h' },
  54.     { "version", no_argument, 0, 'v' },
  55.     { "verbose", no_argument, 0, 'V' },
  56.     { 0, 0, 0, 0 }
  57. };
  58.  
  59. static int strtoint(const char *s1)
  60. {
  61.     long t1;
  62.  
  63.     if (-1 == (t1 = strtol(s1, (char **) NULL, 10)))
  64.         return -1;
  65.  
  66.     if (t1 <= 0)
  67.         return -1;
  68.  
  69.     return (int) t1;
  70. }
  71.  
  72. static int64_t copy_file(const char *src, const char *dest,
  73.     size_t blen, int vb)
  74. {
  75.     int fd1, fd2, bytes = 0;
  76.     off_t total = 0;
  77.     int64_t copied = 0;
  78.     char *buff = NULL;
  79.  
  80.     if (vb)
  81.         printf("Copying %s to %s\n", src, dest);
  82.  
  83.     if (-1 == (fd1 = open(src, O_RDONLY))) {
  84.         printf("Unable to open source file %s\n", src);
  85.         return -1;
  86.     }
  87.  
  88.     if (-1 == (fd2 = open(dest, O_CREAT))) {
  89.         printf("Unable to open destination file %s\n", dest);
  90.         close(fd1);
  91.         return -1;
  92.     }
  93.  
  94.     total = lseek(fd1, 0, SEEK_END);
  95.  
  96.     if (vb)
  97.         printf("%d bytes to copy\n", total);
  98.  
  99.     lseek(fd1, 0, SEEK_SET);
  100.  
  101.     if (NULL == (buff = (char *) malloc(blen))) {
  102.         printf("Unable to allocate enough memory to read %s\n",
  103.             src);
  104.         copied = -1;
  105.         goto out;
  106.     }
  107.  
  108.     for (;;) {
  109.         ssize_t res;
  110.  
  111.         bytes = read(fd1, buff, blen);
  112.         if (bytes <= 0)
  113.             break;
  114.         copied += bytes;
  115.         res = bytes;
  116.         do {
  117.             /*
  118.              * Theoretically, it may not be enough to call write()
  119.              * only once. Also the previous read() may have
  120.              * returned less data than requested.
  121.              */
  122.             bytes = write(fd2, buff, res);
  123.             if (bytes < 0)
  124.                 goto err;
  125.             res -= bytes;
  126.         } while (res > 0);
  127.  
  128.         /* TODO: re-insert assert() once this is stand alone,
  129.          * removed as abort() exits the entire shell
  130.          */
  131.         if (res != 0) {
  132.             printf("\n%d more bytes than actually exist were copied\n", res);
  133.             goto err;
  134.         }
  135.     }
  136.  
  137.     if (bytes < 0) {
  138. err:
  139.         printf("\nError copying %s, (%d)\n", src, bytes);
  140.         copied = bytes;
  141.     }
  142.  
  143. out:
  144.     close(fd1);
  145.     close(fd2);
  146.     if (buff)
  147.         free(buff);
  148.     return copied;
  149. }
  150.  
  151. void help_cmd_cp(unsigned int level)
  152. {
  153.     static char helpfmt[] =
  154.         "Usage:  %s [options] <source> <dest>\n"
  155.         "Options: (* indicates not yet implemented)\n"
  156.         "  -h, --help       A short option summary\n"
  157.         "  -v, --version    Print version information and exit\n"
  158.         "* -V, --verbose    Be annoyingly noisy about what's being done\n"
  159.         "* -f, --force      Do not complain when <dest> exists\n"
  160.         "* -r, --recursive  Copy entire directories\n"
  161.         "  -b, --buffer ## Set the read buffer size to ##\n"
  162.         "Currently, %s is under development, some options may not work.\n";
  163.     if (level == HELP_SHORT) {
  164.         printf("`%s' copies files and directories\n", cmdname);
  165.     } else {
  166.         help_cmd_cp(HELP_SHORT);
  167.         printf(helpfmt, cmdname, cmdname);
  168.     }
  169.  
  170.     return;
  171. }
  172.  
  173. int cmd_cp(char **argv)
  174. {
  175.     unsigned int argc, verbose = 0;
  176.     int buffer = 0;
  177.     int c, opt_ind;
  178.     int64_t ret;
  179.  
  180.     argc = cli_count_args(argv);
  181.  
  182.     for (c = 0, optind = 0, opt_ind = 0; c != -1;) {
  183.         c = getopt_long(argc, argv, "hvVfrb:", long_options, &opt_ind);
  184.         switch (c) {
  185.         case 'h':
  186.             help_cmd_cp(1);
  187.             return CMD_SUCCESS;
  188.         case 'v':
  189.             printf("%d\n", CP_VERSION);
  190.             return CMD_SUCCESS;
  191.         case 'V':
  192.             verbose = 1;
  193.             break;
  194.         case 'f':
  195.             break;
  196.         case 'r':
  197.             break;
  198.         case 'b':
  199.             if (-1 == (buffer = strtoint(optarg))) {
  200.                 printf("%s: Invalid buffer specification, "
  201.                     "(should be a number greater than zero)\n",
  202.                     cmdname);
  203.                 return CMD_FAILURE;
  204.             }
  205.             if (verbose)
  206.                 printf("Buffer = %d\n", buffer);
  207.             break;
  208.         }
  209.     }
  210.  
  211.     if (buffer == 0)
  212.         buffer = CP_DEFAULT_BUFLEN;
  213.  
  214.     argc -= optind;
  215.  
  216.     if (argc != 2) {
  217.         printf("%s: invalid number of arguments. Try %s --help\n",
  218.             cmdname, cmdname);
  219.         return CMD_FAILURE;
  220.     }
  221.  
  222.     ret = copy_file(argv[optind], argv[optind + 1], buffer, verbose);
  223.  
  224.     if (verbose)
  225.         printf("%d bytes copied\n", ret);
  226.  
  227.     if (ret >= 0)
  228.         return CMD_SUCCESS;
  229.     else
  230.         return CMD_FAILURE;
  231. }
  232.  
  233.