2016-10-31 16:04:15 +00:00
|
|
|
|
/*
|
|
|
|
|
* Copyright (C) 2016 Alex Yatskov <alex@foosoft.net>
|
|
|
|
|
* Author: Alex Yatskov <alex@foosoft.net>
|
|
|
|
|
*
|
|
|
|
|
* This program is free software: you can redistribute it and/or modify
|
|
|
|
|
* it under the terms of the GNU General Public License as published by
|
|
|
|
|
* the Free Software Foundation, either version 3 of the License, or
|
|
|
|
|
* (at your option) any later version.
|
|
|
|
|
*
|
|
|
|
|
* This program is distributed in the hope that it will be useful,
|
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
|
* GNU General Public License for more details.
|
|
|
|
|
*
|
|
|
|
|
* You should have received a copy of the GNU General Public License
|
|
|
|
|
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
|
*/
|
|
|
|
|
|
2016-10-29 23:58:09 +00:00
|
|
|
|
#include <stdio.h>
|
2016-10-31 15:58:24 +00:00
|
|
|
|
#include <iconv.h>
|
2016-10-30 02:05:38 +00:00
|
|
|
|
#include <string.h>
|
2016-10-31 16:14:27 +00:00
|
|
|
|
#include <errno.h>
|
2016-10-31 15:58:24 +00:00
|
|
|
|
#include <stdlib.h>
|
2016-10-30 00:38:50 +00:00
|
|
|
|
|
2016-10-31 02:13:15 +00:00
|
|
|
|
#include "eb/eb/eb.h"
|
|
|
|
|
#include "eb/eb/error.h"
|
|
|
|
|
#include "eb/eb/text.h"
|
2016-10-30 01:58:26 +00:00
|
|
|
|
|
2016-10-31 15:58:24 +00:00
|
|
|
|
/*
|
|
|
|
|
Constants
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
#define MAX_ENTRY_HITS 128
|
|
|
|
|
#define MAX_ENTRY_TEXT 1024
|
|
|
|
|
#define MAX_ENTRY_HEADER 512
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
Array functions
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
typedef struct {
|
|
|
|
|
char header[MAX_ENTRY_HEADER];
|
|
|
|
|
char text[MAX_ENTRY_TEXT];
|
|
|
|
|
} Entry;
|
|
|
|
|
|
|
|
|
|
typedef struct {
|
|
|
|
|
Entry* ptr;
|
|
|
|
|
size_t used;
|
|
|
|
|
size_t size;
|
|
|
|
|
} Array;
|
|
|
|
|
|
|
|
|
|
void array_init(Array* arr, size_t init_size) {
|
|
|
|
|
arr->ptr = (Entry *)malloc(init_size * sizeof(Entry));
|
|
|
|
|
arr->used = 0;
|
|
|
|
|
arr->size = init_size;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
Entry* array_new(Array* arr) {
|
|
|
|
|
if (arr->used == arr->size) {
|
|
|
|
|
arr->size *= 2;
|
|
|
|
|
arr->ptr = (Entry *)realloc(arr->ptr, arr->size * sizeof(Entry));
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return &arr->ptr[arr->used++];
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void array_free(Array* arr) {
|
|
|
|
|
free(arr->ptr);
|
|
|
|
|
arr->ptr = NULL;
|
|
|
|
|
arr->used = arr->size = 0;
|
|
|
|
|
}
|
2016-10-30 01:58:26 +00:00
|
|
|
|
|
2016-10-31 15:58:24 +00:00
|
|
|
|
/*
|
|
|
|
|
Local functions
|
|
|
|
|
*/
|
|
|
|
|
|
2016-10-31 16:14:27 +00:00
|
|
|
|
// From https://stackoverflow.com/questions/2162390/iconv-encoding-conversion-problem
|
|
|
|
|
|
|
|
|
|
static char * convert (const char *from_charset, const char *to_charset, const char *input) {
|
|
|
|
|
size_t inleft, outleft, converted = 0;
|
|
|
|
|
char *output, *outbuf, *tmp;
|
|
|
|
|
const char *inbuf;
|
|
|
|
|
size_t outlen;
|
|
|
|
|
iconv_t cd;
|
|
|
|
|
|
|
|
|
|
if ((cd = iconv_open (to_charset, from_charset)) == (iconv_t) -1)
|
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
|
|
inleft = strlen (input);
|
|
|
|
|
inbuf = input;
|
|
|
|
|
|
|
|
|
|
/* we'll start off allocating an output buffer which is the same size
|
|
|
|
|
* as our input buffer. */
|
|
|
|
|
outlen = inleft;
|
|
|
|
|
|
|
|
|
|
/* we allocate 4 bytes more than what we need for nul-termination... */
|
|
|
|
|
if (!(output = malloc (outlen + 4))) {
|
|
|
|
|
iconv_close (cd);
|
|
|
|
|
return NULL;
|
2016-10-31 15:58:24 +00:00
|
|
|
|
}
|
2016-10-30 01:58:26 +00:00
|
|
|
|
|
2016-10-31 16:14:27 +00:00
|
|
|
|
do {
|
|
|
|
|
errno = 0;
|
|
|
|
|
outbuf = output + converted;
|
|
|
|
|
outleft = outlen - converted;
|
|
|
|
|
|
|
|
|
|
converted = iconv (cd, (char **) &inbuf, &inleft, &outbuf, &outleft);
|
|
|
|
|
if (converted != (size_t) -1 || errno == EINVAL) {
|
|
|
|
|
/*
|
|
|
|
|
* EINVAL An incomplete multibyte sequence has been encoun-
|
|
|
|
|
* tered in the input.
|
|
|
|
|
*
|
|
|
|
|
* We'll just truncate it and ignore it.
|
|
|
|
|
*/
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (errno != E2BIG) {
|
|
|
|
|
/*
|
|
|
|
|
* EILSEQ An invalid multibyte sequence has been encountered
|
|
|
|
|
* in the input.
|
|
|
|
|
*
|
|
|
|
|
* Bad input, we can't really recover from this.
|
|
|
|
|
*/
|
|
|
|
|
iconv_close (cd);
|
|
|
|
|
free (output);
|
|
|
|
|
return NULL;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* E2BIG There is not sufficient room at *outbuf.
|
|
|
|
|
*
|
|
|
|
|
* We just need to grow our outbuffer and try again.
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
converted = outbuf - output;
|
|
|
|
|
outlen += inleft * 2 + 8;
|
|
|
|
|
|
|
|
|
|
if (!(tmp = realloc (output, outlen + 4))) {
|
|
|
|
|
iconv_close (cd);
|
|
|
|
|
free (output);
|
|
|
|
|
return NULL;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
output = tmp;
|
|
|
|
|
outbuf = output + converted;
|
|
|
|
|
} while (1);
|
|
|
|
|
|
|
|
|
|
/* flush the iconv conversion */
|
|
|
|
|
iconv (cd, NULL, NULL, &outbuf, &outleft);
|
|
|
|
|
iconv_close (cd);
|
|
|
|
|
|
|
|
|
|
/* Note: not all charsets can be nul-terminated with a single
|
|
|
|
|
* nul byte. UCS2, for example, needs 2 nul bytes and UCS4
|
|
|
|
|
* needs 4. I hope that 4 nul bytes is enough to terminate all
|
|
|
|
|
* multibyte charsets? */
|
|
|
|
|
|
|
|
|
|
/* nul-terminate the string */
|
|
|
|
|
memset (outbuf, 0, 4);
|
|
|
|
|
|
|
|
|
|
return output;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static const char * eucjp_to_utf8(const char src[]) {
|
|
|
|
|
return convert("EUC-JP", "UTF-8", src);
|
2016-10-31 15:58:24 +00:00
|
|
|
|
}
|
2016-10-30 02:05:38 +00:00
|
|
|
|
|
2016-10-31 02:13:15 +00:00
|
|
|
|
static void dump_hits(EB_Book* book) {
|
|
|
|
|
EB_Hit hits[MAX_ENTRY_HITS];
|
|
|
|
|
int hit_count = 0;
|
2016-10-30 03:53:10 +00:00
|
|
|
|
|
2016-10-31 02:13:15 +00:00
|
|
|
|
do {
|
|
|
|
|
if (eb_hit_list(book, MAX_ENTRY_HITS, hits, &hit_count) != EB_SUCCESS) {
|
|
|
|
|
fprintf(stderr, "error: could not get hit list\n");
|
|
|
|
|
break;
|
2016-10-30 03:53:10 +00:00
|
|
|
|
}
|
|
|
|
|
|
2016-10-31 02:13:15 +00:00
|
|
|
|
for (int i = 0; i < hit_count; ++i) {
|
|
|
|
|
char text[MAX_ENTRY_TEXT];
|
2016-10-31 15:58:24 +00:00
|
|
|
|
ssize_t text_length = 0;
|
2016-10-30 03:53:10 +00:00
|
|
|
|
|
2016-10-31 02:13:15 +00:00
|
|
|
|
eb_seek_text(book, &hits[i].text);
|
|
|
|
|
eb_read_text(book, NULL, NULL, NULL, MAX_ENTRY_TEXT, text, &text_length);
|
2016-10-30 03:53:10 +00:00
|
|
|
|
|
2016-10-31 16:04:15 +00:00
|
|
|
|
const char* text_utf8 = eucjp_to_utf8(text);
|
2016-10-31 16:14:27 +00:00
|
|
|
|
puts(text_utf8);
|
|
|
|
|
/* (void) text_utf8; */
|
2016-10-31 02:13:15 +00:00
|
|
|
|
}
|
2016-10-30 03:53:10 +00:00
|
|
|
|
}
|
2016-10-31 02:13:15 +00:00
|
|
|
|
while (hit_count > 0);
|
2016-10-30 01:58:26 +00:00
|
|
|
|
}
|
|
|
|
|
|
2016-10-31 02:13:15 +00:00
|
|
|
|
static void dump_book(EB_Book* book) {
|
|
|
|
|
if (eb_search_all_alphabet(book) == EB_SUCCESS) {
|
|
|
|
|
dump_hits(book);
|
2016-10-30 03:53:10 +00:00
|
|
|
|
}
|
2016-10-31 02:13:15 +00:00
|
|
|
|
else {
|
|
|
|
|
printf("notice: skiping alphabet search\n");
|
2016-10-30 03:53:10 +00:00
|
|
|
|
}
|
|
|
|
|
|
2016-10-31 02:13:15 +00:00
|
|
|
|
if (eb_search_all_kana(book) == EB_SUCCESS) {
|
|
|
|
|
dump_hits(book);
|
|
|
|
|
}
|
|
|
|
|
else {
|
|
|
|
|
printf("notice: skiping kana search\n");
|
2016-10-30 03:53:10 +00:00
|
|
|
|
}
|
|
|
|
|
|
2016-10-31 02:13:15 +00:00
|
|
|
|
if (eb_search_all_asis(book) == EB_SUCCESS) {
|
|
|
|
|
dump_hits(book);
|
|
|
|
|
}
|
|
|
|
|
else {
|
|
|
|
|
printf("notice: skiping asis search\n");
|
|
|
|
|
}
|
2016-10-30 03:53:10 +00:00
|
|
|
|
}
|
|
|
|
|
|
2016-10-31 02:13:15 +00:00
|
|
|
|
static int process(const char path[]) {
|
2016-10-30 01:58:26 +00:00
|
|
|
|
if (eb_initialize_library() != EB_SUCCESS) {
|
2016-10-30 06:41:19 +00:00
|
|
|
|
fprintf(stderr, "error: failed to initialize library\n");
|
2016-10-30 01:27:05 +00:00
|
|
|
|
return 1;
|
2016-10-30 00:38:50 +00:00
|
|
|
|
}
|
2016-10-29 23:58:09 +00:00
|
|
|
|
|
2016-10-30 01:58:26 +00:00
|
|
|
|
EB_Book book;
|
2016-10-31 02:13:15 +00:00
|
|
|
|
eb_initialize_book(&book);
|
2016-10-30 01:27:05 +00:00
|
|
|
|
|
2016-10-31 02:13:15 +00:00
|
|
|
|
do {
|
|
|
|
|
if (eb_bind(&book, path) != EB_SUCCESS) {
|
|
|
|
|
fprintf(stderr, "error: failed to bind book\n");
|
|
|
|
|
break;
|
|
|
|
|
}
|
2016-10-30 03:53:10 +00:00
|
|
|
|
|
2016-10-31 02:13:15 +00:00
|
|
|
|
EB_Subbook_Code sub_codes[EB_MAX_SUBBOOKS];
|
|
|
|
|
int sub_count = 0;
|
|
|
|
|
|
|
|
|
|
if (eb_subbook_list(&book, sub_codes, &sub_count) != EB_SUCCESS) {
|
|
|
|
|
fprintf(stderr, "error: failed to get sub-book list\n");
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
for (int i = 0; i < sub_count; ++i) {
|
|
|
|
|
if (eb_set_subbook(&book, sub_codes[i]) == EB_SUCCESS) {
|
|
|
|
|
dump_book(&book);
|
|
|
|
|
}
|
|
|
|
|
else {
|
|
|
|
|
fprintf(stderr, "error: failed to set sub-book\n");
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
while (0);
|
2016-10-30 01:58:26 +00:00
|
|
|
|
|
|
|
|
|
eb_finalize_book(&book);
|
2016-10-30 00:38:50 +00:00
|
|
|
|
eb_finalize_library();
|
2016-10-30 01:27:05 +00:00
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
2016-10-31 15:58:24 +00:00
|
|
|
|
/*
|
|
|
|
|
Entry point
|
|
|
|
|
*/
|
2016-10-31 02:13:15 +00:00
|
|
|
|
|
2016-10-30 01:27:05 +00:00
|
|
|
|
int main(int argc, char *argv[]) {
|
|
|
|
|
if (argc != 2) {
|
|
|
|
|
fprintf(stderr, "usage: %s path\n", argv[0]);
|
2016-10-30 01:58:26 +00:00
|
|
|
|
return 2;
|
2016-10-30 01:27:05 +00:00
|
|
|
|
}
|
|
|
|
|
|
2016-10-30 03:53:10 +00:00
|
|
|
|
return process(argv[1]);
|
2016-10-29 23:58:09 +00:00
|
|
|
|
}
|