1 /* $FreeBSD: head/lib/libc/iconv/citrus_pivot_factory.c 219019 2011-02-25 00:04:39Z gabor $ */
2 /* $NetBSD: citrus_pivot_factory.c,v 1.7 2009/04/12 14:20:19 lukem Exp $ */
5 * Copyright (c)2003 Citrus Project,
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30 #include <sys/cdefs.h>
31 #include <sys/queue.h>
41 #include "citrus_namespace.h"
42 #include "citrus_region.h"
43 #include "citrus_bcs.h"
44 #include "citrus_db_factory.h"
45 #include "citrus_db_hash.h"
46 #include "citrus_pivot_file.h"
47 #include "citrus_pivot_factory.h"
51 struct _citrus_db_factory *se_df;
52 STAILQ_ENTRY(src_entry) se_entry;
54 STAILQ_HEAD(src_head, src_entry);
57 find_src(struct src_head *sh, struct src_entry **rse, const char *name)
62 STAILQ_FOREACH(se, sh, se_entry) {
63 if (_bcs_strcasecmp(se->se_name, name) == 0) {
68 se = malloc(sizeof(*se));
71 se->se_name = strdup(name);
72 if (se->se_name == NULL) {
77 ret = _db_factory_create(&se->se_df, &_db_hash_std, NULL);
83 STAILQ_INSERT_TAIL(sh, se, se_entry);
90 free_src(struct src_head *sh)
94 while ((se = STAILQ_FIRST(sh)) != NULL) {
95 STAILQ_REMOVE_HEAD(sh, se_entry);
96 _db_factory_free(se->se_df);
105 convert_line(struct src_head *sh, const char *line, size_t len)
107 struct src_entry *se;
109 char key1[LINE_MAX], key2[LINE_MAX], data[LINE_MAX];
116 /* cut off trailing comment */
117 p = memchr(line, T_COMM, len);
122 line = _bcs_skip_ws_len(line, &len);
125 p = _bcs_skip_nonws_len(line, &len);
128 snprintf(key1, sizeof(key1), "%.*s", (int)(p - line), line);
131 line = _bcs_skip_ws_len(p, &len);
134 p = _bcs_skip_nonws_len(line, &len);
137 snprintf(key2, sizeof(key2), "%.*s", (int)(p - line), line);
140 line = _bcs_skip_ws_len(p, &len);
141 _bcs_trunc_rws_len(line, &len);
142 snprintf(data, sizeof(data), "%.*s", (int)len, line);
143 val = strtoul(data, &ep, 0);
148 ret = find_src(sh, &se, key1);
152 return (_db_factory_add32_by_s(se->se_df, key2, val));
156 dump_db(struct src_head *sh, struct _region *r)
158 struct _db_factory *df;
159 struct src_entry *se;
165 ret = _db_factory_create(&df, &_db_hash_std, NULL);
169 STAILQ_FOREACH(se, sh, se_entry) {
170 size = _db_factory_calc_size(se->se_df);
174 _region_init(&subr, ptr, size);
175 ret = _db_factory_serialize(se->se_df, _CITRUS_PIVOT_SUB_MAGIC,
179 ret = _db_factory_add_by_s(df, se->se_name, &subr, 1);
184 size = _db_factory_calc_size(df);
188 _region_init(r, ptr, size);
190 ret = _db_factory_serialize(df, _CITRUS_PIVOT_MAGIC, r);
195 _db_factory_free(df);
200 _citrus_pivot_factory_convert(FILE *out, FILE *in)
210 while ((line = fgetln(in, &size)) != NULL)
211 if ((ret = convert_line(&sh, line, size))) {
216 ret = dump_db(&sh, &r);
221 if (fwrite(_region_head(&r), _region_size(&r), 1, out) != 1)