1/* $FreeBSD$ */
2/* $NetBSD: citrus_lookup_factory.c,v 1.4 2003/10/27 00:12:42 lukem Exp $ */
3
4/*-
5 * SPDX-License-Identifier: BSD-2-Clause
6 *
7 * Copyright (c)2003 Citrus Project,
8 * All rights reserved.
9 *
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
12 * are met:
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.
18 *
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
29 * SUCH DAMAGE.
30 */
31
32#include <sys/cdefs.h>
33
34#include <assert.h>
35#include <ctype.h>
36#include <errno.h>
37#include <limits.h>
38#include <stdio.h>
39#include <stdlib.h>
40#include <string.h>
41
42#include "citrus_namespace.h"
43#include "citrus_region.h"
44#include "citrus_bcs.h"
45#include "citrus_db_factory.h"
46#include "citrus_db_hash.h"
47#include "citrus_lookup_factory.h"
48#include "citrus_lookup_file.h"
49
50#define T_COMM '#'
51static int
52convert_line(struct _citrus_db_factory *df, const char *line, size_t len)
53{
54	const char *p;
55	char data[LINE_MAX], key[LINE_MAX];
56
57	/* cut off trailing comment */
58	p = memchr(line, T_COMM, len);
59	if (p)
60		len = p - line;
61
62	/* key */
63	line = _bcs_skip_ws_len(line, &len);
64	if (len == 0)
65		return (0);
66	p = _bcs_skip_nonws_len(line, &len);
67	if (p == line)
68		return (0);
69	snprintf(key, sizeof(key), "%.*s", (int)(p-line), line);
70	_bcs_convert_to_lower(key);
71
72	/* data */
73	line = _bcs_skip_ws_len(p, &len);
74	_bcs_trunc_rws_len(line, &len);
75	snprintf(data, sizeof(data), "%.*s", (int)len, line);
76
77	return (_db_factory_addstr_by_s(df, key, data));
78}
79
80static int
81dump_db(struct _citrus_db_factory *df, struct _region *r)
82{
83	void *ptr;
84	size_t size;
85
86	size = _db_factory_calc_size(df);
87	ptr = malloc(size);
88	if (ptr == NULL)
89		return (errno);
90	_region_init(r, ptr, size);
91
92	return (_db_factory_serialize(df, _CITRUS_LOOKUP_MAGIC, r));
93}
94
95int
96_citrus_lookup_factory_convert(FILE *out, FILE *in)
97{
98	struct _citrus_db_factory *df;
99	struct _region r;
100	char *line;
101	size_t size;
102	int ret;
103
104	ret = _db_factory_create(&df, &_db_hash_std, NULL);
105	if (ret)
106		return (ret);
107
108	while ((line = fgetln(in, &size)) != NULL)
109		if ((ret = convert_line(df, line, size))) {
110			_db_factory_free(df);
111			return (ret);
112		}
113
114	ret = dump_db(df, &r);
115	_db_factory_free(df);
116	if (ret)
117		return (ret);
118
119	if (fwrite(_region_head(&r), _region_size(&r), 1, out) != 1)
120		return (errno);
121
122	return (0);
123}
124