This patch imports the unmodified current version of NetBSD libc. The NetBSD includes are in /nbsd_include, while the libc code itself is split between lib/nbsd_libc and common/lib/libc.
263 lines
7.1 KiB
C
263 lines
7.1 KiB
C
/* $NetBSD: citrus_mapper_serial.c,v 1.2 2003/07/12 15:39:20 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_serial.c,v 1.2 2003/07/12 15:39:20 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_serial.h"
|
|
|
|
/* ---------------------------------------------------------------------- */
|
|
|
|
_CITRUS_MAPPER_DECLS(mapper_serial);
|
|
_CITRUS_MAPPER_DEF_OPS(mapper_serial);
|
|
|
|
#define _citrus_mapper_parallel_mapper_init \
|
|
_citrus_mapper_serial_mapper_init
|
|
#define _citrus_mapper_parallel_mapper_uninit \
|
|
_citrus_mapper_serial_mapper_uninit
|
|
#define _citrus_mapper_parallel_mapper_init_state \
|
|
_citrus_mapper_serial_mapper_init_state
|
|
static int _citrus_mapper_parallel_mapper_convert(
|
|
struct _citrus_mapper * __restrict, _index_t * __restrict, _index_t,
|
|
void * __restrict);
|
|
_CITRUS_MAPPER_DEF_OPS(mapper_parallel);
|
|
#undef _citrus_mapper_parallel_mapper_init
|
|
#undef _citrus_mapper_parallel_mapper_uninit
|
|
#undef _citrus_mapper_parallel_mapper_init_state
|
|
|
|
|
|
/* ---------------------------------------------------------------------- */
|
|
|
|
struct maplink {
|
|
SIMPLEQ_ENTRY(maplink) ml_entry;
|
|
struct _mapper *ml_mapper;
|
|
};
|
|
SIMPLEQ_HEAD(maplist, maplink);
|
|
|
|
struct _citrus_mapper_serial {
|
|
struct maplist sr_mappers;
|
|
};
|
|
|
|
int
|
|
_citrus_mapper_serial_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_serial_mapper_ops,
|
|
sizeof(_citrus_mapper_serial_mapper_ops));
|
|
|
|
return 0;
|
|
}
|
|
|
|
int
|
|
_citrus_mapper_parallel_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_parallel_mapper_ops,
|
|
sizeof(_citrus_mapper_parallel_mapper_ops));
|
|
|
|
return 0;
|
|
}
|
|
|
|
static void
|
|
uninit(struct _citrus_mapper_serial *sr)
|
|
{
|
|
struct maplink *ml;
|
|
|
|
while ((ml = SIMPLEQ_FIRST(&sr->sr_mappers)) != NULL) {
|
|
SIMPLEQ_REMOVE_HEAD(&sr->sr_mappers, ml_entry);
|
|
_mapper_close(ml->ml_mapper);
|
|
free(ml);
|
|
}
|
|
}
|
|
|
|
static int
|
|
parse_var(struct _citrus_mapper_area *__restrict ma,
|
|
struct _citrus_mapper_serial *sr, struct _memstream *ms)
|
|
{
|
|
int ret;
|
|
struct _region r;
|
|
char mapname[PATH_MAX];
|
|
struct maplink *ml;
|
|
|
|
SIMPLEQ_INIT(&sr->sr_mappers);
|
|
while (1) {
|
|
/* remove beginning white spaces */
|
|
_memstream_skip_ws(ms);
|
|
if (_memstream_iseof(ms))
|
|
break;
|
|
/* cut down a mapper name */
|
|
_memstream_chr(ms, &r, ',');
|
|
snprintf(mapname, sizeof(mapname), "%.*s",
|
|
(int)_region_size(&r), (char *)_region_head(&r));
|
|
/* remove trailing white spaces */
|
|
mapname[_bcs_skip_nonws(mapname)-mapname] = '\0';
|
|
/* create a new mapper record */
|
|
ml = malloc(sizeof(*ml));
|
|
if (ml == NULL)
|
|
return errno;
|
|
ret = _mapper_open(ma, &ml->ml_mapper, mapname);
|
|
if (ret) {
|
|
free(ml);
|
|
return ret;
|
|
}
|
|
/* support only 1:1 and stateless converter */
|
|
if (_mapper_get_src_max(ml->ml_mapper) != 1 ||
|
|
_mapper_get_dst_max(ml->ml_mapper) != 1 ||
|
|
_mapper_get_state_size(ml->ml_mapper) != 0) {
|
|
free(ml);
|
|
return EINVAL;
|
|
}
|
|
SIMPLEQ_INSERT_TAIL(&sr->sr_mappers, ml, ml_entry);
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
static int
|
|
/*ARGSUSED*/
|
|
_citrus_mapper_serial_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_serial *sr;
|
|
struct _memstream ms;
|
|
struct _region r;
|
|
|
|
_DIAGASSERT(cm && dir && mt);
|
|
|
|
if (lenmt<sizeof(*mt))
|
|
return EINVAL;
|
|
|
|
sr = malloc(sizeof(*sr));
|
|
if (sr == NULL)
|
|
return errno;
|
|
|
|
_region_init(&r, (void *)var, lenvar);
|
|
_memstream_bind(&ms, &r);
|
|
if (parse_var(ma, sr, &ms)) {
|
|
uninit(sr);
|
|
free(sr);
|
|
return EINVAL;
|
|
}
|
|
cm->cm_closure = sr;
|
|
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_serial_mapper_uninit(struct _citrus_mapper *cm)
|
|
{
|
|
if (cm && cm->cm_closure) {
|
|
uninit(cm->cm_closure);
|
|
free(cm->cm_closure);
|
|
}
|
|
}
|
|
|
|
static int
|
|
/*ARGSUSED*/
|
|
_citrus_mapper_serial_mapper_convert(struct _citrus_mapper * __restrict cm,
|
|
_index_t * __restrict dst, _index_t src,
|
|
void * __restrict ps)
|
|
{
|
|
int ret;
|
|
struct _citrus_mapper_serial *sr;
|
|
struct maplink *ml;
|
|
|
|
_DIAGASSERT(cm && cm->cm_closure);
|
|
|
|
sr = cm->cm_closure;
|
|
SIMPLEQ_FOREACH(ml, &sr->sr_mappers, ml_entry) {
|
|
ret = _mapper_convert(ml->ml_mapper, &src, src, NULL);
|
|
if (ret != _MAPPER_CONVERT_SUCCESS)
|
|
return ret;
|
|
}
|
|
*dst = src;
|
|
return _MAPPER_CONVERT_SUCCESS;
|
|
}
|
|
|
|
static int
|
|
/*ARGSUSED*/
|
|
_citrus_mapper_parallel_mapper_convert(struct _citrus_mapper * __restrict cm,
|
|
_index_t * __restrict dst, _index_t src,
|
|
void * __restrict ps)
|
|
{
|
|
int ret;
|
|
struct _citrus_mapper_serial *sr;
|
|
struct maplink *ml;
|
|
_index_t tmp;
|
|
|
|
_DIAGASSERT(cm && cm->cm_closure);
|
|
|
|
sr = cm->cm_closure;
|
|
SIMPLEQ_FOREACH(ml, &sr->sr_mappers, ml_entry) {
|
|
ret = _mapper_convert(ml->ml_mapper, &tmp, src, NULL);
|
|
if (ret == _MAPPER_CONVERT_SUCCESS) {
|
|
*dst = tmp;
|
|
return _MAPPER_CONVERT_SUCCESS;
|
|
} else if (ret == _MAPPER_CONVERT_ILSEQ)
|
|
return _MAPPER_CONVERT_ILSEQ;
|
|
}
|
|
return _MAPPER_CONVERT_NONIDENTICAL;
|
|
}
|
|
|
|
static void
|
|
/*ARGSUSED*/
|
|
_citrus_mapper_serial_mapper_init_state(struct _citrus_mapper * __restrict cm,
|
|
void * __restrict ps)
|
|
{
|
|
}
|