003 File Manager
Current Path:
/usr/src/lib/libc/iconv
usr
/
src
/
lib
/
libc
/
iconv
/
📁
..
📄
Makefile.inc
(797 B)
📄
Symbol.map
(2.53 KB)
📄
__iconv.c
(1.6 KB)
📄
__iconv_free_list.c
(1.53 KB)
📄
__iconv_get_list.3
(3.35 KB)
📄
__iconv_get_list.c
(1.56 KB)
📄
_strtol.h
(4.79 KB)
📄
_strtoul.h
(3.55 KB)
📄
bsd_iconv.c
(7.24 KB)
📄
citrus_aliasname_local.h
(1.87 KB)
📄
citrus_bcs.c
(3.53 KB)
📄
citrus_bcs.h
(3.73 KB)
📄
citrus_bcs_strtol.c
(1.98 KB)
📄
citrus_bcs_strtoul.c
(1.99 KB)
📄
citrus_csmapper.c
(8.9 KB)
📄
citrus_csmapper.h
(2.15 KB)
📄
citrus_db.c
(8.33 KB)
📄
citrus_db.h
(2.81 KB)
📄
citrus_db_factory.c
(8.2 KB)
📄
citrus_db_factory.h
(2.6 KB)
📄
citrus_db_file.h
(2.42 KB)
📄
citrus_db_hash.c
(2.02 KB)
📄
citrus_db_hash.h
(1.6 KB)
📄
citrus_esdb.c
(8.51 KB)
📄
citrus_esdb.h
(2.13 KB)
📄
citrus_esdb_file.h
(1.92 KB)
📄
citrus_fix_grouping.h
(2.1 KB)
📄
citrus_hash.c
(1.88 KB)
📄
citrus_hash.h
(2.34 KB)
📄
citrus_iconv.c
(8.69 KB)
📄
citrus_iconv.h
(2.34 KB)
📄
citrus_iconv_local.h
(4.35 KB)
📄
citrus_lock.h
(1.58 KB)
📄
citrus_lookup.c
(7.88 KB)
📄
citrus_lookup.h
(2.43 KB)
📄
citrus_lookup_factory.c
(3.28 KB)
📄
citrus_lookup_factory.h
(1.62 KB)
📄
citrus_lookup_file.h
(1.57 KB)
📄
citrus_mapper.c
(8.33 KB)
📄
citrus_mapper.h
(4.2 KB)
📄
citrus_mapper_local.h
(3.86 KB)
📄
citrus_memstream.c
(3.81 KB)
📄
citrus_memstream.h
(5.45 KB)
📄
citrus_mmap.c
(2.6 KB)
📄
citrus_mmap.h
(1.67 KB)
📄
citrus_module.c
(8.82 KB)
📄
citrus_module.h
(2.06 KB)
📄
citrus_namespace.h
(10.2 KB)
📄
citrus_none.c
(5.63 KB)
📄
citrus_none.h
(1.63 KB)
📄
citrus_pivot_factory.c
(5.12 KB)
📄
citrus_pivot_factory.h
(1.61 KB)
📄
citrus_pivot_file.h
(1.61 KB)
📄
citrus_prop.c
(10.38 KB)
📄
citrus_prop.h
(3.23 KB)
📄
citrus_region.h
(2.97 KB)
📄
citrus_stdenc.c
(3.85 KB)
📄
citrus_stdenc.h
(3.9 KB)
📄
citrus_stdenc_local.h
(6.53 KB)
📄
citrus_stdenc_template.h
(5.65 KB)
📄
citrus_types.h
(1.68 KB)
📄
iconv-internal.h
(2.16 KB)
📄
iconv.3
(7.55 KB)
📄
iconv.c
(1.62 KB)
📄
iconv_canonicalize.3
(2.93 KB)
📄
iconv_canonicalize.c
(1.54 KB)
📄
iconv_close.c
(1.52 KB)
📄
iconv_compat.c
(3.69 KB)
📄
iconv_open.c
(1.54 KB)
📄
iconv_open_into.c
(1.57 KB)
📄
iconv_set_relocation_prefix.c
(1.57 KB)
📄
iconvctl.3
(5.66 KB)
📄
iconvctl.c
(1.53 KB)
📄
iconvlist.3
(3.24 KB)
📄
iconvlist.c
(1.57 KB)
Editing: citrus_lookup.c
/* $FreeBSD$ */ /* $NetBSD: citrus_lookup.c,v 1.7 2012/05/04 16:45:05 joerg Exp $ */ /*- * SPDX-License-Identifier: BSD-2-Clause * * 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> #include <sys/types.h> #include <assert.h> #include <dirent.h> #include <errno.h> #include <fcntl.h> #include <limits.h> #include <paths.h> #include <stdio.h> #include <stdlib.h> #include <string.h> #include <unistd.h> #include "citrus_namespace.h" #include "citrus_bcs.h" #include "citrus_region.h" #include "citrus_memstream.h" #include "citrus_mmap.h" #include "citrus_db.h" #include "citrus_db_hash.h" #include "citrus_lookup.h" #include "citrus_lookup_file.h" struct _citrus_lookup { union { struct { struct _citrus_db *db; struct _citrus_region file; int num, idx; struct _db_locator locator; } db; struct { struct _region r; struct _memstream ms; } plain; } u; #define cl_db u.db.db #define cl_dbidx u.db.idx #define cl_dbfile u.db.file #define cl_dbnum u.db.num #define cl_dblocator u.db.locator #define cl_plainr u.plain.r #define cl_plainms u.plain.ms int cl_ignore_case; int cl_rewind; char *cl_key; size_t cl_keylen; int (*cl_next)(struct _citrus_lookup *, struct _region *, struct _region *); int (*cl_lookup)(struct _citrus_lookup *, const char *, struct _region *); int (*cl_num_entries)(struct _citrus_lookup *); void (*cl_close)(struct _citrus_lookup *); }; static int seq_get_num_entries_db(struct _citrus_lookup *cl) { return (cl->cl_dbnum); } static int seq_next_db(struct _citrus_lookup *cl, struct _region *key, struct _region *data) { if (cl->cl_key) { if (key) _region_init(key, cl->cl_key, cl->cl_keylen); return (_db_lookup_by_s(cl->cl_db, cl->cl_key, data, &cl->cl_dblocator)); } if (cl->cl_rewind) { cl->cl_dbidx = 0; } cl->cl_rewind = 0; if (cl->cl_dbidx >= cl->cl_dbnum) return (ENOENT); return (_db_get_entry(cl->cl_db, cl->cl_dbidx++, key, data)); } static int seq_lookup_db(struct _citrus_lookup *cl, const char *key, struct _region *data) { cl->cl_rewind = 0; free(cl->cl_key); cl->cl_key = strdup(key); if (cl->cl_ignore_case) _bcs_convert_to_lower(cl->cl_key); cl->cl_keylen = strlen(cl->cl_key); _db_locator_init(&cl->cl_dblocator); return (_db_lookup_by_s(cl->cl_db, cl->cl_key, data, &cl->cl_dblocator)); } static void seq_close_db(struct _citrus_lookup *cl) { _db_close(cl->cl_db); _unmap_file(&cl->cl_dbfile); } static int seq_open_db(struct _citrus_lookup *cl, const char *name) { struct _region r; char path[PATH_MAX]; int ret; snprintf(path, sizeof(path), "%s.db", name); ret = _map_file(&r, path); if (ret) return (ret); ret = _db_open(&cl->cl_db, &r, _CITRUS_LOOKUP_MAGIC, _db_hash_std, NULL); if (ret) { _unmap_file(&r); return (ret); } cl->cl_dbfile = r; cl->cl_dbnum = _db_get_num_entries(cl->cl_db); cl->cl_dbidx = 0; cl->cl_rewind = 1; cl->cl_lookup = &seq_lookup_db; cl->cl_next = &seq_next_db; cl->cl_num_entries = &seq_get_num_entries_db; cl->cl_close = &seq_close_db; return (0); } #define T_COMM '#' static int seq_next_plain(struct _citrus_lookup *cl, struct _region *key, struct _region *data) { const char *p, *q; size_t len; if (cl->cl_rewind) _memstream_bind(&cl->cl_plainms, &cl->cl_plainr); cl->cl_rewind = 0; retry: p = _memstream_getln(&cl->cl_plainms, &len); if (p == NULL) return (ENOENT); /* ignore comment */ q = memchr(p, T_COMM, len); if (q) { len = q - p; } /* ignore trailing spaces */ _bcs_trunc_rws_len(p, &len); p = _bcs_skip_ws_len(p, &len); q = _bcs_skip_nonws_len(p, &len); if (p == q) goto retry; if (cl->cl_key && ((size_t)(q - p) != cl->cl_keylen || memcmp(p, cl->cl_key, (size_t)(q - p)) != 0)) goto retry; /* found a entry */ if (key) _region_init(key, __DECONST(void *, p), (size_t)(q - p)); p = _bcs_skip_ws_len(q, &len); if (data) _region_init(data, len ? __DECONST(void *, p) : NULL, len); return (0); } static int seq_get_num_entries_plain(struct _citrus_lookup *cl) { int num; num = 0; while (seq_next_plain(cl, NULL, NULL) == 0) num++; return (num); } static int seq_lookup_plain(struct _citrus_lookup *cl, const char *key, struct _region *data) { size_t len; const char *p; cl->cl_rewind = 0; free(cl->cl_key); cl->cl_key = strdup(key); if (cl->cl_ignore_case) _bcs_convert_to_lower(cl->cl_key); cl->cl_keylen = strlen(cl->cl_key); _memstream_bind(&cl->cl_plainms, &cl->cl_plainr); p = _memstream_matchline(&cl->cl_plainms, cl->cl_key, &len, 0); if (p == NULL) return (ENOENT); if (data) _region_init(data, __DECONST(void *, p), len); return (0); } static void seq_close_plain(struct _citrus_lookup *cl) { _unmap_file(&cl->cl_plainr); } static int seq_open_plain(struct _citrus_lookup *cl, const char *name) { int ret; /* open read stream */ ret = _map_file(&cl->cl_plainr, name); if (ret) return (ret); cl->cl_rewind = 1; cl->cl_next = &seq_next_plain; cl->cl_lookup = &seq_lookup_plain; cl->cl_num_entries = &seq_get_num_entries_plain; cl->cl_close = &seq_close_plain; return (0); } int _citrus_lookup_seq_open(struct _citrus_lookup **rcl, const char *name, int ignore_case) { int ret; struct _citrus_lookup *cl; cl = malloc(sizeof(*cl)); if (cl == NULL) return (errno); cl->cl_key = NULL; cl->cl_keylen = 0; cl->cl_ignore_case = ignore_case; ret = seq_open_db(cl, name); if (ret == ENOENT) ret = seq_open_plain(cl, name); if (!ret) *rcl = cl; else free(cl); return (ret); } void _citrus_lookup_seq_rewind(struct _citrus_lookup *cl) { cl->cl_rewind = 1; free(cl->cl_key); cl->cl_key = NULL; cl->cl_keylen = 0; } int _citrus_lookup_seq_next(struct _citrus_lookup *cl, struct _region *key, struct _region *data) { return ((*cl->cl_next)(cl, key, data)); } int _citrus_lookup_seq_lookup(struct _citrus_lookup *cl, const char *key, struct _region *data) { return ((*cl->cl_lookup)(cl, key, data)); } int _citrus_lookup_get_number_of_entries(struct _citrus_lookup *cl) { return ((*cl->cl_num_entries)(cl)); } void _citrus_lookup_seq_close(struct _citrus_lookup *cl) { free(cl->cl_key); (*cl->cl_close)(cl); free(cl); } char * _citrus_lookup_simple(const char *name, const char *key, char *linebuf, size_t linebufsize, int ignore_case) { struct _citrus_lookup *cl; struct _region data; int ret; ret = _citrus_lookup_seq_open(&cl, name, ignore_case); if (ret) return (NULL); ret = _citrus_lookup_seq_lookup(cl, key, &data); if (ret) { _citrus_lookup_seq_close(cl); return (NULL); } snprintf(linebuf, linebufsize, "%.*s", (int)_region_size(&data), (const char *)_region_head(&data)); _citrus_lookup_seq_close(cl); return (linebuf); }
Upload File
Create Folder