51de74d520
- cbi.js: make sure to treat single bytes as signed char when handling end cases - template_lmo.c: make sure to treat single bytes as signed char when handling end cases, avoids hash miscalculations on ARM Signed-off-by: Jo-Philipp Wich <jo@mein.io>
342 lines
6.1 KiB
C
342 lines
6.1 KiB
C
/*
|
|
* lmo - Lua Machine Objects - Base functions
|
|
*
|
|
* Copyright (C) 2009-2010 Jo-Philipp Wich <jow@openwrt.org>
|
|
*
|
|
* Licensed under the Apache License, Version 2.0 (the "License");
|
|
* you may not use this file except in compliance with the License.
|
|
* You may obtain a copy of the License at
|
|
*
|
|
* http://www.apache.org/licenses/LICENSE-2.0
|
|
*
|
|
* Unless required by applicable law or agreed to in writing, software
|
|
* distributed under the License is distributed on an "AS IS" BASIS,
|
|
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
* See the License for the specific language governing permissions and
|
|
* limitations under the License.
|
|
*/
|
|
|
|
#include "template_lmo.h"
|
|
|
|
/*
|
|
* Hash function from http://www.azillionmonkeys.com/qed/hash.html
|
|
* Copyright (C) 2004-2008 by Paul Hsieh
|
|
*/
|
|
|
|
uint32_t sfh_hash(const char *data, int len)
|
|
{
|
|
uint32_t hash = len, tmp;
|
|
int rem;
|
|
|
|
if (len <= 0 || data == NULL) return 0;
|
|
|
|
rem = len & 3;
|
|
len >>= 2;
|
|
|
|
/* Main loop */
|
|
for (;len > 0; len--) {
|
|
hash += sfh_get16(data);
|
|
tmp = (sfh_get16(data+2) << 11) ^ hash;
|
|
hash = (hash << 16) ^ tmp;
|
|
data += 2*sizeof(uint16_t);
|
|
hash += hash >> 11;
|
|
}
|
|
|
|
/* Handle end cases */
|
|
switch (rem) {
|
|
case 3: hash += sfh_get16(data);
|
|
hash ^= hash << 16;
|
|
hash ^= (signed char)data[sizeof(uint16_t)] << 18;
|
|
hash += hash >> 11;
|
|
break;
|
|
case 2: hash += sfh_get16(data);
|
|
hash ^= hash << 11;
|
|
hash += hash >> 17;
|
|
break;
|
|
case 1: hash += (signed char)*data;
|
|
hash ^= hash << 10;
|
|
hash += hash >> 1;
|
|
}
|
|
|
|
/* Force "avalanching" of final 127 bits */
|
|
hash ^= hash << 3;
|
|
hash += hash >> 5;
|
|
hash ^= hash << 4;
|
|
hash += hash >> 17;
|
|
hash ^= hash << 25;
|
|
hash += hash >> 6;
|
|
|
|
return hash;
|
|
}
|
|
|
|
uint32_t lmo_canon_hash(const char *str, int len)
|
|
{
|
|
char res[4096];
|
|
char *ptr, prev;
|
|
int off;
|
|
|
|
if (!str || len >= sizeof(res))
|
|
return 0;
|
|
|
|
for (prev = ' ', ptr = res, off = 0; off < len; prev = *str, off++, str++)
|
|
{
|
|
if (isspace(*str))
|
|
{
|
|
if (!isspace(prev))
|
|
*ptr++ = ' ';
|
|
}
|
|
else
|
|
{
|
|
*ptr++ = *str;
|
|
}
|
|
}
|
|
|
|
if ((ptr > res) && isspace(*(ptr-1)))
|
|
ptr--;
|
|
|
|
return sfh_hash(res, ptr - res);
|
|
}
|
|
|
|
lmo_archive_t * lmo_open(const char *file)
|
|
{
|
|
int in = -1;
|
|
uint32_t idx_offset = 0;
|
|
struct stat s;
|
|
|
|
lmo_archive_t *ar = NULL;
|
|
|
|
if (stat(file, &s) == -1)
|
|
goto err;
|
|
|
|
if ((in = open(file, O_RDONLY)) == -1)
|
|
goto err;
|
|
|
|
if ((ar = (lmo_archive_t *)malloc(sizeof(*ar))) != NULL)
|
|
{
|
|
memset(ar, 0, sizeof(*ar));
|
|
|
|
ar->fd = in;
|
|
ar->size = s.st_size;
|
|
|
|
fcntl(ar->fd, F_SETFD, fcntl(ar->fd, F_GETFD) | FD_CLOEXEC);
|
|
|
|
if ((ar->mmap = mmap(NULL, ar->size, PROT_READ, MAP_SHARED, ar->fd, 0)) == MAP_FAILED)
|
|
goto err;
|
|
|
|
idx_offset = ntohl(*((const uint32_t *)
|
|
(ar->mmap + ar->size - sizeof(uint32_t))));
|
|
|
|
if (idx_offset >= ar->size)
|
|
goto err;
|
|
|
|
ar->index = (lmo_entry_t *)(ar->mmap + idx_offset);
|
|
ar->length = (ar->size - idx_offset - sizeof(uint32_t)) / sizeof(lmo_entry_t);
|
|
ar->end = ar->mmap + ar->size;
|
|
|
|
return ar;
|
|
}
|
|
|
|
err:
|
|
if (in > -1)
|
|
close(in);
|
|
|
|
if (ar != NULL)
|
|
{
|
|
if ((ar->mmap != NULL) && (ar->mmap != MAP_FAILED))
|
|
munmap(ar->mmap, ar->size);
|
|
|
|
free(ar);
|
|
}
|
|
|
|
return NULL;
|
|
}
|
|
|
|
void lmo_close(lmo_archive_t *ar)
|
|
{
|
|
if (ar != NULL)
|
|
{
|
|
if ((ar->mmap != NULL) && (ar->mmap != MAP_FAILED))
|
|
munmap(ar->mmap, ar->size);
|
|
|
|
close(ar->fd);
|
|
free(ar);
|
|
|
|
ar = NULL;
|
|
}
|
|
}
|
|
|
|
|
|
lmo_catalog_t *_lmo_catalogs = NULL;
|
|
lmo_catalog_t *_lmo_active_catalog = NULL;
|
|
|
|
int lmo_load_catalog(const char *lang, const char *dir)
|
|
{
|
|
DIR *dh = NULL;
|
|
char pattern[16];
|
|
char path[PATH_MAX];
|
|
struct dirent *de = NULL;
|
|
|
|
lmo_archive_t *ar = NULL;
|
|
lmo_catalog_t *cat = NULL;
|
|
|
|
if (!lmo_change_catalog(lang))
|
|
return 0;
|
|
|
|
if (!dir || !(dh = opendir(dir)))
|
|
goto err;
|
|
|
|
if (!(cat = malloc(sizeof(*cat))))
|
|
goto err;
|
|
|
|
memset(cat, 0, sizeof(*cat));
|
|
|
|
snprintf(cat->lang, sizeof(cat->lang), "%s", lang);
|
|
snprintf(pattern, sizeof(pattern), "*.%s.lmo", lang);
|
|
|
|
while ((de = readdir(dh)) != NULL)
|
|
{
|
|
if (!fnmatch(pattern, de->d_name, 0))
|
|
{
|
|
snprintf(path, sizeof(path), "%s/%s", dir, de->d_name);
|
|
ar = lmo_open(path);
|
|
|
|
if (ar)
|
|
{
|
|
ar->next = cat->archives;
|
|
cat->archives = ar;
|
|
}
|
|
}
|
|
}
|
|
|
|
closedir(dh);
|
|
|
|
cat->next = _lmo_catalogs;
|
|
_lmo_catalogs = cat;
|
|
|
|
if (!_lmo_active_catalog)
|
|
_lmo_active_catalog = cat;
|
|
|
|
return cat->archives ? 0 : -1;
|
|
|
|
err:
|
|
if (dh) closedir(dh);
|
|
if (cat) free(cat);
|
|
|
|
return -1;
|
|
}
|
|
|
|
int lmo_change_catalog(const char *lang)
|
|
{
|
|
lmo_catalog_t *cat;
|
|
|
|
for (cat = _lmo_catalogs; cat; cat = cat->next)
|
|
{
|
|
if (!strncmp(cat->lang, lang, sizeof(cat->lang)))
|
|
{
|
|
_lmo_active_catalog = cat;
|
|
return 0;
|
|
}
|
|
}
|
|
|
|
return -1;
|
|
}
|
|
|
|
static lmo_entry_t * lmo_find_entry(lmo_archive_t *ar, uint32_t hash)
|
|
{
|
|
unsigned int m, l, r;
|
|
uint32_t k;
|
|
|
|
l = 0;
|
|
r = ar->length - 1;
|
|
|
|
while (1)
|
|
{
|
|
m = l + ((r - l) / 2);
|
|
|
|
if (r < l)
|
|
break;
|
|
|
|
k = ntohl(ar->index[m].key_id);
|
|
|
|
if (k == hash)
|
|
return &ar->index[m];
|
|
|
|
if (k > hash)
|
|
{
|
|
if (!m)
|
|
break;
|
|
|
|
r = m - 1;
|
|
}
|
|
else
|
|
{
|
|
l = m + 1;
|
|
}
|
|
}
|
|
|
|
return NULL;
|
|
}
|
|
|
|
int lmo_translate(const char *key, int keylen, char **out, int *outlen)
|
|
{
|
|
uint32_t hash;
|
|
lmo_entry_t *e;
|
|
lmo_archive_t *ar;
|
|
|
|
if (!key || !_lmo_active_catalog)
|
|
return -2;
|
|
|
|
hash = lmo_canon_hash(key, keylen);
|
|
|
|
for (ar = _lmo_active_catalog->archives; ar; ar = ar->next)
|
|
{
|
|
if ((e = lmo_find_entry(ar, hash)) != NULL)
|
|
{
|
|
*out = ar->mmap + ntohl(e->offset);
|
|
*outlen = ntohl(e->length);
|
|
return 0;
|
|
}
|
|
}
|
|
|
|
return -1;
|
|
}
|
|
|
|
void lmo_iterate(lmo_iterate_cb_t cb, void *priv)
|
|
{
|
|
unsigned int i;
|
|
lmo_entry_t *e;
|
|
lmo_archive_t *ar;
|
|
|
|
if (!_lmo_active_catalog)
|
|
return;
|
|
|
|
for (ar = _lmo_active_catalog->archives; ar; ar = ar->next)
|
|
for (i = 0, e = &ar->index[0]; i < ar->length; e = &ar->index[++i])
|
|
cb(ntohl(e->key_id), ar->mmap + ntohl(e->offset), ntohl(e->length), priv);
|
|
}
|
|
|
|
void lmo_close_catalog(const char *lang)
|
|
{
|
|
lmo_archive_t *ar, *next;
|
|
lmo_catalog_t *cat, *prev;
|
|
|
|
for (prev = NULL, cat = _lmo_catalogs; cat; prev = cat, cat = cat->next)
|
|
{
|
|
if (!strncmp(cat->lang, lang, sizeof(cat->lang)))
|
|
{
|
|
if (prev)
|
|
prev->next = cat->next;
|
|
else
|
|
_lmo_catalogs = cat->next;
|
|
|
|
for (ar = cat->archives; ar; ar = next)
|
|
{
|
|
next = ar->next;
|
|
lmo_close(ar);
|
|
}
|
|
|
|
free(cat);
|
|
break;
|
|
}
|
|
}
|
|
}
|