version 1.1.2.3, 2014/02/05 13:57:01
|
version 1.7, 2014/02/06 15:32:11
|
Line 1
|
Line 1
|
|
/************************************************************************* |
|
* (C) 2014 AITNET - Sofia/Bulgaria - <office@aitbg.com> |
|
* by Michael Pounov <misho@aitbg.com> |
|
* |
|
* $Author$ |
|
* $Id$ |
|
* |
|
************************************************************************* |
|
The ELWIX and AITNET software is distributed under the following |
|
terms: |
|
|
|
All of the documentation and software included in the ELWIX and AITNET |
|
Releases is copyrighted by ELWIX - Sofia/Bulgaria <info@elwix.org> |
|
|
|
Copyright 2004 - 2014 |
|
by Michael Pounov <misho@elwix.org>. All rights reserved. |
|
|
|
Redistribution and use in source and binary forms, with or without |
|
modification, are permitted provided that the following conditions |
|
are met: |
|
1. Redistributions of source code must retain the above copyright |
|
notice, this list of conditions and the following disclaimer. |
|
2. Redistributions in binary form must reproduce the above copyright |
|
notice, this list of conditions and the following disclaimer in the |
|
documentation and/or other materials provided with the distribution. |
|
3. All advertising materials mentioning features or use of this software |
|
must display the following acknowledgement: |
|
This product includes software developed by Michael Pounov <misho@elwix.org> |
|
ELWIX - Embedded LightWeight unIX and its contributors. |
|
4. Neither the name of AITNET nor the names of its contributors |
|
may be used to endorse or promote products derived from this software |
|
without specific prior written permission. |
|
|
|
THIS SOFTWARE IS PROVIDED BY AITNET AND CONTRIBUTORS ``AS IS'' AND |
|
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
|
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
|
ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE |
|
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
|
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
|
OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
|
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
|
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
|
OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
|
SUCH DAMAGE. |
|
*/ |
#include "global.h" |
#include "global.h" |
|
#include "imgupd.h" |
|
|
|
|
char imgName[PATH_MAX], imgFile[PATH_MAX]; |
char imgName[PATH_MAX], imgFile[PATH_MAX]; |
off_t imgSize, fSize, iSize; | off_t imgSize, iSize, fromBegin; |
int Verbose; | int Verbose, nameFlg, fileFlg, bufSize = IMGBUF_SIZE; |
extern char compiled[], compiledby[], compilehost[]; |
extern char compiled[], compiledby[], compilehost[]; |
|
|
static void |
static void |
Line 12 Usage()
|
Line 58 Usage()
|
|
|
printf( "IMGUPD is tool for management of images\n" |
printf( "IMGUPD is tool for management of images\n" |
"=== %s === %s@%s ===\n\n" |
"=== %s === %s@%s ===\n\n" |
" Syntax: imgupd [options] <image_file>\n\n" | " Syntax: imgupd [options] [image_file]\n\n" |
"\t-v\t\tVerbose ...\n" |
"\t-v\t\tVerbose ...\n" |
|
"\t-R\t\tReboot system after complete\n" |
|
"\t-i\t\tStart fill storage from begin\n" |
|
"\t-g\t\tGet image from Storage\n" |
"\t-t\t\tTruncate Storage file name\n" |
"\t-t\t\tTruncate Storage file name\n" |
"\t-s <size>\tStorage image file to size\n" | "\t-s <size>\tStorage size (required for stdin)\n" |
"\t-f <devfile>\tStorage file name\n" |
"\t-f <devfile>\tStorage file name\n" |
"\n", compiled, compiledby, compilehost); |
"\n", compiled, compiledby, compilehost); |
} |
} |
|
|
static int |
static int |
EmptyStore(int img) | getFDtype(int fd) |
{ |
{ |
|
int type, flg = 0; |
|
struct stat sb; |
|
|
|
if (fstat(fd, &sb) == -1) { |
|
ESYSERR(0); |
|
return -1; |
|
} |
|
if (S_ISREG(sb.st_mode)) |
|
flg |= FD_TRUNC; |
|
if (S_ISCHR(sb.st_mode) || S_ISBLK(sb.st_mode)) { |
|
if (ioctl(fd, FIODTYPE, &type) == -1) { |
|
ESYSERR(0); |
|
return -1; |
|
} |
|
if (type & D_TAPE) |
|
flg |= FD_TAPE; |
|
else if (type & (D_DISK | D_MEM)) |
|
flg |= FD_SEEK; |
|
if (S_ISCHR(sb.st_mode) && !(type & D_TAPE)) |
|
flg |= FD_CHR; |
|
goto end; |
|
} |
|
errno ^= errno; |
|
if (lseek(fd, 0, SEEK_CUR) == -1 && errno == ESPIPE) |
|
flg |= FD_PIPE; |
|
else |
|
flg |= FD_SEEK; |
|
end: |
|
return flg; |
|
} |
|
|
|
static int |
|
EmptyStore(int img, int flg) |
|
{ |
register int i; |
register int i; |
u_char buf[IMGBLOCK_SIZE]; | u_char buf[bufSize]; |
ssize_t wlen; |
ssize_t wlen; |
|
|
VERB(1) printf("Erase store %s\n", imgName); |
VERB(1) printf("Erase store %s\n", imgName); |
|
|
iSize = lseek(img, 0, SEEK_END); | if (!fromBegin && flg & FD_SEEK) { |
if (iSize == -1) { | iSize = lseek(img, 0, SEEK_END); |
ESYSERR(0); | if (iSize == -1) { |
return -1; | ESYSERR(0); |
| return -1; |
| } else |
| imgSize += E_ALIGN(iSize, bufSize); |
} else |
} else |
imgSize += E_ALIGN(iSize, IMGBLOCK_SIZE); | iSize ^= iSize; |
|
|
memset(buf, 0, sizeof buf); |
memset(buf, 0, sizeof buf); |
for (i = howmany(iSize, IMGBLOCK_SIZE); i < howmany(imgSize, IMGBLOCK_SIZE); i++) | for (i = howmany(iSize, bufSize); i < howmany(imgSize, bufSize); i++) |
if ((wlen = write(img, buf, sizeof buf)) == -1 || | if ((wlen = write(img, buf, bufSize)) == -1 || |
wlen != sizeof buf) { | (wlen && wlen != bufSize)) { |
EERROR(EIO, "Error at chunk %d init %d bytes, should be %u\n", | if (wlen == -1) |
i, wlen, sizeof buf); | ESYSERR(0); |
| else |
| EERROR(EIO, "Error at chunk %d init %d bytes, " |
| "should be %u\n", i, wlen, bufSize); |
return -1; |
return -1; |
} else |
} else |
VERB(1) printf("+Written chunk #%d\n", i); |
VERB(1) printf("+Written chunk #%d\n", i); |
|
|
iSize = lseek(img, iSize, SEEK_SET); | if (flg & FD_SEEK) |
| iSize = lseek(img, iSize, SEEK_SET); |
return iSize; |
return iSize; |
} |
} |
|
|
static int |
static int |
FillStore(int img, int fd) | FillStore(int img, int iflg, int fd, int fflg) |
{ |
{ |
register int i, j; |
register int i, j; |
u_char buf[IMGBLOCK_SIZE]; | u_char *pos, buf[bufSize]; |
ssize_t rlen, wlen; | ssize_t rlen, wlen, len; |
|
|
VERB(1) printf("Fill store %s from image file %s\n", imgName, imgFile); |
VERB(1) printf("Fill store %s from image file %s\n", imgName, imgFile); |
|
|
iSize = lseek(img, 0, SEEK_CUR); | for (j = 0, i = howmany(iSize, bufSize); i < howmany(imgSize, bufSize); |
printf("n_%lld\n", iSize); | |
for (j = 0, i = howmany(iSize, IMGBLOCK_SIZE); i < howmany(imgSize, IMGBLOCK_SIZE); | |
i++, j++) { |
i++, j++) { |
memset(buf, 0, sizeof buf); |
memset(buf, 0, sizeof buf); |
rlen = read(fd, buf, sizeof buf); | for (len = bufSize, pos = buf; len > 0; len -= rlen, pos += rlen) { |
if (rlen == -1) { | rlen = read(fd, pos, len); |
ESYSERR(0); | if (rlen == -1) { |
return -1; | ESYSERR(0); |
} else if (!rlen) | return -1; |
break; | } else if (!rlen) |
else | break; |
VERB(1) printf("+Readed %d bytes for chunk #%d\n", rlen, j); | else |
| VERB(1) printf("+Readed %d bytes for chunk #%d\n", rlen, j); |
| } |
|
|
wlen = write(img, buf, rlen); | wlen = write(img, buf, bufSize); |
if (wlen == -1) { |
if (wlen == -1) { |
ESYSERR(0); |
ESYSERR(0); |
return -1; |
return -1; |
} else if (!wlen || wlen != rlen) { | } else if (wlen && wlen != bufSize) { |
EERROR(EIO, "Readed %d bytes are not equal to written %d bytes\n", | EERROR(EIO, "Error at chunk %d written %d bytes, " |
rlen, wlen); | "should be %u\n", i, wlen, bufSize); |
} else |
} else |
VERB(1) printf("+Written %d bytes at chunk #%d\n", wlen, i); |
VERB(1) printf("+Written %d bytes at chunk #%d\n", wlen, i); |
} |
} |
Line 90 FillStore(int img, int fd)
|
Line 180 FillStore(int img, int fd)
|
int |
int |
main(int argc, char **argv) |
main(int argc, char **argv) |
{ |
{ |
char ch; | char ch, m = 0, R = 0; |
int fd, img, tr = 0; |
int fd, img, tr = 0; |
|
|
while ((ch = getopt(argc, argv, "hvts:f:")) != -1) | while ((ch = getopt(argc, argv, "hvRigts:f:")) != -1) |
switch (ch) { |
switch (ch) { |
case 'f': |
case 'f': |
strlcpy(imgName, optarg, sizeof imgName); |
strlcpy(imgName, optarg, sizeof imgName); |
Line 108 main(int argc, char **argv)
|
Line 198 main(int argc, char **argv)
|
case 't': |
case 't': |
tr = O_TRUNC; |
tr = O_TRUNC; |
break; |
break; |
|
case 'g': |
|
m = 1; |
|
case 'i': |
|
fromBegin = 1; |
|
break; |
|
case 'R': |
|
R = 1; |
|
break; |
case 'v': |
case 'v': |
Verbose++; |
Verbose++; |
break; |
break; |
Line 118 main(int argc, char **argv)
|
Line 216 main(int argc, char **argv)
|
} |
} |
argc -= optind; |
argc -= optind; |
argv += optind; |
argv += optind; |
if (!argc || !*imgName || !imgSize) { |
|
Usage(); |
|
return 1; |
|
} else |
|
strlcpy(imgFile, *argv, sizeof imgFile); |
|
|
|
VERB(1) printf("imgSize=%llu imgName=%s imgFile=%s\n", imgSize, imgName, imgFile); | if (!m) { |
| if (argc) { |
| strlcpy(imgFile, *argv, sizeof imgFile); |
| /* open image file */ |
| fd = open(imgFile, O_RDONLY); |
| if (fd == -1) { |
| ESYSERR(0); |
| return 2; |
| } else |
| fileFlg = getFDtype(fd); |
|
|
/* open image file */ | if (fileFlg & FD_SEEK) { |
fd = open(imgFile, O_RDONLY); | iSize = lseek(fd, 0, SEEK_END); |
if (fd == -1) { | if (!imgSize) |
ESYSERR(0); | imgSize = E_ALIGN(iSize, bufSize); |
return 2; | if (iSize == -1 || iSize > imgSize) { |
} else | close(fd); |
fSize = lseek(fd, 0, SEEK_END); | EERROR(ENOSPC, "Error:: file size %llu is " |
if (fSize == -1 || fSize > imgSize) { | "greater from storage size %llu\n", |
close(fd); | iSize, imgSize); |
EERROR(ENOSPC, "Error:: file size %llu is greater from storage size %llu\n", | return 2; |
fSize, imgSize); | } else |
return 2; | lseek(fd, 0, SEEK_SET); |
} else | } |
lseek(fd, 0, SEEK_SET); | } else { |
| fd = STDIN_FILENO; |
| fileFlg = getFDtype(fd); |
| } |
|
|
/* open storage device */ | if (!imgSize) { |
img = open(imgName, O_RDWR | O_CREAT | tr, 0644); | if (fd > 2) |
if (img == -1) { | close(fd); |
ESYSERR(0); | Usage(); |
close(fd); | return 1; |
return 3; | } |
| } else { /* GET */ |
| if (argc) { |
| strlcpy(imgFile, *argv, sizeof imgFile); |
| /* open image file */ |
| fd = open(imgFile, O_WRONLY | O_TRUNC | O_CREAT, 0644); |
| if (fd == -1) { |
| ESYSERR(0); |
| return 2; |
| } else |
| fileFlg = getFDtype(fd); |
| } else { |
| fd = STDOUT_FILENO; |
| fileFlg = getFDtype(fd); |
| } |
} |
} |
if (EmptyStore(img) == -1) { | |
close(fd); | VERB(1) printf("imgSize=%llu imgName=%s imgFile=%s\n", |
close(img); | imgSize, imgName, argc ? imgFile : "<stdin>"); |
unlink(imgName); | |
return 3; | if (!m) { |
| /* open storage device */ |
| img = open(imgName, O_RDWR | O_CREAT | tr, 0644); |
| if (img == -1) { |
| ESYSERR(0); |
| if (fd > 2) |
| close(fd); |
| return 3; |
| } else |
| nameFlg = getFDtype(img); |
| } else { /* GET */ |
| /* open storage device */ |
| img = open(imgName, O_RDONLY); |
| if (img == -1) { |
| ESYSERR(0); |
| if (fd > 2) |
| close(fd); |
| return 3; |
| } else |
| nameFlg = getFDtype(img); |
| |
| if (nameFlg & FD_SEEK) { |
| iSize = lseek(img, 0, SEEK_END); |
| if (!imgSize) |
| imgSize = E_ALIGN(iSize, bufSize); |
| if (iSize == -1 || iSize > imgSize) { |
| if (fd > 2) |
| close(fd); |
| close(img); |
| EERROR(ENOSPC, "Error:: storage size %llu is " |
| "greater from file size %llu\n", |
| iSize, imgSize); |
| return 3; |
| } else |
| lseek(img, 0, SEEK_SET); |
| } |
| |
| if (!imgSize) { |
| if (fd > 2) |
| close(fd); |
| Usage(); |
| return 1; |
| } |
} |
} |
|
|
if (FillStore(img, fd) == -1) { | if (!m) { |
close(fd); | if (EmptyStore(img, nameFlg) == -1) { |
close(img); | if (fd > 2) |
unlink(imgName); | close(fd); |
return 4; | close(img); |
| return 3; |
| } |
| if (FillStore(img, nameFlg, fd, fileFlg) == -1) { |
| if (fd > 2) |
| close(fd); |
| close(img); |
| return 4; |
| } |
| } else { /* GET */ |
| iSize ^= iSize; |
| if (!(fileFlg & FD_PIPE)) |
| if (EmptyStore(fd, fileFlg) == -1) { |
| if (fd > 2) |
| close(fd); |
| close(img); |
| return 3; |
| } |
| if (FillStore(fd, fileFlg, img, nameFlg) == -1) { |
| if (fd > 2) |
| close(fd); |
| close(img); |
| return 4; |
| } |
} |
} |
|
|
close(img); |
close(img); |
close(fd); | if (fd > 2) |
| close(fd); |
| |
| if (R) |
| reboot(RB_AUTOBOOT); |
return 0; |
return 0; |
} |
} |