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 #include <sys/cdefs.h> 32 33 #include <assert.h> 34 #include <ctype.h> 35 #include <errno.h> 36 #include <limits.h> 37 #include <stdio.h> 38 #include <stdlib.h> 39 #include <string.h> 40 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_lookup_factory.h" 47 #include "citrus_lookup_file.h" 48 49 #define T_COMM '#' 50 static int 51 convert_line(struct _citrus_db_factory *df, const char *line, size_t len) 52 { 53 const char *p; 54 char data[LINE_MAX], key[LINE_MAX]; 55 56 /* cut off trailing comment */ 57 p = memchr(line, T_COMM, len); 58 if (p) 59 len = p - line; 60 61 /* key */ 62 line = _bcs_skip_ws_len(line, &len); 63 if (len == 0) 64 return (0); 65 p = _bcs_skip_nonws_len(line, &len); 66 if (p == line) 67 return (0); 68 snprintf(key, sizeof(key), "%.*s", (int)(p-line), line); 69 _bcs_convert_to_lower(key); 70 71 /* data */ 72 line = _bcs_skip_ws_len(p, &len); 73 _bcs_trunc_rws_len(line, &len); 74 snprintf(data, sizeof(data), "%.*s", (int)len, line); 75 76 return (_db_factory_addstr_by_s(df, key, data)); 77 } 78 79 static int 80 dump_db(struct _citrus_db_factory *df, struct _region *r) 81 { 82 void *ptr; 83 size_t size; 84 85 size = _db_factory_calc_size(df); 86 ptr = malloc(size); 87 if (ptr == NULL) 88 return (errno); 89 _region_init(r, ptr, size); 90 91 return (_db_factory_serialize(df, _CITRUS_LOOKUP_MAGIC, r)); 92 } 93 94 int 95 _citrus_lookup_factory_convert(FILE *out, FILE *in) 96 { 97 struct _citrus_db_factory *df; 98 struct _region r; 99 char *line; 100 size_t size; 101 int ret; 102 103 ret = _db_factory_create(&df, &_db_hash_std, NULL); 104 if (ret) 105 return (ret); 106 107 while ((line = fgetln(in, &size)) != NULL) 108 if ((ret = convert_line(df, line, size))) { 109 _db_factory_free(df); 110 return (ret); 111 } 112 113 ret = dump_db(df, &r); 114 _db_factory_free(df); 115 if (ret) 116 return (ret); 117 118 if (fwrite(_region_head(&r), _region_size(&r), 1, out) != 1) 119 return (errno); 120 121 return (0); 122 } 123