forked from alk/gpicker
-
Notifications
You must be signed in to change notification settings - Fork 0
/
scorer.c
412 lines (356 loc) · 10.5 KB
/
scorer.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
/*
* Copyright (C) 2008,2009 Aliaksey Kandratsenka
*
* 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/'.
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
#include <assert.h>
#include <inttypes.h>
#include "scorer.h"
#include "compiler.h"
int scorer_utf8_mode = 1;
#define PROPER_WORD_START 0x100000
#define WILD_WORD_START 0x201
#define ADJACENT 0x400
#define max(a,b) ({__typeof__ (a) ____a = (a); __typeof__ (b) ____b = (b); ____b > ____a ? ____b : ____a; })
#if 0
#define dprintf(...) printf(__VA_ARGS__)
#else
__attribute__((format (printf, 1, 2))) __attribute__((unused))
static inline
void ____empty_printf(char *format, ...)
{
}
#define dprintf(...) ____empty_printf(__VA_ARGS__)
#endif
static
int delimiter_p_full(char ch)
{
return (ch == '.' || ch == '_' || ch == '/' || ch == '*' || ch == ' ' || ch == '\'' || ch == '"');
}
static
char delimiter_table[256];
static
char tolower_table[256];
void prepare_scorer(void)
{
int i;
for (i = 0; i < 256; i++) {
char delimiter = delimiter_p_full(i);
delimiter_table[i] = delimiter;
tolower_table[i] = tolower(i);
if (i == '-')
tolower_table[i] = '_';
}
}
static inline
int delimiter_p(char ch)
{
return delimiter_table[ch];
}
static inline
char normalize_char(char ch, unsigned *is_delimiter)
{
ch = tolower_table[ch];
if (is_delimiter)
*is_delimiter = delimiter_p(ch);
return ch;
}
#define MAX_PAT_LENGTH 32
static
void initialize_prepared_pattern(const char *pattern,
struct prepared_pattern *rv)
{
unsigned previous_delimiter = 1;
int i;
for (i=0; i<rv->pat_length; i++) {
char ch = pattern[i];
rv->start_of_pattern_word[i] = previous_delimiter || ('A' <= ch && ch <= 'Z');
rv->translated_pattern[i] = normalize_char(ch, &previous_delimiter);
}
char fc_count = 0;
for (i = 0; i < rv->pat_length && fc_count < 4; i++) {
char ch = rv->translated_pattern[i];
if (!delimiter_p(ch)) {
rv->first_chars[fc_count*2] = ch;
rv->first_chars[fc_count*2+1] = toupper(ch);
fc_count++;
}
}
rv->fc_count = fc_count;
}
struct prepared_pattern *prepare_pattern(const struct scorer_query *query)
{
const char *pattern = query->pattern;
unsigned pat_length = strlen(pattern);
if (pat_length > MAX_PAT_LENGTH)
pat_length = MAX_PAT_LENGTH;
char *start_of_pattern_word = pat_length ? malloc(pat_length) : 0;
char *translated_pattern = pat_length ? malloc(pat_length) : 0;
struct prepared_pattern *rv = malloc(sizeof(struct prepared_pattern));
rv->translated_pattern = translated_pattern;
rv->start_of_pattern_word = start_of_pattern_word;
rv->pat_length = pat_length;
if (pat_length)
initialize_prepared_pattern(pattern, rv);
return rv;
}
void free_prepared_pattern(struct prepared_pattern *p)
{
if (!p)
return;
free(p->start_of_pattern_word);
free(p->translated_pattern);
free(p);
}
static inline __attribute__((always_inline))
int score_string_prepared_inline(const unsigned pat_length,
const char *string,
const struct scorer_query *query,
const struct prepared_pattern *prepared_pattern,
const unsigned string_length,
unsigned* match)
{
struct position {
int this_score;
int score;
int amount;
};
struct position state[string_length][__BUILTIN_CONSTANT(pat_length) ? pat_length : MAX_PAT_LENGTH];
char *start_of_pattern_word = prepared_pattern->start_of_pattern_word;
char *translated_pattern = prepared_pattern->translated_pattern;
unsigned i;
unsigned k;
unsigned previous_delimiter;
int score;
if (pat_length == 0)
return 0;
if (string_length == 0)
return -1;
dprintf("scoring string '%.*s' for pattern '%s'\n", string_length, string, query->pattern);
#if 1
if (prepared_pattern->fc_count > 0) {
const char *p = string;
char ch;
#define I(i) \
do { \
ch = prepared_pattern->first_chars[i*2]; \
if (ch) { \
const char *next = memchr(p, ch, string + string_length - p); \
const char *next2 = memchr(p, prepared_pattern->first_chars[i*2+1], string + string_length - p); \
if (!next && !next2) \
return -1; \
if (!next) \
next = next2; \
else if (!next2) \
next2 = next; \
p = ((next < next2) ? next : next2) + 1; \
} \
} while (0)
I(0);
if (prepared_pattern->fc_count > 1) {
I(1);
if (prepared_pattern->fc_count > 2) {
I(2);
if (prepared_pattern->fc_count > 3)
I(3);
}
}
#undef I
}
#endif
memset(state, -1, sizeof(state));
previous_delimiter = 1;
for (i=0; i<string_length; i++) {
char ch = string[i];
unsigned max_k;
unsigned at_word_start = previous_delimiter || ('A' <= ch && ch <= 'Z');
ch = normalize_char(ch, &previous_delimiter);
if (ch == translated_pattern[0]) {
int amount = at_word_start ? PROPER_WORD_START : 0;
if (i > 0 && state[i-1][0].score > amount)
state[i][0].score = state[i-1][0].score;
else
state[i][0].score = amount;
state[i][0].this_score = amount;
state[i][0].amount = amount;
} else {
state[i][0].this_score = -1;
state[i][0].amount = 0;
state[i][0].score = i > 0 ? state[i-1][0].score : -1;
}
if (!__BUILTIN_CONSTANT(pat_length) || pat_length > 1) {
max_k = i+1;
max_k = (max_k > pat_length) ? pat_length : max_k;
for (k=1; k<max_k; k++) {
char pat_ch = translated_pattern[k];
int prev_score;
char prev_pattern;
int amount;
int this_score;
prev_score = state[i-1][k-1].score;
if (pat_ch == '_') { // always match '_'
state[i][k].score = prev_score;
state[i][k].amount = 0;
state[i][k].this_score = prev_score;
continue;
}
if (ch != pat_ch) {
cont:
state[i][k].score = state[i-1][k].score;
state[i][k].amount = 0;
state[i][k].this_score = -1;
continue;
}
if (prev_score < 0)
goto cont;
amount = 0;
prev_pattern = translated_pattern[k-1];
if (at_word_start)
amount = start_of_pattern_word[k] ? PROPER_WORD_START : WILD_WORD_START;
// '_' demands proper word start after itself, and nothing less
if (prev_pattern == '_')
if (amount != PROPER_WORD_START)
goto cont;
this_score = prev_score + amount;
// if current pattern byte is
// continuation of utf8 sequence, then
// it must match adjacently.
if (__EXPECT(scorer_utf8_mode, 1) && __EXPECT(utf8_continuation_p(pat_ch), 0)) {
if (state[i-1][k-1].this_score < 0)
goto cont;
this_score = 0; // force win
// of next candidate
}
if (state[i-1][k-1].this_score >= 0 && !delimiter_p(pat_ch)) {
int candidate = state[i-1][k-1].this_score + ADJACENT;
if (candidate > this_score)
this_score = candidate, amount = ADJACENT;
}
state[i][k].this_score = this_score;
state[i][k].amount = amount;
state[i][k].score = max(state[i-1][k].score, this_score);
}
}
}
score = state[string_length-1][pat_length-1].score;
dprintf("score: %d\n", score);
if (!match || score < 0)
return score;
{
int t = score;
k = string_length;
for (i=pat_length-1; i<(unsigned)-1; i--) {
if (query->right_match) {
for (k=k-1; k>=i; k--)
if (state[k][i].this_score == t)
break;
assert(k>=i);
} else {
int last_k = k;
for (k=0; k<last_k; k++)
if (state[k][i].this_score == t)
break;
assert(k<string_length);
}
match_again:
match[i] = k;
if (translated_pattern[i] == '_')
match[i] = SCORER_MATCH_NONE;
if (__EXPECT(scorer_utf8_mode, 1)
&& __EXPECT(utf8_continuation_p(translated_pattern[i]), 0)) {
match[i] = SCORER_MATCH_NONE;
}
t -= state[k][i].amount;
if (state[k][i].amount == ADJACENT) {
assert(i>0);
k--;
i--;
goto match_again;
}
}
assert(t == 0);
}
return score;
}
/* partial compilation for pat_length == 1 */
static __attribute__((noinline))
int score_string_prepared_1(const char *string,
const struct scorer_query *query,
const struct prepared_pattern *prepared_pattern,
const unsigned string_length,
unsigned* match)
{
return score_string_prepared_inline(1, string, query, prepared_pattern, string_length, match);
}
/* partial compilation for pat_length == 2 */
static __attribute__((noinline))
int score_string_prepared_2(const char *string,
const struct scorer_query *query,
const struct prepared_pattern *prepared_pattern,
const unsigned string_length,
unsigned* match)
{
return score_string_prepared_inline(2, string, query, prepared_pattern, string_length, match);
}
int score_string_prepared(const char *string,
const struct scorer_query *query,
const struct prepared_pattern *prepared_pattern,
const unsigned string_length,
unsigned* match)
{
if (!prepared_pattern)
return -1;
if (prepared_pattern->pat_length == 1) {
return score_string_prepared_1(string, query, prepared_pattern, string_length, match);
}
if (prepared_pattern->pat_length == 2) {
return score_string_prepared_2(string, query, prepared_pattern, string_length, match);
}
return score_string_prepared_inline(prepared_pattern->pat_length, string, query, prepared_pattern, string_length, match);
}
int score_string(const char *string,
const struct scorer_query *query,
const unsigned string_length,
unsigned* match)
{
const char *pattern = query->pattern;
unsigned pat_length = strlen(pattern);
char start_of_pattern_word[pat_length];
char translated_pattern[pat_length];
if (pat_length == 0)
return 0;
if (string_length == 0)
return -1;
if (pat_length > MAX_PAT_LENGTH)
pat_length = MAX_PAT_LENGTH;
struct prepared_pattern p = {
.translated_pattern = translated_pattern,
.start_of_pattern_word = start_of_pattern_word,
.pat_length = pat_length
};
if (pat_length)
initialize_prepared_pattern(pattern, &p);
return score_string_prepared(string, query, &p, string_length, match);
}
int score_simple_string(const char *string, const char *pattern, unsigned *match)
{
struct scorer_query qry = {.pattern = pattern,.right_match = 0};
unsigned string_length = strlen(string);
return score_string(string, &qry, string_length, match);
}