Add initial version of lar to the archive.
Signed-off-by: Stefan Reinauer <stepan@coresystems.de> Acked-By: Stefan Reinauer <stepan@coresystems.de> and others. git-svn-id: svn://coreboot.org/repository/LinuxBIOSv3@39 f3766cd6-281f-0410-b1cd-43a5c92072e9
This commit is contained in:
parent
a597d175aa
commit
92efb61fa7
13 changed files with 898 additions and 0 deletions
124
util/lar/example.c
Normal file
124
util/lar/example.c
Normal file
|
|
@ -0,0 +1,124 @@
|
|||
/*
|
||||
* lar - linuxbios archiver
|
||||
*
|
||||
* written by Stefan Reinauer <stepan@coresystems.de>
|
||||
*
|
||||
* (C) 2006 coresystems GmbH. All rights reserved.
|
||||
*
|
||||
* 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; version 2 of the License.
|
||||
*
|
||||
* 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., 51 Franklin St, Fifth Floor, Boston, MA, 02110-1301 USA
|
||||
*
|
||||
* This file may be dual licensed with the new BSD license.
|
||||
*
|
||||
*/
|
||||
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
#include <unistd.h>
|
||||
#include <fcntl.h>
|
||||
#include <errno.h>
|
||||
#include <sys/types.h>
|
||||
#include <sys/stat.h>
|
||||
#include <sys/mman.h>
|
||||
#include <netinet/in.h>
|
||||
|
||||
#include "lar.h"
|
||||
|
||||
struct mem_file {
|
||||
char *start;
|
||||
int len;
|
||||
};
|
||||
|
||||
int find_file(struct mem_file *archive, char *filename, struct mem_file *result)
|
||||
{
|
||||
char * walk, *fullname;
|
||||
struct lar_header * header;
|
||||
|
||||
for (walk = archive->start; walk < archive->start +
|
||||
archive->len; walk+=16) {
|
||||
|
||||
if(strcmp(walk, MAGIC)!=0)
|
||||
continue;
|
||||
|
||||
header=(struct lar_header *)walk;
|
||||
fullname=walk+sizeof(struct lar_header);
|
||||
|
||||
// FIXME: check checksum
|
||||
|
||||
if(strcmp(fullname, filename)!=0) {
|
||||
result->start=walk + ntohl(header->offset);
|
||||
result->len=ntohl(header->len);
|
||||
return 0;
|
||||
}
|
||||
|
||||
// skip file
|
||||
walk += ( ntohl(header->offset) + ntohl(header->len)
|
||||
+ 15 ) & 0xfffffff0;
|
||||
}
|
||||
|
||||
return 1;
|
||||
}
|
||||
|
||||
|
||||
|
||||
int main(int argc, char *argv[])
|
||||
{
|
||||
int fd, ret;
|
||||
struct stat statbuf;
|
||||
struct mem_file archive, result;
|
||||
|
||||
if (argc!=2) {
|
||||
printf("Usage: example archive.lar\n");
|
||||
exit(0);
|
||||
}
|
||||
|
||||
if (stat(argv[1], &statbuf)!=0) {
|
||||
printf("Error opening %s: %s\n",
|
||||
argv[1], strerror(errno));
|
||||
exit(1);
|
||||
}
|
||||
printf("Opening %s\n", argv[1]);
|
||||
|
||||
fd=open(argv[1], O_RDONLY);
|
||||
if (fd==-1) {
|
||||
printf("Error while opening %s: %s\n",
|
||||
argv[1], strerror(errno));
|
||||
exit(1);
|
||||
}
|
||||
archive.len=statbuf.st_size;
|
||||
|
||||
archive.start=mmap(NULL, statbuf.st_size, PROT_READ,
|
||||
MAP_SHARED, fd, 0);
|
||||
/* OS stuff ends here */
|
||||
/* ------------------------------------------------- */
|
||||
|
||||
// find first compressor
|
||||
ret=find_file(&archive, "compression/", &result);
|
||||
if(!ret) printf("file found.\n");
|
||||
else printf("file not found.\n");
|
||||
|
||||
ret=find_file(&archive, "normal/initram", &result);
|
||||
if(!ret) printf("file found.\n");
|
||||
else printf("file not found.\n");
|
||||
|
||||
|
||||
/* ------------------------------------------------- */
|
||||
/* OS stuff starts again here */
|
||||
munmap(archive.start, archive.len);
|
||||
close(fd);
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
|
||||
Loading…
Add table
Add a link
Reference in a new issue