ClamAV is an open source (GPLv2) anti-virus toolkit.
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
 
 
 
 
clamav/libclamav/fmap.h

185 lines
4.9 KiB

/*
* Copyright (C) 2009 Sourcefire, Inc.
*
* Authors: aCaB <acab@clamav.net>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License version 2 as
* published by the Free Software Foundation.
*
* 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 Street, Fifth Floor, Boston,
* MA 02110-1301, USA.
*/
#ifndef __FMAP_H
#define __FMAP_H
#if HAVE_CONFIG_H
#include "clamav-config.h"
#endif
#ifdef HAVE_UNISTD_H
#include <unistd.h>
#endif
#include <time.h>
#include <string.h>
#include "cltypes.h"
#include "clamav.h"
struct cl_fmap;
typedef cl_fmap_t fmap_t;
struct cl_fmap {
/* handle interface */
void *handle;
clcb_pread pread_cb;
/* internal */
time_t mtime;
unsigned int pages;
unsigned int hdrsz;
unsigned int pgsz;
unsigned int paged;
unsigned short aging;
unsigned short dont_cache_flag;
unsigned short handle_is_fd;
/* memory interface */
const void *data;
/* common interface */
size_t offset;/* file offset */
size_t nested_offset;/* buffer offset for nested scan*/
size_t real_len;/* amount of data mapped from file, starting at offset */
size_t len;/* length of data accessible via current fmap */
/* real_len = nested_offset + len
* file_offset = offset + nested_offset + need_offset
* maximum offset, length accessible via fmap API: len
* offset in cached buffer: nested_offset + need_offset
*
* This allows to scan a portion of an already mapped file without dumping
* to disk and remapping (for uncompressed archives for example) */
/* vtable for implementation */
void (*unmap)(fmap_t*);
const void* (*need)(fmap_t*, size_t at, size_t len, int lock);
const void* (*need_offstr)(fmap_t*, size_t at, size_t len_hint);
const void* (*gets)(fmap_t*, char *dst, size_t *at, size_t max_len);
void (*unneed_off)(fmap_t*, size_t at, size_t len);
#ifdef _WIN32
HANDLE fh;
HANDLE mh;
#endif
uint32_t placeholder_for_bitmap;
};
fmap_t *fmap(int fd, off_t offset, size_t len);
fmap_t *fmap_check_empty(int fd, off_t offset, size_t len, int *empty);
static inline void funmap(fmap_t *m)
{
m->unmap(m);
}
static inline const void *fmap_need_off(fmap_t *m, size_t at, size_t len)
{
return m->need(m, at, len, 1);
}
static inline const void *fmap_need_off_once(fmap_t *m, size_t at, size_t len)
{
return m->need(m, at, len, 0);
}
static inline size_t fmap_ptr2off(const fmap_t *m, const void *ptr)
{
return (m->data ?
(const char*)ptr - (const char*)m->data
:(const char*)ptr - (const char*)m - m->hdrsz) - m->nested_offset;
}
static inline const void *fmap_need_ptr(fmap_t *m, const void *ptr, size_t len)
{
return m->need(m, fmap_ptr2off(m, ptr), len, 1);
}
static inline const void *fmap_need_ptr_once(fmap_t *m, const void *ptr, size_t len)
{
return m->need(m, fmap_ptr2off(m, ptr), len, 0);
}
static inline void fmap_unneed_off(fmap_t *m, size_t at, size_t len)
{
m->unneed_off(m, at, len);
}
static inline void fmap_unneed_ptr(fmap_t *m, const void *ptr, size_t len)
{
fmap_unneed_off(m, fmap_ptr2off(m, ptr), len);
}
static inline int fmap_readn(fmap_t *m, void *dst, size_t at, size_t len)
{
const void *src;
if(at == m->len || !len)
return 0;
if(at > m->len)
return -1;
if(len > m->len - at)
len = m->len - at;
src = fmap_need_off_once(m, at, len);
if(!src)
return -1;
memcpy(dst, src, len);
return len;
}
static inline const void *fmap_need_str(fmap_t *m, const void *ptr, size_t len_hint)
{
return m->need_offstr(m, fmap_ptr2off(m, ptr), len_hint);
}
static inline const void *fmap_need_offstr(fmap_t *m, size_t at, size_t len_hint)
{
return m->need_offstr(m, at, len_hint);
}
static inline const void *fmap_gets(fmap_t *m, char *dst, size_t *at, size_t max_len) {
return m->gets(m, dst, at, max_len);
}
static inline const void *fmap_need_off_once_len(fmap_t *m, size_t at, size_t len, size_t *lenout)
{
const void *p;
if(at >= m->len) {
*lenout = 0;
return (void*)0xE0F00000;/* EOF, not read error */
}
if(len > m->len - at)
len = m->len - at;
p = fmap_need_off_once(m, at, len);
*lenout = p ? len : 0;
return p;
}
static inline const void *fmap_need_ptr_once_len(fmap_t *m, const void *ptr, size_t len, size_t *lenout)
{
return fmap_need_off_once_len(m, fmap_ptr2off(m, ptr), len, lenout);
}
int fmap_dump_to_file(fmap_t *map, const char *tmpdir, char **outname, int *outfd);
/* deprecated */
int fmap_fd(fmap_t *m);
#endif