gambas-source-code/main/share/gb_arch_temp.h
Benoît Minisini 4c02c6d338 ******** Merged /branches/64bits r918:1003 into /trunk
[CONFIGURATION]
* NEW: 64 bits port.

[EXAMPLES]
* BUG: Fixed the AnalogWatch example.

[WIKI CGI SCRIPT]
* NEW: Some little cosmetic changes.

[INTERPRETER]
* NEW: The extern function implementation has been redesigned and is now
  based on libffi, so that it works on 64 bits system. Because of a flaw in
  the compiler design, projects that use the Pointer datatype must be
  recompiled to be used on a 64 bits system. This flaw will be fixed in
  Gambas 3.
* OPT: Put some tables into read-only memory. About 1000 bytes are saved
  for each running interpreter, except the first one.
* BUG: Does not crash anymore if a component cannot be loaded.
* NEW: Spanish translation updated.
* NEW: A new interpreter API for returning a pointer.

[COMPILER]
* BUG: Correctly compiles LONG constants inside code.

[GB.DEBUG]
* BUG: Compiles and links the gb.debug components with the thread
  libraries.

[GB.DB.SQLITE3]
* BUG: Getting the primary index of a table without primary index is safe
  now.

[GB.GTK]
* BUG: Modified the GLib priority of watched descriptors, as the main loop 
  could enter in a loop in which user interface events were not managed.
* BUG: Message boxes use application title without crashing now.

[GB.OPENGL]
* BUG: Disable dead code.

[GB.QT.EXT]
* BUG: TextEdit.TextWidth and TextEdit.TextHeight were not declared as
  read-only properties.

[GB.XML.XSLT]
* BUG: XSLT class is now declared as being not creatable.


git-svn-id: svn://localhost/gambas/trunk@1006 867c0c6c-44f3-4631-809d-bfa615b0a4ec
2008-01-17 21:39:26 +00:00

313 lines
6.2 KiB
C

