1 /* $NetBSD: citrus_lookup_factory.c,v 1.4 2003/10/27 00:12:42 lukem Exp $ */
2
3 /*-
4 * SPDX-License-Identifier: BSD-2-Clause
5 *
6 * Copyright (c)2003 Citrus Project,
7 * All rights reserved.
8 *
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
11 * are met:
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 * 2. Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the following disclaimer in the
16 * documentation and/or other materials provided with the distribution.
17 *
18 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
19 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
20 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
21 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
22 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
23 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
24 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
25 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
26 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
27 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
28 * SUCH DAMAGE.
29 */
30
31
32 #include <assert.h>
33 #include <ctype.h>
34 #include <errno.h>
35 #include <limits.h>
36 #include <stdio.h>
37 #include <stdlib.h>
38 #include <string.h>
39
40 #include "citrus_namespace.h"
41 #include "citrus_region.h"
42 #include "citrus_bcs.h"
43 #include "citrus_db_factory.h"
44 #include "citrus_db_hash.h"
45 #include "citrus_lookup_factory.h"
46 #include "citrus_lookup_file.h"
47
48 #define T_COMM '#'
49 static int
convert_line(struct _citrus_db_factory * df,const char * line,size_t len)50 convert_line(struct _citrus_db_factory *df, const char *line, size_t len)
51 {
52 const char *p;
53 char data[LINE_MAX], key[LINE_MAX];
54
55 /* cut off trailing comment */
56 p = memchr(line, T_COMM, len);
57 if (p)
58 len = p - line;
59
60 /* key */
61 line = _bcs_skip_ws_len(line, &len);
62 if (len == 0)
63 return (0);
64 p = _bcs_skip_nonws_len(line, &len);
65 if (p == line)
66 return (0);
67 snprintf(key, sizeof(key), "%.*s", (int)(p-line), line);
68 _bcs_convert_to_lower(key);
69
70 /* data */
71 line = _bcs_skip_ws_len(p, &len);
72 _bcs_trunc_rws_len(line, &len);
73 snprintf(data, sizeof(data), "%.*s", (int)len, line);
74
75 return (_db_factory_addstr_by_s(df, key, data));
76 }
77
78 static int
dump_db(struct _citrus_db_factory * df,struct _region * r)79 dump_db(struct _citrus_db_factory *df, struct _region *r)
80 {
81 void *ptr;
82 size_t size;
83
84 size = _db_factory_calc_size(df);
85 ptr = malloc(size);
86 if (ptr == NULL)
87 return (errno);
88 _region_init(r, ptr, size);
89
90 return (_db_factory_serialize(df, _CITRUS_LOOKUP_MAGIC, r));
91 }
92
93 int
_citrus_lookup_factory_convert(FILE * out,FILE * in)94 _citrus_lookup_factory_convert(FILE *out, FILE *in)
95 {
96 struct _citrus_db_factory *df;
97 struct _region r;
98 char *line;
99 size_t size;
100 int ret;
101
102 ret = _db_factory_create(&df, &_db_hash_std, NULL);
103 if (ret)
104 return (ret);
105
106 while ((line = fgetln(in, &size)) != NULL)
107 if ((ret = convert_line(df, line, size))) {
108 _db_factory_free(df);
109 return (ret);
110 }
111
112 ret = dump_db(df, &r);
113 _db_factory_free(df);
114 if (ret)
115 return (ret);
116
117 if (fwrite(_region_head(&r), _region_size(&r), 1, out) != 1)
118 return (errno);
119
120 return (0);
121 }
122