2 /* $NetBSD: citrus_pivot_factory.c,v 1.7 2009/04/12 14:20:19 lukem Exp $ */
5 * SPDX-License-Identifier: BSD-2-Clause
7 * Copyright (c)2003 Citrus Project,
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
19 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 #include <sys/cdefs.h>
33 #include <sys/queue.h>
43 #include "citrus_namespace.h"
44 #include "citrus_region.h"
45 #include "citrus_bcs.h"
46 #include "citrus_db_factory.h"
47 #include "citrus_db_hash.h"
48 #include "citrus_pivot_file.h"
49 #include "citrus_pivot_factory.h"
53 struct _citrus_db_factory *se_df;
54 STAILQ_ENTRY(src_entry) se_entry;
56 STAILQ_HEAD(src_head, src_entry);
59 find_src(struct src_head *sh, struct src_entry **rse, const char *name)
64 STAILQ_FOREACH(se, sh, se_entry) {
65 if (_bcs_strcasecmp(se->se_name, name) == 0) {
70 se = malloc(sizeof(*se));
73 se->se_name = strdup(name);
74 if (se->se_name == NULL) {
79 ret = _db_factory_create(&se->se_df, &_db_hash_std, NULL);
85 STAILQ_INSERT_TAIL(sh, se, se_entry);
92 free_src(struct src_head *sh)
96 while ((se = STAILQ_FIRST(sh)) != NULL) {
97 STAILQ_REMOVE_HEAD(sh, se_entry);
98 _db_factory_free(se->se_df);
107 convert_line(struct src_head *sh, const char *line, size_t len)
109 struct src_entry *se;
111 char key1[LINE_MAX], key2[LINE_MAX], data[LINE_MAX];
118 /* cut off trailing comment */
119 p = memchr(line, T_COMM, len);
124 line = _bcs_skip_ws_len(line, &len);
127 p = _bcs_skip_nonws_len(line, &len);
130 snprintf(key1, sizeof(key1), "%.*s", (int)(p - line), line);
133 line = _bcs_skip_ws_len(p, &len);
136 p = _bcs_skip_nonws_len(line, &len);
139 snprintf(key2, sizeof(key2), "%.*s", (int)(p - line), line);
142 line = _bcs_skip_ws_len(p, &len);
143 _bcs_trunc_rws_len(line, &len);
144 snprintf(data, sizeof(data), "%.*s", (int)len, line);
145 val = strtoul(data, &ep, 0);
150 ret = find_src(sh, &se, key1);
154 return (_db_factory_add32_by_s(se->se_df, key2, val));
158 dump_db(struct src_head *sh, struct _region *r)
160 struct _db_factory *df;
161 struct src_entry *se;
167 ret = _db_factory_create(&df, &_db_hash_std, NULL);
171 STAILQ_FOREACH(se, sh, se_entry) {
172 size = _db_factory_calc_size(se->se_df);
176 _region_init(&subr, ptr, size);
177 ret = _db_factory_serialize(se->se_df, _CITRUS_PIVOT_SUB_MAGIC,
181 ret = _db_factory_add_by_s(df, se->se_name, &subr, 1);
186 size = _db_factory_calc_size(df);
190 _region_init(r, ptr, size);
192 ret = _db_factory_serialize(df, _CITRUS_PIVOT_MAGIC, r);
197 _db_factory_free(df);
202 _citrus_pivot_factory_convert(FILE *out, FILE *in)
212 while ((line = fgetln(in, &size)) != NULL)
213 if ((ret = convert_line(&sh, line, size))) {
218 ret = dump_db(&sh, &r);
223 if (fwrite(_region_head(&r), _region_size(&r), 1, out) != 1)