2000-06-02 08:51:42 +05:30
|
|
|
/* vi: set sw=4 ts=4: */
|
|
|
|
/*
|
|
|
|
* Mini ar implementation for busybox
|
|
|
|
*
|
|
|
|
* Copyright (C) 2000 by Glenn McGrath
|
|
|
|
* Written by Glenn McGrath <bug1@netconnect.com.au> 1 June 2000
|
2000-08-25 09:20:10 +05:30
|
|
|
*
|
2000-06-02 08:51:42 +05:30
|
|
|
* Based in part on BusyBox tar, Debian dpkg-deb and GNU ar.
|
|
|
|
*
|
|
|
|
* This program is free software; you can redistribute it and/or modify
|
|
|
|
* it under the terms of the GNU General Public License as published by
|
|
|
|
* the Free Software Foundation; either version 2 of the License, or
|
|
|
|
* (at your option) any later version.
|
|
|
|
*
|
|
|
|
* This program is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
|
|
* General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU General Public License
|
|
|
|
* along with this program; if not, write to the Free Software
|
|
|
|
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
|
|
|
*
|
2000-09-09 14:05:45 +05:30
|
|
|
* Last modified 9 September 2000
|
2000-06-02 08:51:42 +05:30
|
|
|
*/
|
|
|
|
#include <stdio.h>
|
2000-09-09 14:05:45 +05:30
|
|
|
#include <string.h>
|
2000-06-02 08:51:42 +05:30
|
|
|
#include <fcntl.h>
|
|
|
|
#include <errno.h>
|
|
|
|
#include <ctype.h>
|
2000-06-16 10:26:40 +05:30
|
|
|
#include <time.h>
|
|
|
|
#include <utime.h>
|
2000-09-09 14:05:45 +05:30
|
|
|
#include <unistd.h>
|
|
|
|
#include <stdlib.h>
|
2000-06-16 10:26:40 +05:30
|
|
|
#include <sys/types.h>
|
2000-09-09 14:05:45 +05:30
|
|
|
#include <sys/stat.h>
|
|
|
|
#include <malloc.h>
|
2000-06-02 08:51:42 +05:30
|
|
|
#include "internal.h"
|
|
|
|
|
2000-08-25 09:20:10 +05:30
|
|
|
#define BLOCK_SIZE 60
|
|
|
|
#define PRESERVE_DATE 1 /* preserve original dates */
|
|
|
|
#define VERBOSE 2 /* be verbose */
|
|
|
|
#define DISPLAY 4 /* display contents */
|
|
|
|
#define EXT_TO_FILE 8 /* extract contents of archive */
|
|
|
|
#define EXT_TO_STDOUT 16 /* extract to stdout */
|
2000-09-09 20:20:04 +05:30
|
|
|
#define RECURSIVE 32
|
2000-06-16 10:26:40 +05:30
|
|
|
|
2000-09-09 14:05:45 +05:30
|
|
|
#define MAX_NAME_LENGTH 100
|
|
|
|
|
|
|
|
//#define BB_DECLARE_EXTERN
|
|
|
|
//#define bb_need_io_error
|
|
|
|
//#include "messages.c"
|
2000-06-02 08:51:42 +05:30
|
|
|
|
2000-09-09 14:05:45 +05:30
|
|
|
typedef struct rawArHeader { /* Byte Offset */
|
2000-08-25 09:20:10 +05:30
|
|
|
char name[16]; /* 0-15 */
|
|
|
|
char date[12]; /* 16-27 */
|
|
|
|
char uid[6], gid[6]; /* 28-39 */
|
|
|
|
char mode[8]; /* 40-47 */
|
|
|
|
char size[10]; /* 48-57 */
|
|
|
|
char fmag[2]; /* 58-59 */
|
|
|
|
} rawArHeader_t;
|
|
|
|
|
|
|
|
typedef struct headerL {
|
2000-09-09 14:05:45 +05:30
|
|
|
char name[MAX_NAME_LENGTH];
|
2000-08-25 09:20:10 +05:30
|
|
|
size_t size;
|
|
|
|
uid_t uid;
|
|
|
|
gid_t gid;
|
|
|
|
mode_t mode;
|
|
|
|
time_t mtime;
|
|
|
|
off_t offset;
|
|
|
|
struct headerL *next;
|
|
|
|
} headerL_t;
|
2000-06-02 08:51:42 +05:30
|
|
|
|
2000-06-16 10:26:40 +05:30
|
|
|
/*
|
2000-09-09 14:05:45 +05:30
|
|
|
* identify Ar header (magic) and set srcFd to first header entry
|
2000-06-16 10:26:40 +05:30
|
|
|
*/
|
2000-09-09 14:05:45 +05:30
|
|
|
static int checkArMagic(int srcFd)
|
2000-06-02 08:51:42 +05:30
|
|
|
{
|
2000-09-09 14:05:45 +05:30
|
|
|
char arMagic[8];
|
|
|
|
if (fullRead(srcFd, arMagic, 8) != 8)
|
2000-08-25 09:20:10 +05:30
|
|
|
return (FALSE);
|
2000-09-09 14:05:45 +05:30
|
|
|
|
|
|
|
if (strncmp(arMagic,"!<arch>",7) != 0)
|
2000-08-25 09:20:10 +05:30
|
|
|
return(FALSE);
|
2000-09-09 14:05:45 +05:30
|
|
|
return(TRUE);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* read, convert and check the raw ar header
|
|
|
|
* srcFd should be pointing to the start of header prior to entry
|
|
|
|
* srcFd will be pointing at the start of data after successful exit
|
|
|
|
* if returns FALSE srcFd is reset to initial position
|
|
|
|
*/
|
|
|
|
static int readRawArHeader(int srcFd, headerL_t *header)
|
|
|
|
{
|
|
|
|
rawArHeader_t rawArHeader;
|
|
|
|
off_t initialOffset;
|
|
|
|
size_t nameLength;
|
|
|
|
|
|
|
|
initialOffset = lseek(srcFd, 0, SEEK_CUR);
|
|
|
|
if (fullRead(srcFd, (char *) &rawArHeader, 60) != 60) {
|
|
|
|
lseek(srcFd, initialOffset, SEEK_SET);
|
|
|
|
return(FALSE);
|
|
|
|
}
|
|
|
|
if ((rawArHeader.fmag[0]!='`') || (rawArHeader.fmag[1]!='\n')) {
|
|
|
|
lseek(srcFd, initialOffset, SEEK_SET);
|
|
|
|
return(FALSE);
|
|
|
|
}
|
|
|
|
|
|
|
|
strncpy(header->name, rawArHeader.name, 16);
|
|
|
|
nameLength=strcspn(header->name, " \\");
|
|
|
|
header->name[nameLength]='\0';
|
|
|
|
parse_mode(rawArHeader.mode, &header->mode);
|
|
|
|
header->mtime = atoi(rawArHeader.date);
|
|
|
|
header->uid = atoi(rawArHeader.uid);
|
|
|
|
header->gid = atoi(rawArHeader.gid);
|
|
|
|
header->size = (size_t) atoi(rawArHeader.size);
|
|
|
|
header->offset = initialOffset + (off_t) 60;
|
|
|
|
return(TRUE);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* get, check and correct the converted header
|
|
|
|
*/
|
|
|
|
static int readArEntry(int srcFd, headerL_t *newEntry)
|
|
|
|
{
|
|
|
|
size_t nameLength;
|
|
|
|
|
|
|
|
if(readRawArHeader(srcFd, newEntry)==FALSE)
|
|
|
|
return(FALSE);
|
|
|
|
|
|
|
|
nameLength = strcspn(newEntry->name, "/");
|
|
|
|
|
|
|
|
/* handle GNU style short filenames, strip trailing '/' */
|
|
|
|
if (nameLength > 0)
|
|
|
|
newEntry->name[nameLength]='\0';
|
|
|
|
|
|
|
|
/* handle GNU style long filenames */
|
|
|
|
if (nameLength == 0) {
|
|
|
|
/* escape from recursive call */
|
|
|
|
if (newEntry->name[1]=='0')
|
|
|
|
return(TRUE);
|
|
|
|
|
|
|
|
/* the data section contains the real filename */
|
|
|
|
if (newEntry->name[1]=='/') {
|
|
|
|
char tempName[MAX_NAME_LENGTH];
|
|
|
|
|
|
|
|
if (newEntry->size > MAX_NAME_LENGTH)
|
|
|
|
newEntry->size = MAX_NAME_LENGTH;
|
|
|
|
fullRead(srcFd, tempName, newEntry->size);
|
|
|
|
tempName[newEntry->size-3]='\0';
|
|
|
|
|
|
|
|
/* read the second header for this entry */
|
|
|
|
/* be carefull, this is recursive */
|
|
|
|
if (readArEntry(srcFd, newEntry)==FALSE)
|
|
|
|
return(FALSE);
|
|
|
|
|
|
|
|
if ((newEntry->name[0]='/') && (newEntry->name[1]='0'))
|
|
|
|
strcpy(newEntry->name, tempName);
|
|
|
|
else {
|
|
|
|
errorMsg("Invalid long filename\n");
|
|
|
|
return(FALSE);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return(TRUE);
|
2000-06-02 08:51:42 +05:30
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
2000-08-25 09:20:10 +05:30
|
|
|
* return the headerL_t struct for the specified filename
|
2000-06-02 08:51:42 +05:30
|
|
|
*/
|
2000-09-09 20:20:04 +05:30
|
|
|
static headerL_t *getHeaders(int srcFd, headerL_t *head, int funct)
|
2000-06-02 08:51:42 +05:30
|
|
|
{
|
2000-09-09 14:05:45 +05:30
|
|
|
headerL_t *list;
|
|
|
|
list = (headerL_t *) malloc(sizeof(headerL_t));
|
|
|
|
|
2000-09-09 20:20:04 +05:30
|
|
|
if (checkArMagic(srcFd)==TRUE) {
|
2000-09-09 14:05:45 +05:30
|
|
|
while(readArEntry(srcFd, list) == TRUE) {
|
|
|
|
list->next = (headerL_t *) malloc(sizeof(headerL_t));
|
|
|
|
*list->next = *head;
|
|
|
|
*head = *list;
|
2000-09-09 20:20:04 +05:30
|
|
|
|
2000-09-09 14:05:45 +05:30
|
|
|
/* recursive check for sub-archives */
|
2000-09-09 20:20:04 +05:30
|
|
|
if ((funct & RECURSIVE) == RECURSIVE)
|
|
|
|
head = getHeaders(srcFd, head, funct);
|
|
|
|
lseek(srcFd, head->offset + head->size, SEEK_SET);
|
2000-09-09 14:05:45 +05:30
|
|
|
}
|
|
|
|
}
|
|
|
|
return(head);
|
2000-06-02 08:51:42 +05:30
|
|
|
}
|
|
|
|
|
2000-06-16 10:26:40 +05:30
|
|
|
/*
|
2000-09-09 14:05:45 +05:30
|
|
|
* find an entry in the linked list matching the filename
|
2000-06-16 10:26:40 +05:30
|
|
|
*/
|
2000-09-09 14:05:45 +05:30
|
|
|
static headerL_t *findEntry(headerL_t *head, const char *filename)
|
2000-06-02 08:51:42 +05:30
|
|
|
{
|
2000-09-09 14:05:45 +05:30
|
|
|
while(head->next != NULL) {
|
|
|
|
if (strcmp(filename, head->name)==0)
|
|
|
|
return(head);
|
|
|
|
head=head->next;
|
|
|
|
}
|
|
|
|
return(NULL);
|
|
|
|
}
|
2000-06-02 08:51:42 +05:30
|
|
|
|
2000-09-09 14:05:45 +05:30
|
|
|
/*
|
|
|
|
* populate linked list with all ar file entries and offset
|
|
|
|
*/
|
|
|
|
static int displayEntry(headerL_t *head, int funct)
|
|
|
|
{
|
2000-08-25 09:20:10 +05:30
|
|
|
if ((funct & VERBOSE) == VERBOSE) {
|
2000-09-09 14:05:45 +05:30
|
|
|
printf("%s %d/%d %8d %s ", modeString(head->mode), head->uid, head->gid, head->size, timeString(head->mtime));
|
2000-06-02 08:51:42 +05:30
|
|
|
}
|
2000-09-09 14:05:45 +05:30
|
|
|
printf("%s\n", head->name);
|
|
|
|
head = head->next;
|
2000-08-25 09:20:10 +05:30
|
|
|
return(TRUE);
|
2000-06-16 10:26:40 +05:30
|
|
|
}
|
|
|
|
|
2000-09-09 14:05:45 +05:30
|
|
|
static int extractAr(int srcFd, int dstFd, headerL_t *file)
|
2000-06-16 10:26:40 +05:30
|
|
|
{
|
2000-08-25 09:20:10 +05:30
|
|
|
lseek(srcFd, file->offset, SEEK_SET);
|
|
|
|
if (copySubFile(srcFd, dstFd, (size_t) file->size) == TRUE)
|
|
|
|
return(TRUE);
|
|
|
|
return(FALSE);
|
2000-06-02 08:51:42 +05:30
|
|
|
}
|
|
|
|
|
|
|
|
extern int ar_main(int argc, char **argv)
|
|
|
|
{
|
2000-08-25 09:20:10 +05:30
|
|
|
int funct = 0, opt=0;
|
|
|
|
int srcFd=0, dstFd=0;
|
2000-09-09 14:05:45 +05:30
|
|
|
headerL_t *header, *entry, *extractList;
|
|
|
|
|
2000-09-09 20:20:04 +05:30
|
|
|
while ((opt = getopt(argc, argv, "ovtpxR")) != -1) {
|
2000-08-25 09:20:10 +05:30
|
|
|
switch (opt) {
|
2000-07-05 22:51:58 +05:30
|
|
|
case 'o':
|
2000-08-25 09:20:10 +05:30
|
|
|
funct = funct | PRESERVE_DATE;
|
2000-06-02 08:51:42 +05:30
|
|
|
break;
|
2000-07-05 22:51:58 +05:30
|
|
|
case 'v':
|
2000-08-25 09:20:10 +05:30
|
|
|
funct = funct | VERBOSE;
|
2000-06-02 08:51:42 +05:30
|
|
|
break;
|
2000-07-05 22:51:58 +05:30
|
|
|
case 't':
|
2000-08-25 09:20:10 +05:30
|
|
|
funct = funct | DISPLAY;
|
2000-09-09 19:08:26 +05:30
|
|
|
break;
|
2000-07-05 22:51:58 +05:30
|
|
|
case 'x':
|
2000-09-09 19:08:26 +05:30
|
|
|
funct = funct | EXT_TO_FILE;
|
|
|
|
break;
|
2000-07-05 22:51:58 +05:30
|
|
|
case 'p':
|
2000-09-09 19:08:26 +05:30
|
|
|
funct = funct | EXT_TO_STDOUT;
|
2000-06-02 08:51:42 +05:30
|
|
|
break;
|
2000-09-09 20:20:04 +05:30
|
|
|
case 'R':
|
|
|
|
funct = funct | RECURSIVE;
|
|
|
|
break;
|
2000-06-02 08:51:42 +05:30
|
|
|
default:
|
|
|
|
usage(ar_usage);
|
|
|
|
}
|
|
|
|
}
|
2000-08-25 09:20:10 +05:30
|
|
|
|
2000-09-09 19:08:26 +05:30
|
|
|
/* check the src filename was specified */
|
|
|
|
if (optind == argc) {
|
2000-08-25 09:20:10 +05:30
|
|
|
usage(ar_usage);
|
|
|
|
return(FALSE);
|
|
|
|
}
|
2000-06-16 10:26:40 +05:30
|
|
|
|
2000-09-09 19:08:26 +05:30
|
|
|
if ( (srcFd = open(argv[optind], O_RDONLY)) < 0) {
|
|
|
|
errorMsg("Cannot read %s\n", optarg);
|
|
|
|
return (FALSE);
|
|
|
|
}
|
|
|
|
optind++;
|
2000-09-09 14:05:45 +05:30
|
|
|
entry = (headerL_t *) malloc(sizeof(headerL_t));
|
|
|
|
header = (headerL_t *) malloc(sizeof(headerL_t));
|
|
|
|
extractList = (headerL_t *) malloc(sizeof(headerL_t));
|
|
|
|
|
2000-09-09 20:20:04 +05:30
|
|
|
header = getHeaders(srcFd, header, funct);
|
2000-09-09 14:05:45 +05:30
|
|
|
|
|
|
|
/* find files to extract or display */
|
|
|
|
if (optind<argc) {
|
|
|
|
/* only handle specified files */
|
|
|
|
while(optind < argc) {
|
|
|
|
if ( (entry = findEntry(header, argv[optind])) != NULL) {
|
|
|
|
entry->next = (headerL_t *) malloc(sizeof(headerL_t));
|
|
|
|
*entry->next = *extractList;
|
|
|
|
*extractList = *entry;
|
2000-08-25 09:20:10 +05:30
|
|
|
}
|
2000-09-09 14:05:45 +05:30
|
|
|
optind++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
|
|
|
/* extract everything */
|
|
|
|
extractList = header;
|
|
|
|
|
|
|
|
while(extractList->next != NULL) {
|
|
|
|
if ( (funct & EXT_TO_FILE) == EXT_TO_FILE) {
|
2000-09-09 18:18:40 +05:30
|
|
|
dstFd = open(extractList->name, O_WRONLY | O_CREAT, extractList->mode);
|
|
|
|
|
2000-09-09 14:05:45 +05:30
|
|
|
extractAr(srcFd, dstFd, extractList);
|
2000-08-25 09:20:10 +05:30
|
|
|
}
|
2000-09-09 14:05:45 +05:30
|
|
|
if ( (funct & EXT_TO_STDOUT) == EXT_TO_STDOUT)
|
|
|
|
extractAr(srcFd, fileno(stdout), extractList);
|
|
|
|
if ( (funct & DISPLAY) == DISPLAY)
|
|
|
|
displayEntry(extractList, funct);
|
|
|
|
extractList=extractList->next;
|
|
|
|
}
|
2000-08-25 09:20:10 +05:30
|
|
|
return (TRUE);
|
2000-06-02 08:51:42 +05:30
|
|
|
}
|