260 lines
6.2 KiB
C
260 lines
6.2 KiB
C
|
/* $NetBSD: citrus_mapper_646.c,v 1.4 2003/07/14 11:37:49 tshiozak Exp $ */
|
||
|
|
||
|
/*-
|
||
|
* Copyright (c)2003 Citrus Project,
|
||
|
* All rights reserved.
|
||
|
*
|
||
|
* Redistribution and use in source and binary forms, with or without
|
||
|
* modification, are permitted provided that the following conditions
|
||
|
* are met:
|
||
|
* 1. Redistributions of source code must retain the above copyright
|
||
|
* notice, this list of conditions and the following disclaimer.
|
||
|
* 2. Redistributions in binary form must reproduce the above copyright
|
||
|
* notice, this list of conditions and the following disclaimer in the
|
||
|
* documentation and/or other materials provided with the distribution.
|
||
|
*
|
||
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
|
||
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
||
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
||
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
|
||
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
||
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
||
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
||
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
||
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
||
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
||
|
* SUCH DAMAGE.
|
||
|
*/
|
||
|
|
||
|
#include <sys/cdefs.h>
|
||
|
#if defined(LIBC_SCCS) && !defined(lint)
|
||
|
__RCSID("$NetBSD: citrus_mapper_646.c,v 1.4 2003/07/14 11:37:49 tshiozak Exp $");
|
||
|
#endif /* LIBC_SCCS and not lint */
|
||
|
|
||
|
#include <assert.h>
|
||
|
#include <errno.h>
|
||
|
#include <stdio.h>
|
||
|
#include <stdlib.h>
|
||
|
#include <string.h>
|
||
|
#include <limits.h>
|
||
|
#include <sys/queue.h>
|
||
|
|
||
|
#include "citrus_namespace.h"
|
||
|
#include "citrus_types.h"
|
||
|
#include "citrus_bcs.h"
|
||
|
#include "citrus_module.h"
|
||
|
#include "citrus_region.h"
|
||
|
#include "citrus_memstream.h"
|
||
|
#include "citrus_mmap.h"
|
||
|
#include "citrus_hash.h"
|
||
|
#include "citrus_mapper.h"
|
||
|
#include "citrus_mapper_646.h"
|
||
|
|
||
|
/* ---------------------------------------------------------------------- */
|
||
|
|
||
|
_CITRUS_MAPPER_DECLS(mapper_646);
|
||
|
_CITRUS_MAPPER_DEF_OPS(mapper_646);
|
||
|
|
||
|
/* ---------------------------------------------------------------------- */
|
||
|
|
||
|
#define ILSEQ 0xFFFFFFFE
|
||
|
#define INVALID 0xFFFFFFFF
|
||
|
#define SPECIALS(x) \
|
||
|
x(0x23) \
|
||
|
x(0x24) \
|
||
|
x(0x40) \
|
||
|
x(0x5B) \
|
||
|
x(0x5C) \
|
||
|
x(0x5D) \
|
||
|
x(0x5E) \
|
||
|
x(0x60) \
|
||
|
x(0x7B) \
|
||
|
x(0x7C) \
|
||
|
x(0x7D) \
|
||
|
x(0x7E)
|
||
|
|
||
|
#define INDEX(x) INDEX_##x,
|
||
|
|
||
|
enum {
|
||
|
SPECIALS(INDEX)
|
||
|
NUM_OF_SPECIALS
|
||
|
};
|
||
|
struct _citrus_mapper_646 {
|
||
|
int m6_forward;
|
||
|
_index_t m6_map[NUM_OF_SPECIALS];
|
||
|
};
|
||
|
|
||
|
int
|
||
|
_citrus_mapper_646_mapper_getops(struct _citrus_mapper_ops *ops,
|
||
|
size_t lenops, uint32_t expected_version)
|
||
|
{
|
||
|
if (expected_version<_CITRUS_MAPPER_ABI_VERSION || lenops<sizeof(*ops))
|
||
|
return EINVAL;
|
||
|
|
||
|
memcpy(ops, &_citrus_mapper_646_mapper_ops,
|
||
|
sizeof(_citrus_mapper_646_mapper_ops));
|
||
|
|
||
|
return 0;
|
||
|
}
|
||
|
|
||
|
#define T_COMM '#'
|
||
|
static int
|
||
|
parse_file(struct _citrus_mapper_646 *m6, const char *path)
|
||
|
{
|
||
|
int ret, i;
|
||
|
struct _region r;
|
||
|
struct _memstream ms;
|
||
|
const char *p;
|
||
|
size_t len;
|
||
|
char buf[PATH_MAX];
|
||
|
|
||
|
ret = _map_file(&r, path);
|
||
|
if (ret)
|
||
|
return ret;
|
||
|
_memstream_bind(&ms, &r);
|
||
|
for (i=0; i<NUM_OF_SPECIALS; i++) {
|
||
|
retry:
|
||
|
p = _memstream_getln(&ms, &len);
|
||
|
if (p==NULL) {
|
||
|
ret = EINVAL;
|
||
|
break;
|
||
|
}
|
||
|
p = _bcs_skip_ws_len(p, &len);
|
||
|
if (*p == T_COMM || len==0)
|
||
|
goto retry;
|
||
|
if (!_bcs_isdigit(*p)) {
|
||
|
ret = EINVAL;
|
||
|
break;
|
||
|
}
|
||
|
snprintf(buf, sizeof(buf), "%.*s", (int)len, p);
|
||
|
m6->m6_map[i] = strtoul(buf, (char **)&p, 0);
|
||
|
p = _bcs_skip_ws(buf);
|
||
|
if (*p != T_COMM && !*p) {
|
||
|
ret = EINVAL;
|
||
|
break;
|
||
|
}
|
||
|
}
|
||
|
_unmap_file(&r);
|
||
|
|
||
|
return ret;
|
||
|
};
|
||
|
|
||
|
static int
|
||
|
parse_var(struct _citrus_mapper_646 *m6, struct _memstream *ms,
|
||
|
const char *dir)
|
||
|
{
|
||
|
struct _region r;
|
||
|
char path[PATH_MAX];
|
||
|
|
||
|
m6->m6_forward = 1;
|
||
|
_memstream_skip_ws(ms);
|
||
|
/* whether backward */
|
||
|
if (_memstream_peek(ms) == '!') {
|
||
|
_memstream_getc(ms);
|
||
|
m6->m6_forward = 0;
|
||
|
}
|
||
|
/* get description file path */
|
||
|
_memstream_getregion(ms, &r, _memstream_remainder(ms));
|
||
|
snprintf(path, sizeof(path), "%s/%.*s",
|
||
|
dir, (int)_region_size(&r), (char *)_region_head(&r));
|
||
|
/* remove trailing white spaces */
|
||
|
path[_bcs_skip_nonws(path)-path] = '\0';
|
||
|
return parse_file(m6, path);
|
||
|
}
|
||
|
|
||
|
static int
|
||
|
/*ARGSUSED*/
|
||
|
_citrus_mapper_646_mapper_init(struct _citrus_mapper_area *__restrict ma,
|
||
|
struct _citrus_mapper * __restrict cm,
|
||
|
const char * __restrict dir,
|
||
|
const void * __restrict var, size_t lenvar,
|
||
|
struct _citrus_mapper_traits * __restrict mt,
|
||
|
size_t lenmt)
|
||
|
{
|
||
|
struct _citrus_mapper_646 *m6;
|
||
|
struct _memstream ms;
|
||
|
struct _region r;
|
||
|
int ret;
|
||
|
|
||
|
_DIAGASSERT(cm && dir && mt);
|
||
|
|
||
|
if (lenmt<sizeof(*mt))
|
||
|
return EINVAL;
|
||
|
|
||
|
m6 = malloc(sizeof(*m6));
|
||
|
if (m6 == NULL)
|
||
|
return errno;
|
||
|
|
||
|
_region_init(&r, (void *)var, lenvar);
|
||
|
_memstream_bind(&ms, &r);
|
||
|
ret = parse_var(m6, &ms, dir);
|
||
|
if (ret) {
|
||
|
free(m6);
|
||
|
return ret;
|
||
|
}
|
||
|
|
||
|
cm->cm_closure = m6;
|
||
|
mt->mt_src_max = mt->mt_dst_max = 1; /* 1:1 converter */
|
||
|
mt->mt_state_size = 0; /* stateless */
|
||
|
|
||
|
return 0;
|
||
|
}
|
||
|
|
||
|
static void
|
||
|
/*ARGSUSED*/
|
||
|
_citrus_mapper_646_mapper_uninit(struct _citrus_mapper *cm)
|
||
|
{
|
||
|
if (cm && cm->cm_closure) {
|
||
|
free(cm->cm_closure);
|
||
|
}
|
||
|
}
|
||
|
|
||
|
static int
|
||
|
/*ARGSUSED*/
|
||
|
_citrus_mapper_646_mapper_convert(struct _citrus_mapper * __restrict cm,
|
||
|
_index_t * __restrict dst, _index_t src,
|
||
|
void * __restrict ps)
|
||
|
{
|
||
|
struct _citrus_mapper_646 *m6;
|
||
|
|
||
|
_DIAGASSERT(cm && cm->cm_closure);
|
||
|
|
||
|
m6 = cm->cm_closure;
|
||
|
if (m6->m6_forward) {
|
||
|
/* forward */
|
||
|
if (src>=0x80)
|
||
|
return _MAPPER_CONVERT_ILSEQ;
|
||
|
#define FORWARD(x) \
|
||
|
if (src==(x)) { \
|
||
|
if (m6->m6_map[INDEX_##x]==INVALID) \
|
||
|
return _MAPPER_CONVERT_NONIDENTICAL; \
|
||
|
*dst = m6->m6_map[INDEX_##x]; \
|
||
|
return 0; \
|
||
|
} else
|
||
|
SPECIALS(FORWARD);
|
||
|
*dst = src;
|
||
|
} else {
|
||
|
/* backward */
|
||
|
#define BACKWARD(x) \
|
||
|
if (m6->m6_map[INDEX_##x]!=INVALID && src==m6->m6_map[INDEX_##x]) { \
|
||
|
*dst = (x); \
|
||
|
return 0; \
|
||
|
} else if (src==(x)) \
|
||
|
return _MAPPER_CONVERT_ILSEQ; \
|
||
|
else
|
||
|
SPECIALS(BACKWARD);
|
||
|
if (src>=0x80)
|
||
|
return _MAPPER_CONVERT_NONIDENTICAL;
|
||
|
*dst = src;
|
||
|
}
|
||
|
|
||
|
return _MAPPER_CONVERT_SUCCESS;
|
||
|
}
|
||
|
|
||
|
static void
|
||
|
/*ARGSUSED*/
|
||
|
_citrus_mapper_646_mapper_init_state(struct _citrus_mapper * __restrict cm,
|
||
|
void * __restrict ps)
|
||
|
{
|
||
|
}
|