eccodes/memfs.py

187 lines
3.7 KiB
Python
Raw Normal View History

2016-06-14 13:04:48 +00:00
#!/usr/bin/env python
from __future__ import print_function
import os
import re
import sys
assert len(sys.argv) > 2
dirs = [os.path.realpath(x) for x in sys.argv[1:-1]]
print(dirs)
# exit(1)
FILES = {}
NAMES = []
g = open(sys.argv[-1], "w")
for directory in dirs:
# print("---->", directory)
dname = os.path.basename(directory)
NAMES.append(dname)
for dirname, _, files in os.walk(directory):
for name in files:
full = '%s/%s' % (dirname, name)
_, ext = os.path.splitext(full)
if ext not in ['.def', '.table', '.tmpl']:
continue
fname = full[full.find("/%s/" % (dname,)):]
print(fname)
name = re.sub(r'\W', '_', fname)
assert name not in FILES
FILES[name] = fname
print('static const unsigned char %s[] = {' % (name,), file=g)
with open(full) as f:
i = 0
for n in re.findall('..', f.read().encode("hex")):
print("0x%s," % (n,), end="", file=g)
i += 1
if (i % 20) == 0:
print("", file=g)
print('};', file=g)
print("""
#include "eccodes_config.h"
2016-06-14 13:04:48 +00:00
#ifdef EC_HAVE_FMEMOPEN
#define _GNU_SOURCE
#endif
#include <stdio.h>
#include <stdlib.h>
#include <errno.h>
#include <string.h>
struct entry {
const char* path;
const unsigned char* content;
size_t length;
} entries[] = { """, file=g)
items = [(v, k) for k, v in FILES.items()]
for k, v in sorted(items):
2016-06-18 17:18:14 +00:00
print ('{"/MEMFS%s", &%s[0], sizeof(%s) / sizeof(%s[0]) },' % (k, v, v, v), file=g)
2016-06-14 13:04:48 +00:00
print("""};
#ifdef EC_HAVE_FUNOPEN
typedef struct mem_file {
const char* buffer;
size_t size;
size_t pos;
} mem_file;
static int read_mem(void *data, char * buf, int len) {
mem_file* f = (mem_file*)data;
int n = len;
if(f->pos + n > f->size) {
n = f->size - f->pos;
}
memcpy(buf, f->buffer + f->pos, n);
f->pos += n;
return n;
}
static int write_mem(void* data, const char* buf, int len) {
mem_file* f = (mem_file*)data;
return -1;
}
static fpos_t seek_mem(void *data, fpos_t pos, int whence) {
mem_file* f = (mem_file*)data;
long newpos = 0;
switch (whence) {
case SEEK_SET:
newpos = (long)pos;
break;
case SEEK_CUR:
newpos = (long)f->pos + (long)pos;
break;
case SEEK_END:
newpos = (long)f->size - (long)pos;
break;
default:
return -1;
break;
}
if(newpos < 0) { newpos = 0; }
if(newpos > f->size) { newpos = f->size; }
f->pos = newpos;
return newpos;
}
static int close_mem(void *data) {
mem_file* f = (mem_file*)data;
free(f);
return 0;
}
static FILE* fmemopen(const char* buffer, size_t size, const char* mode){
mem_file* f = (mem_file*)calloc(sizeof(mem_file), 1);
if(!f) return NULL;
f->buffer = buffer;
f->size = size;
return funopen(f, &read_mem, &write_mem, &seek_mem, &close_mem);
}
#endif
static size_t entries_count = sizeof(entries)/sizeof(entries[0]);
static const unsigned char* find(const char* path, size_t* length) {
size_t i;
for(i = 0; i < entries_count; i++) {
2016-06-18 17:18:14 +00:00
if(strcmp(path, entries[i].path) == 0) {
/*printf("Found in MEMFS %s\\n", path);*/
2016-06-14 13:04:48 +00:00
*length = entries[i].length;
return entries[i].content;
}
}
return NULL;
}
int codes_memfs_exists(const char* path) {
size_t dummy;
return find(path, &dummy) != NULL;
}
FILE* codes_memfs_open(const char* path) {
size_t size;
const unsigned char* mem = find(path, &size);
if(!mem) {
return fopen(path, "r");
}
return fmemopen((void*)mem, size, "r");
}
""", file=g)