/***************************************************************************
archive.c
The archive management routines
(c) 2000-2007 Benoit Minisini <gambas@users.sourceforge.net>
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 1, 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., 675 Mass Ave, Cambridge, MA 02139, USA.
***************************************************************************/
#define __GBX_ARCH_C
#include <sys/types.h>
#include <sys/stat.h>
#include <sys/mman.h>
#include <fcntl.h>
#include <unistd.h>
#include "gb_common.h"
#include "gb_common_swap.h"
#include "gb_error.h"
#include "gb_alloc.h"
#include "gb_arch.h"
#ifndef PROJECT_EXEC
#define E_ARCH "Bad archive: &1"
#endif
static bool _swap = FALSE;
static const char *_path;
static void arch_error(const char *msg)
{
const char *name = FILE_get_name(_path);
if (msg == NULL)
THROW(E_ARCH, name, strerror(errno));
else
THROW(E_ARCH, name, msg);
}
static void read_at(ARCH *arch, int pos, void *buf, int len)
{
memcpy(buf, &arch->addr[pos], len);
}
static void load_arch(ARCH *arch, const char *path)
{
int len;
int i;
int pos;
struct stat info;
#ifdef OS_64BITS
ARCH_SYMBOL_32 *sym;
#endif
_path = path;
arch->fd = open(path, O_RDONLY);
if (arch->fd < 0)
THROW(E_OPEN, path, strerror(errno));
if (fstat(arch->fd, &info) < 0)
THROW(E_OPEN, path, strerror(errno));
arch->length = info.st_size;
arch->addr = mmap(NULL, arch->length, PROT_READ, MAP_PRIVATE, arch->fd, 0);
if (arch->addr == MAP_FAILED)
THROW(E_OPEN, path, strerror(errno));
//fprintf(stderr, "mmap: %s\n", path);
/* Header */
read_at(arch, 32, &arch->header, sizeof(ARCH_HEADER));
_swap = arch->header.magic != ARCH_MAGIC;
if (_swap)
{
fprintf(stderr, "gbx: Swapping archive\n");
SWAP_ints((int *)&arch->header, 6);
}
//if (arch->header.version != ARCH_VERSION)
// arch_error("bad version");
/* Strings */
len = arch->header.pos_table - arch->header.pos_string;
if (len <= 0)
arch_error("corrupted header");
ALLOC(&arch->string, len, "ARCH_init");
read_at(arch, arch->header.pos_string, arch->string, len);
/* File names table */
len = arch->header.n_symbol * sizeof(ARCH_SYMBOL);
if (len <= 0)
arch_error("corrupted header");
ALLOC(&arch->symbol, len, "ARCHIVE_load");
#ifdef OS_64BITS
sym = (ARCH_SYMBOL_32 *)&arch->addr[arch->header.pos_table];
for (i = 0; i < arch->header.n_symbol; i++, sym++)
{
arch->symbol[i].sym.sort = sym->sym.sort;
arch->symbol[i].sym.len = sym->sym.len;
arch->symbol[i].sym.name = (char *)(intptr_t)sym->sym.name;
arch->symbol[i].pos = sym->pos;
arch->symbol[i].len = sym->len;
}
#else
read_at(arch, arch->header.pos_table, arch->symbol, len);
#endif
/* String relocation */
pos = 0;
for (i = 0; i < arch->header.n_symbol; i++)
{
if (_swap)
{
SWAP_short((short *)&arch->symbol[i].sym.sort);
SWAP_short((short *)&arch->symbol[i].sym.len);
SWAP_int(&arch->symbol[i].pos);
SWAP_int(&arch->symbol[i].len);
}
arch->symbol[i].sym.name = &arch->string[pos];
pos += arch->symbol[i].sym.len;
}
}
PUBLIC ARCH *ARCH_open(const char *path)
{
ARCH *arch;
ALLOC_ZERO(&arch, sizeof(ARCH), "ARCH_open");
load_arch(arch, path);
return arch;
}
PUBLIC void ARCH_close(ARCH *arch)
{
if (arch->fd)
{
FREE(&arch->string, "ARCH_close");
FREE(&arch->symbol, "ARCH_close");
munmap(arch->addr, arch->length);
close(arch->fd);
}
FREE(&arch, "ARCH_close");
}
PUBLIC void ARCH_get_absolute_path(const char *path, int len_path, char *abs_path, int *len_abs_path)
{
const char *p, *lp;
char *ap;
char c;
int rest;
p = path;
lp = p;
ap = abs_path;
*len_abs_path = 0;
for(;;)
{
rest = &path[len_path] - p;
if (rest <= 0)
break;
c = *p;
if (p == lp && c == '.')
{
if (rest == 1 || p[1] == '/')
{
if (rest == 1)
p++;
else
p += 2;
lp = p;
continue;
}
else if (rest >= 2 && p[1] == '.' && (rest == 2 || p[2] == '/'))
{
if (ap > abs_path)
{
ap--; // Jumps the last '/'
while (ap > abs_path)
{
ap--;
if (*ap == '/')
{
ap++;
break;
}
}
}
p += 3;
lp = p;
continue;
}
}
*ap++ = c;
p++;
if (c == '/')
lp = p;
}
*len_abs_path = ap - abs_path;
*ap = 0;
}
PUBLIC bool ARCH_find(ARCH *arch, const char *path, int len_path, ARCH_FIND *find)
{
int ind;
ARCH_SYMBOL *sym;
char tpath[MAX_PATH];
int len_tpath;
if (len_path <= 0)
len_path = strlen(path);
ARCH_get_absolute_path(path, len_path, tpath, &len_tpath);
if (len_tpath == 0)
{
find->sym = NULL;
find->pos = -1;
find->len = 0;
return FALSE;
}
if (arch->header.version == 2)
{
char *p;
char tpath2[MAX_PATH];
for(;;)
{
p = index(tpath + 1, '/');
if (!p)
break;
SYMBOL_find(arch->symbol, arch->header.n_symbol, sizeof(ARCH_SYMBOL), TF_NORMAL, tpath, p - tpath, 0, &ind);
if (ind == NO_SYMBOL)
break;
sym = &arch->symbol[ind];
len_tpath = snprintf(tpath2, sizeof(tpath2),"/%d:%s", ind, p + 1);
strlcpy(tpath, tpath2, sizeof(tpath));
}
SYMBOL_find(arch->symbol, arch->header.n_symbol, sizeof(ARCH_SYMBOL), TF_NORMAL, tpath, len_tpath, 0, &ind);
}
else
SYMBOL_find_old(arch->symbol, arch->header.n_symbol, sizeof(ARCH_SYMBOL), TF_NORMAL, tpath, len_tpath, 0, &ind);
if (ind == NO_SYMBOL)
return TRUE;
sym = &arch->symbol[ind];
find->sym = sym;
find->pos = sym->pos;
find->len = sym->len;
return FALSE;
}
PUBLIC bool ARCH_read(ARCH *arch, int pos, void *buffer, int len)
{
/*if (lseek(arch->fd, pos, SEEK_SET) < 0)
return TRUE;
if (read(arch->fd, buffer, len) != len)
return TRUE;*/
memcpy(buffer, &arch->addr[pos], len);
return FALSE;
}