blob: 2a06e9485537ca854661cd80a3bd67972bba9258 [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
21#ifdef FLAG_DBG
22#include <cutils/log.h>
23#ifndef LOG_TAG
24#define LOG_TAG "LatinIME: "
25#endif
satokcdbbea72010-12-08 16:04:16 +090026#define DEBUG_DICT true
satok61e2f852011-01-05 14:13:07 +090027#define DEBUG_DICT_FULL false
satoka3d78f62010-12-09 22:08:33 +090028#define DEBUG_SHOW_FOUND_WORD DEBUG_DICT_FULL
29#define DEBUG_NODE DEBUG_DICT_FULL
30#define DEBUG_TRACE DEBUG_DICT_FULL
satok8fbd5522011-02-22 17:28:55 +090031#define DEBUG_PROXIMITY_INFO true
satok61e2f852011-01-05 14:13:07 +090032
33// Profiler
34#include <time.h>
35#define PROF_BUF_SIZE 100
36static double profile_buf[PROF_BUF_SIZE];
37static double profile_old[PROF_BUF_SIZE];
38static unsigned int profile_counter[PROF_BUF_SIZE];
39
Ken Wakasae90b3332011-01-07 15:01:51 +090040#define PROF_RESET prof_reset()
41#define PROF_COUNT(prof_buf_id) ++profile_counter[prof_buf_id]
42#define PROF_OPEN do { PROF_RESET; PROF_START(PROF_BUF_SIZE - 1); } while(0)
43#define PROF_START(prof_buf_id) do { \
44 PROF_COUNT(prof_buf_id); profile_old[prof_buf_id] = (clock()); } while(0)
45#define PROF_CLOSE do { PROF_END(PROF_BUF_SIZE - 1); PROF_OUTALL; } while(0)
46#define PROF_END(prof_buf_id) profile_buf[prof_buf_id] += ((clock()) - profile_old[prof_buf_id])
47#define PROF_CLOCKOUT(prof_buf_id) \
48 LOGI("%s : clock is %f", __FUNCTION__, (clock() - profile_old[prof_buf_id]))
49#define PROF_OUTALL do { LOGI("--- %s ---", __FUNCTION__); prof_out(); } while(0)
satok61e2f852011-01-05 14:13:07 +090050
Ken Wakasae90b3332011-01-07 15:01:51 +090051static void prof_reset(void) {
52 for (int i = 0; i < PROF_BUF_SIZE; ++i) {
satok61e2f852011-01-05 14:13:07 +090053 profile_buf[i] = 0;
54 profile_old[i] = 0;
55 profile_counter[i] = 0;
56 }
57}
58
Ken Wakasae90b3332011-01-07 15:01:51 +090059static void prof_out(void) {
satok61e2f852011-01-05 14:13:07 +090060 if (profile_counter[PROF_BUF_SIZE - 1] != 1) {
61 LOGI("Error: You must call PROF_OPEN before PROF_CLOSE.");
62 }
63 LOGI("Total time is %6.3f ms.",
Ken Wakasae90b3332011-01-07 15:01:51 +090064 profile_buf[PROF_BUF_SIZE - 1] * 1000 / (double)CLOCKS_PER_SEC);
satok61e2f852011-01-05 14:13:07 +090065 double all = 0;
Ken Wakasae90b3332011-01-07 15:01:51 +090066 for (int i = 0; i < PROF_BUF_SIZE - 1; ++i) {
satok61e2f852011-01-05 14:13:07 +090067 all += profile_buf[i];
68 }
Ken Wakasae90b3332011-01-07 15:01:51 +090069 if (all == 0) all = 1;
70 for (int i = 0; i < PROF_BUF_SIZE - 1; ++i) {
71 if (profile_buf[i] != 0) {
satok61e2f852011-01-05 14:13:07 +090072 LOGI("(%d): Used %4.2f%%, %8.4f ms. Called %d times.",
Ken Wakasae90b3332011-01-07 15:01:51 +090073 i, (profile_buf[i] * 100 / all),
74 profile_buf[i] * 1000 / (double)CLOCKS_PER_SEC, profile_counter[i]);
75 }
satok61e2f852011-01-05 14:13:07 +090076 }
77}
78
satoke808e432010-12-02 14:53:24 +090079#else // FLAG_DBG
Ken Wakasade3070a2011-03-19 09:16:42 +090080#define LOGE(fmt, ...)
81#define LOGI(fmt, ...)
satokcdbbea72010-12-08 16:04:16 +090082#define DEBUG_DICT false
satoka3d78f62010-12-09 22:08:33 +090083#define DEBUG_DICT_FULL false
satokcdbbea72010-12-08 16:04:16 +090084#define DEBUG_SHOW_FOUND_WORD false
satokaee09dc2010-12-09 19:21:51 +090085#define DEBUG_NODE false
satoka3d78f62010-12-09 22:08:33 +090086#define DEBUG_TRACE false
satok8fbd5522011-02-22 17:28:55 +090087#define DEBUG_PROXIMITY_INFO false
satok61e2f852011-01-05 14:13:07 +090088
89#define PROF_BUF_SIZE 0
90#define PROF_RESET
91#define PROF_COUNT(prof_buf_id)
92#define PROF_OPEN
93#define PROF_START(prof_buf_id)
94#define PROF_CLOSE
95#define PROF_END(prof_buf_id)
96#define PROF_CLOCK_OUT(prof_buf_id)
97#define PROF_CLOCKOUT(prof_buf_id)
98#define PROF_OUTALL
99
satoke808e432010-12-02 14:53:24 +0900100#endif // FLAG_DBG
101
satok662fe692010-12-08 17:05:39 +0900102#ifndef U_SHORT_MAX
103#define U_SHORT_MAX 1 << 16
104#endif
Jean Chalarda5d58492011-02-18 17:50:58 +0900105#ifndef S_INT_MAX
satok3c4bb772011-03-04 22:50:19 -0800106#define S_INT_MAX 2147483647 // ((1 << 31) - 1)
Jean Chalarda5d58492011-02-18 17:50:58 +0900107#endif
satok662fe692010-12-08 17:05:39 +0900108
Ken Wakasae90b3332011-01-07 15:01:51 +0900109// Define this to use mmap() for dictionary loading. Undefine to use malloc() instead of mmap().
110// We measured and compared performance of both, and found mmap() is fairly good in terms of
111// loading time, and acceptable even for several initial lookups which involve page faults.
112#define USE_MMAP_FOR_DICTIONARY
113
satoke808e432010-12-02 14:53:24 +0900114// 22-bit address = ~4MB dictionary size limit, which on average would be about 200k-300k words
115#define ADDRESS_MASK 0x3FFFFF
116
117// The bit that decides if an address follows in the next 22 bits
118#define FLAG_ADDRESS_MASK 0x40
119// The bit that decides if this is a terminal node for a word. The node could still have children,
120// if the word has other endings.
121#define FLAG_TERMINAL_MASK 0x80
122
123#define FLAG_BIGRAM_READ 0x80
124#define FLAG_BIGRAM_CHILDEXIST 0x40
125#define FLAG_BIGRAM_CONTINUED 0x80
126#define FLAG_BIGRAM_FREQ 0x7F
127
128#define DICTIONARY_VERSION_MIN 200
129#define DICTIONARY_HEADER_SIZE 2
130#define NOT_VALID_WORD -99
131
satok817e5172011-03-04 06:06:45 -0800132#define KEYCODE_SPACE ' '
133
satok662fe692010-12-08 17:05:39 +0900134#define SUGGEST_WORDS_WITH_MISSING_CHARACTER true
135#define SUGGEST_WORDS_WITH_MISSING_SPACE_CHARACTER true
136#define SUGGEST_WORDS_WITH_EXCESSIVE_CHARACTER true
satoka3d78f62010-12-09 22:08:33 +0900137#define SUGGEST_WORDS_WITH_TRANSPOSED_CHARACTERS true
satok817e5172011-03-04 06:06:45 -0800138#define SUGGEST_WORDS_WITH_SPACE_PROXIMITY true
satoka3d78f62010-12-09 22:08:33 +0900139
Jean Chalard8dc754a2011-01-27 14:20:22 +0900140// The following "rate"s are used as a multiplier before dividing by 100, so they are in percent.
satok72bc17e2011-04-13 17:23:27 +0900141#define WORDS_WITH_MISSING_CHARACTER_DEMOTION_RATE 80
satokdc5301e2011-04-11 16:14:45 +0900142#define WORDS_WITH_MISSING_CHARACTER_DEMOTION_START_POS_10X 12
satoka3d78f62010-12-09 22:08:33 +0900143#define WORDS_WITH_MISSING_SPACE_CHARACTER_DEMOTION_RATE 80
144#define WORDS_WITH_EXCESSIVE_CHARACTER_DEMOTION_RATE 75
satok54fe9e02010-12-13 14:42:35 +0900145#define WORDS_WITH_EXCESSIVE_CHARACTER_OUT_OF_PROXIMITY_DEMOTION_RATE 75
satoka3d78f62010-12-09 22:08:33 +0900146#define WORDS_WITH_TRANSPOSED_CHARACTERS_DEMOTION_RATE 60
satok58c49b92011-01-27 03:23:39 +0900147#define FULL_MATCHED_WORDS_PROMOTION_RATE 120
satok72bc17e2011-04-13 17:23:27 +0900148#define WORDS_WITH_JUST_ONE_PROXIMITY_CHARACTER_PROMOTION_RATE 110
satoke808e432010-12-02 14:53:24 +0900149
satokf5cded12010-12-06 21:28:24 +0900150// This should be greater than or equal to MAX_WORD_LENGTH defined in BinaryDictionary.java
151// This is only used for the size of array. Not to be used in c functions.
152#define MAX_WORD_LENGTH_INTERNAL 48
satok715514d2010-12-02 20:19:59 +0900153
satok68319262010-12-03 19:38:08 +0900154#define MAX_DEPTH_MULTIPLIER 3
155
Jean Chalarda787dba2011-03-04 12:17:48 +0900156// TODO: Reduce this constant if possible; check the maximum number of umlauts in the same German
157// word in the dictionary
158#define DEFAULT_MAX_UMLAUT_SEARCH_DEPTH 5
159
satok54fe9e02010-12-13 14:42:35 +0900160// Minimum suggest depth for one word for all cases except for missing space suggestions.
161#define MIN_SUGGEST_DEPTH 1
162#define MIN_USER_TYPED_LENGTH_FOR_MISSING_SPACE_SUGGESTION 3
163#define MIN_USER_TYPED_LENGTH_FOR_EXCESSIVE_CHARACTER_SUGGESTION 3
satok662fe692010-12-08 17:05:39 +0900164
Tadashi G. Takaoka887f11e2011-02-10 20:53:58 +0900165// The size of next letters frequency array. Zero will disable the feature.
166#define NEXT_LETTERS_SIZE 0
167
satokf5cded12010-12-06 21:28:24 +0900168#define min(a,b) ((a)<(b)?(a):(b))
169
satoke808e432010-12-02 14:53:24 +0900170#endif // LATINIME_DEFINES_H