blob: 009d0ad3d6a27835aa17173eabe744a79ea11750 [file] [log] [blame]
satoke808e432010-12-02 14:53:24 +09001/*
2**
3** Copyright 2010, The Android Open Source Project
4**
5** Licensed under the Apache License, Version 2.0 (the "License");
6** you may not use this file except in compliance with the License.
7** You may obtain a copy of the License at
8**
9** http://www.apache.org/licenses/LICENSE-2.0
10**
11** Unless required by applicable law or agreed to in writing, software
12** distributed under the License is distributed on an "AS IS" BASIS,
13** WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
14** See the License for the specific language governing permissions and
15** limitations under the License.
16*/
17
18#ifndef LATINIME_DEFINES_H
19#define LATINIME_DEFINES_H
20
satok827ced82011-07-14 09:01:09 +090021#if defined(FLAG_DO_PROFILE) || defined(FLAG_DBG)
22#include <cutils/log.h>
23#else
24#define LOGE(fmt, ...)
25#define LOGI(fmt, ...)
26#endif
27
satok20d9fda2011-07-13 14:40:30 +090028#ifdef FLAG_DO_PROFILE
satok61e2f852011-01-05 14:13:07 +090029// Profiler
satok787945b2011-07-14 08:32:57 +090030#include <cutils/log.h>
satok61e2f852011-01-05 14:13:07 +090031#include <time.h>
32#define PROF_BUF_SIZE 100
33static double profile_buf[PROF_BUF_SIZE];
34static double profile_old[PROF_BUF_SIZE];
35static unsigned int profile_counter[PROF_BUF_SIZE];
36
Ken Wakasae90b3332011-01-07 15:01:51 +090037#define PROF_RESET prof_reset()
38#define PROF_COUNT(prof_buf_id) ++profile_counter[prof_buf_id]
39#define PROF_OPEN do { PROF_RESET; PROF_START(PROF_BUF_SIZE - 1); } while(0)
40#define PROF_START(prof_buf_id) do { \
41 PROF_COUNT(prof_buf_id); profile_old[prof_buf_id] = (clock()); } while(0)
42#define PROF_CLOSE do { PROF_END(PROF_BUF_SIZE - 1); PROF_OUTALL; } while(0)
43#define PROF_END(prof_buf_id) profile_buf[prof_buf_id] += ((clock()) - profile_old[prof_buf_id])
44#define PROF_CLOCKOUT(prof_buf_id) \
45 LOGI("%s : clock is %f", __FUNCTION__, (clock() - profile_old[prof_buf_id]))
46#define PROF_OUTALL do { LOGI("--- %s ---", __FUNCTION__); prof_out(); } while(0)
satok61e2f852011-01-05 14:13:07 +090047
Ken Wakasae90b3332011-01-07 15:01:51 +090048static void prof_reset(void) {
49 for (int i = 0; i < PROF_BUF_SIZE; ++i) {
satok61e2f852011-01-05 14:13:07 +090050 profile_buf[i] = 0;
51 profile_old[i] = 0;
52 profile_counter[i] = 0;
53 }
54}
55
Ken Wakasae90b3332011-01-07 15:01:51 +090056static void prof_out(void) {
satok61e2f852011-01-05 14:13:07 +090057 if (profile_counter[PROF_BUF_SIZE - 1] != 1) {
58 LOGI("Error: You must call PROF_OPEN before PROF_CLOSE.");
59 }
60 LOGI("Total time is %6.3f ms.",
Ken Wakasae90b3332011-01-07 15:01:51 +090061 profile_buf[PROF_BUF_SIZE - 1] * 1000 / (double)CLOCKS_PER_SEC);
satok61e2f852011-01-05 14:13:07 +090062 double all = 0;
Ken Wakasae90b3332011-01-07 15:01:51 +090063 for (int i = 0; i < PROF_BUF_SIZE - 1; ++i) {
satok61e2f852011-01-05 14:13:07 +090064 all += profile_buf[i];
65 }
Ken Wakasae90b3332011-01-07 15:01:51 +090066 if (all == 0) all = 1;
67 for (int i = 0; i < PROF_BUF_SIZE - 1; ++i) {
68 if (profile_buf[i] != 0) {
satok61e2f852011-01-05 14:13:07 +090069 LOGI("(%d): Used %4.2f%%, %8.4f ms. Called %d times.",
Ken Wakasae90b3332011-01-07 15:01:51 +090070 i, (profile_buf[i] * 100 / all),
71 profile_buf[i] * 1000 / (double)CLOCKS_PER_SEC, profile_counter[i]);
72 }
satok61e2f852011-01-05 14:13:07 +090073 }
74}
75
satok20d9fda2011-07-13 14:40:30 +090076#else // FLAG_DO_PROFILE
satok61e2f852011-01-05 14:13:07 +090077#define PROF_BUF_SIZE 0
78#define PROF_RESET
79#define PROF_COUNT(prof_buf_id)
80#define PROF_OPEN
81#define PROF_START(prof_buf_id)
82#define PROF_CLOSE
83#define PROF_END(prof_buf_id)
84#define PROF_CLOCK_OUT(prof_buf_id)
85#define PROF_CLOCKOUT(prof_buf_id)
86#define PROF_OUTALL
87
satok20d9fda2011-07-13 14:40:30 +090088#endif // FLAG_DO_PROFILE
89
90#ifdef FLAG_DBG
91#include <cutils/log.h>
92#ifndef LOG_TAG
93#define LOG_TAG "LatinIME: "
94#endif
95#define DEBUG_DICT true
96#define DEBUG_DICT_FULL false
satok0cedd2b2011-08-12 01:05:27 +090097#define DEBUG_EDIT_DISTANCE false
satok10266c02011-08-19 22:05:59 +090098#define DEBUG_SHOW_FOUND_WORD false
satok20d9fda2011-07-13 14:40:30 +090099#define DEBUG_NODE DEBUG_DICT_FULL
100#define DEBUG_TRACE DEBUG_DICT_FULL
101#define DEBUG_PROXIMITY_INFO true
satok10266c02011-08-19 22:05:59 +0900102#define DEBUG_CORRECTION false
103#define DEBUG_CORRECTION_FREQ true
satok20d9fda2011-07-13 14:40:30 +0900104
satok0cedd2b2011-08-12 01:05:27 +0900105#define DUMP_WORD(word, length) do { dumpWord(word, length); } while(0)
106
107static char charBuf[50];
108
109static void dumpWord(const unsigned short* word, const int length) {
110 for (int i = 0; i < length; ++i) {
111 charBuf[i] = word[i];
112 }
113 charBuf[length] = 0;
114 LOGI("[ %s ]", charBuf);
115}
116
satok20d9fda2011-07-13 14:40:30 +0900117#else // FLAG_DBG
satok827ced82011-07-14 09:01:09 +0900118
satok20d9fda2011-07-13 14:40:30 +0900119#define DEBUG_DICT false
120#define DEBUG_DICT_FULL false
satok0cedd2b2011-08-12 01:05:27 +0900121#define DEBUG_EDIT_DISTANCE false
satok20d9fda2011-07-13 14:40:30 +0900122#define DEBUG_SHOW_FOUND_WORD false
123#define DEBUG_NODE false
124#define DEBUG_TRACE false
125#define DEBUG_PROXIMITY_INFO false
satok10266c02011-08-19 22:05:59 +0900126#define DEBUG_CORRECTION false
127#define DEBUG_CORRECTION_FREQ false
satok20d9fda2011-07-13 14:40:30 +0900128
satok0cedd2b2011-08-12 01:05:27 +0900129#define DUMP_WORD(word, length)
130
satoke808e432010-12-02 14:53:24 +0900131#endif // FLAG_DBG
132
satok662fe692010-12-08 17:05:39 +0900133#ifndef U_SHORT_MAX
134#define U_SHORT_MAX 1 << 16
135#endif
Jean Chalarda5d58492011-02-18 17:50:58 +0900136#ifndef S_INT_MAX
satok3c4bb772011-03-04 22:50:19 -0800137#define S_INT_MAX 2147483647 // ((1 << 31) - 1)
Jean Chalarda5d58492011-02-18 17:50:58 +0900138#endif
satok662fe692010-12-08 17:05:39 +0900139
Ken Wakasae90b3332011-01-07 15:01:51 +0900140// Define this to use mmap() for dictionary loading. Undefine to use malloc() instead of mmap().
141// We measured and compared performance of both, and found mmap() is fairly good in terms of
142// loading time, and acceptable even for several initial lookups which involve page faults.
143#define USE_MMAP_FOR_DICTIONARY
144
satoke808e432010-12-02 14:53:24 +0900145// 22-bit address = ~4MB dictionary size limit, which on average would be about 200k-300k words
146#define ADDRESS_MASK 0x3FFFFF
147
148// The bit that decides if an address follows in the next 22 bits
149#define FLAG_ADDRESS_MASK 0x40
150// The bit that decides if this is a terminal node for a word. The node could still have children,
151// if the word has other endings.
152#define FLAG_TERMINAL_MASK 0x80
153
154#define FLAG_BIGRAM_READ 0x80
155#define FLAG_BIGRAM_CHILDEXIST 0x40
156#define FLAG_BIGRAM_CONTINUED 0x80
157#define FLAG_BIGRAM_FREQ 0x7F
158
159#define DICTIONARY_VERSION_MIN 200
Jean Chalard1059f272011-06-28 20:45:05 +0900160// TODO: remove this constant when the switch to the new dict format is over
satoke808e432010-12-02 14:53:24 +0900161#define DICTIONARY_HEADER_SIZE 2
Jean Chalard1059f272011-06-28 20:45:05 +0900162#define NEW_DICTIONARY_HEADER_SIZE 5
satoke808e432010-12-02 14:53:24 +0900163#define NOT_VALID_WORD -99
Jean Chalard1059f272011-06-28 20:45:05 +0900164#define NOT_A_CHARACTER -1
satoke808e432010-12-02 14:53:24 +0900165
satok817e5172011-03-04 06:06:45 -0800166#define KEYCODE_SPACE ' '
167
satok662fe692010-12-08 17:05:39 +0900168#define SUGGEST_WORDS_WITH_MISSING_CHARACTER true
169#define SUGGEST_WORDS_WITH_MISSING_SPACE_CHARACTER true
170#define SUGGEST_WORDS_WITH_EXCESSIVE_CHARACTER true
satoka3d78f62010-12-09 22:08:33 +0900171#define SUGGEST_WORDS_WITH_TRANSPOSED_CHARACTERS true
satok817e5172011-03-04 06:06:45 -0800172#define SUGGEST_WORDS_WITH_SPACE_PROXIMITY true
satoka3d78f62010-12-09 22:08:33 +0900173
Jean Chalard8dc754a2011-01-27 14:20:22 +0900174// The following "rate"s are used as a multiplier before dividing by 100, so they are in percent.
satok72bc17e2011-04-13 17:23:27 +0900175#define WORDS_WITH_MISSING_CHARACTER_DEMOTION_RATE 80
satokdc5301e2011-04-11 16:14:45 +0900176#define WORDS_WITH_MISSING_CHARACTER_DEMOTION_START_POS_10X 12
satok99c908a2011-05-24 14:28:13 +0900177#define WORDS_WITH_MISSING_SPACE_CHARACTER_DEMOTION_RATE 67
satoka3d78f62010-12-09 22:08:33 +0900178#define WORDS_WITH_EXCESSIVE_CHARACTER_DEMOTION_RATE 75
satok54fe9e02010-12-13 14:42:35 +0900179#define WORDS_WITH_EXCESSIVE_CHARACTER_OUT_OF_PROXIMITY_DEMOTION_RATE 75
satoka3d78f62010-12-09 22:08:33 +0900180#define WORDS_WITH_TRANSPOSED_CHARACTERS_DEMOTION_RATE 60
satok58c49b92011-01-27 03:23:39 +0900181#define FULL_MATCHED_WORDS_PROMOTION_RATE 120
satok9d2a3022011-04-14 19:13:34 +0900182#define WORDS_WITH_PROXIMITY_CHARACTER_DEMOTION_RATE 90
satok635f68e2011-08-10 22:19:33 +0900183#define WORDS_WITH_MATCH_SKIP_PROMOTION_RATE 105
satokbcac0e92011-08-15 22:30:33 +0900184#define WORDS_WITH_JUST_ONE_CORRECTION_PROMOTION_RATE 160
satok10266c02011-08-19 22:05:59 +0900185#define CORRECTION_COUNT_RATE_DEMOTION_RATE_BASE 45
186#define INPUT_EXCEEDS_OUTPUT_DEMOTION_RATE 70
187#define FIRST_CHAR_DIFFERENT_DEMOTION_RATE 96
satoke808e432010-12-02 14:53:24 +0900188
satokf5cded12010-12-06 21:28:24 +0900189// This should be greater than or equal to MAX_WORD_LENGTH defined in BinaryDictionary.java
190// This is only used for the size of array. Not to be used in c functions.
191#define MAX_WORD_LENGTH_INTERNAL 48
satok715514d2010-12-02 20:19:59 +0900192
satok68319262010-12-03 19:38:08 +0900193#define MAX_DEPTH_MULTIPLIER 3
194
Jean Chalarda787dba2011-03-04 12:17:48 +0900195// TODO: Reduce this constant if possible; check the maximum number of umlauts in the same German
196// word in the dictionary
197#define DEFAULT_MAX_UMLAUT_SEARCH_DEPTH 5
198
satok54fe9e02010-12-13 14:42:35 +0900199// Minimum suggest depth for one word for all cases except for missing space suggestions.
200#define MIN_SUGGEST_DEPTH 1
201#define MIN_USER_TYPED_LENGTH_FOR_MISSING_SPACE_SUGGESTION 3
202#define MIN_USER_TYPED_LENGTH_FOR_EXCESSIVE_CHARACTER_SUGGESTION 3
satok662fe692010-12-08 17:05:39 +0900203
satokf5cded12010-12-06 21:28:24 +0900204#define min(a,b) ((a)<(b)?(a):(b))
satokbcac0e92011-08-15 22:30:33 +0900205#define max(a,b) ((a)>(b)?(a):(b))
satokf5cded12010-12-06 21:28:24 +0900206
satoke808e432010-12-02 14:53:24 +0900207#endif // LATINIME_DEFINES_H