ft_boolean_search.c 18.9 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18
/* Copyright (C) 2000 MySQL AB & MySQL Finland AB & TCX DataKonsult AB

   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 2 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, write to the Free Software
   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA */

/* Written by Sergei A. Golubchik, who has a shared copyright to this code */

19 20
/*  TODO: add caching - pre-read several index entries at once */

21
#define FT_CORE
22
#include "ftdefs.h"
23
#include <queues.h>
24 25 26

/* search with boolean queries */

27 28
static double _wghts[11]=
{
29 30 31 32 33 34 35 36 37 38 39
  0.131687242798354,
  0.197530864197531,
  0.296296296296296,
  0.444444444444444,
  0.666666666666667,
  1.000000000000000,
  1.500000000000000,
  2.250000000000000,
  3.375000000000000,
  5.062500000000000,
  7.593750000000000};
40
static double *wghts=_wghts+5; /* wghts[i] = 1.5**i */
41

42 43
static double _nwghts[11]=
{
44 45 46 47 48 49 50 51 52 53 54
 -0.065843621399177,
 -0.098765432098766,
 -0.148148148148148,
 -0.222222222222222,
 -0.333333333333334,
 -0.500000000000000,
 -0.750000000000000,
 -1.125000000000000,
 -1.687500000000000,
 -2.531250000000000,
 -3.796875000000000};
55
static double *nwghts=_nwghts+5; /* nwghts[i] = -0.5*1.5**i */
56

57
#define FTB_FLAG_TRUNC 1                  /* MUST be 1                  */
58 59 60
#define FTB_FLAG_YES   2                  /*  no two from these three   */
#define FTB_FLAG_NO    4                  /*   YES, NO, WONLY           */
#define FTB_FLAG_WONLY 8                  /*  should be ever set both   */
61

62
typedef struct st_ftb_expr FTB_EXPR;
63 64
struct st_ftb_expr
{
65 66
  FTB_EXPR *up;
  float     weight;
67
  uint      flags;
serg@serg.mylan's avatar
serg@serg.mylan committed
68 69
  my_off_t  docid[2];
/* ^^^^^^^^^^^^^^^^^^ FTB_{EXPR,WORD} common section */
70
  float     cur_weight;
serg@serg.mylan's avatar
serg@serg.mylan committed
71
  byte     *quot, *qend;
72 73 74
  int       yesses;               /* number of "yes" words matched */
  int       nos;                  /* number of "no"  words matched */
  int       ythresh;              /* number of "yes" words in expr */
75
  int       yweaks;               /* number of "yes" words for scan only */
76 77
};

78 79
typedef struct st_ftb_word
{
80 81
  FTB_EXPR *up;
  float     weight;
82
  uint      flags;
serg@serg.mylan's avatar
serg@serg.mylan committed
83 84
  my_off_t  docid[2];
/* ^^^^^^^^^^^^^^^^^^ FTB_{EXPR,WORD} common section */
85 86
  uint      ndepth;
  int       len;
serg@serg.mysql.com's avatar
serg@serg.mysql.com committed
87
  /* ... docid cache can be added here. SerG */
88 89 90
  byte      word[1];
} FTB_WORD;

91 92
typedef struct st_ft_info
{
93
  struct _ft_vft *please;
94
  MI_INFO   *info;
95
  uint       keynr;
96
  CHARSET_INFO *charset;
97
  enum { UNINITIALIZED, READY, INDEX_SEARCH, INDEX_DONE /*, SCAN*/ } state;
98
  uint       with_scan;
99
  my_off_t   lastpos;
100 101
  FTB_EXPR  *root;
  QUEUE      queue;
serg@serg.mysql.com's avatar
serg@serg.mysql.com committed
102
  TREE       no_dupes;
103
  FTB_WORD **list;
104 105 106
  MEM_ROOT   mem_root;
} FTB;

107
static int FTB_WORD_cmp(my_off_t *v, FTB_WORD *a, FTB_WORD *b)
108
{
109 110 111 112 113 114
  int i;

  /* if a==curdoc, take it as  a < b */
  if (v && a->docid[0] == *v)
    return -1;

115
  /* ORDER BY docid, ndepth DESC */
116
  i=CMP_NUM(a->docid[0], b->docid[0]);
117
  if (!i)
118
    i=CMP_NUM(b->ndepth,a->ndepth);
119 120 121
  return i;
}

122
static int FTB_WORD_cmp_list(CHARSET_INFO *cs, FTB_WORD **a, FTB_WORD **b)
123 124
{
  /* ORDER BY word DESC, ndepth DESC */
125 126
  int i=_mi_compare_text(cs, (uchar*) (*b)->word+1,(*b)->len-1,
                             (uchar*) (*a)->word+1,(*a)->len-1,0);
127
  if (!i)
128
    i=CMP_NUM((*b)->ndepth,(*a)->ndepth);
129
  return i;
130
}
131

132
static void _ftb_parse_query(FTB *ftb, byte **start, byte *end,
serg@serg.mysql.com's avatar
serg@serg.mysql.com committed
133
                      FTB_EXPR *up, uint depth)
134 135 136 137 138 139
{
  byte        res;
  FTB_PARAM   param;
  FT_WORD     w;
  FTB_WORD   *ftbw;
  FTB_EXPR   *ftbe;
140
  uint  extra=HA_FT_WLEN+ftb->info->s->rec_reflength; /* just a shortcut */
141

142
  if (ftb->state != UNINITIALIZED)
143 144
    return;

145
  param.prev=' ';
serg@serg.mysql.com's avatar
serg@serg.mysql.com committed
146
  param.quot=up->quot;
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
147
  while ((res=ft_get_word(start,end,&w,&param)))
148
  {
serg@serg.mysql.com's avatar
serg@serg.mysql.com committed
149
    int   r=param.plusminus;
150
    float weight= (float) (param.pmsign ? nwghts : wghts)[(r>5)?5:((r<-5)?-5:r)];
151
    switch (res) {
152
      case 1: /* word found */
153
        ftbw=(FTB_WORD *)alloc_root(&ftb->mem_root,
serg@serg.mysql.com's avatar
serg@serg.mysql.com committed
154 155 156
                                    sizeof(FTB_WORD) +
                                    (param.trunc ? MI_MAX_KEY_BUFF :
                                     w.len+extra));
157
        ftbw->len=w.len+1;
158 159 160 161
        ftbw->flags=0;
        if (param.yesno>0) ftbw->flags|=FTB_FLAG_YES;
        if (param.yesno<0) ftbw->flags|=FTB_FLAG_NO;
        if (param.trunc)   ftbw->flags|=FTB_FLAG_TRUNC;
162 163
        ftbw->weight=weight;
        ftbw->up=up;
164
        ftbw->docid[0]=ftbw->docid[1]=HA_OFFSET_ERROR;
165
        ftbw->ndepth= (param.yesno<0) + depth;
166 167
        memcpy(ftbw->word+1, w.pos, w.len);
        ftbw->word[0]=w.len;
168
        if (param.yesno > 0) up->ythresh++;
169
        queue_insert(& ftb->queue, (byte *)ftbw);
serg@serg.mysql.com's avatar
serg@serg.mysql.com committed
170
        ftb->with_scan|=(param.trunc & FTB_FLAG_TRUNC);
171
        break;
172 173
      case 2: /* left bracket */
        ftbe=(FTB_EXPR *)alloc_root(&ftb->mem_root, sizeof(FTB_EXPR));
174 175 176
        ftbe->flags=0;
        if (param.yesno>0) ftbe->flags|=FTB_FLAG_YES;
        if (param.yesno<0) ftbe->flags|=FTB_FLAG_NO;
177 178
        ftbe->weight=weight;
        ftbe->up=up;
179
        ftbe->ythresh=ftbe->yweaks=0;
180
        ftbe->docid[0]=ftbe->docid[1]=HA_OFFSET_ERROR;
serg@serg.mysql.com's avatar
serg@serg.mysql.com committed
181
        if ((ftbe->quot=param.quot)) ftb->with_scan|=2;
182
        if (param.yesno > 0) up->ythresh++;
183
        _ftb_parse_query(ftb, start, end, ftbe, depth+1);
184
        param.quot=0;
185 186
        break;
      case 3: /* right bracket */
serg@serg.mysql.com's avatar
serg@serg.mysql.com committed
187
        if (up->quot) up->qend=param.quot;
188
        return;
189 190
    }
  }
191
  return;
192 193
}

194 195
static int _ftb_no_dupes_cmp(void* not_used __attribute__((unused)),
			     const void *a,const void *b)
serg@serg.mysql.com's avatar
serg@serg.mysql.com committed
196 197 198 199
{
  return CMP_NUM((*((my_off_t*)a)), (*((my_off_t*)b)));
}

200
static void _ftb_init_index_search(FT_INFO *ftb)
201 202
{
  int i, r;
203
  FTB_WORD   *ftbw;
204
  MI_INFO    *info=ftb->info;
205 206
  MI_KEYDEF  *keyinfo;
  my_off_t    keyroot;
207

208 209
  if ((ftb->state != READY && ftb->state !=INDEX_DONE) ||
      ftb->keynr == NO_SUCH_KEY)
210 211 212
    return;
  ftb->state=INDEX_SEARCH;

213 214 215
  keyinfo=info->s->keyinfo+ftb->keynr;
  keyroot=info->s->state.key_root[ftb->keynr];

216 217 218 219
  for (i=ftb->queue.elements; i; i--)
  {
    ftbw=(FTB_WORD *)(ftb->queue.root[i]);

220 221 222
    if (ftbw->flags & FTB_FLAG_TRUNC)
    {
      /*
serg@serg.mylan's avatar
serg@serg.mylan committed
223 224
	special treatment for truncation operator
        1. there are some (besides this) +words
225 226
           | no need to search in the index, it can never ADD new rows
           | to the result, and to remove half-matched rows we do scan anyway
227
        2. -trunc*
228
           | same as 1.
serg@serg.mylan's avatar
serg@serg.mylan committed
229 230 231
        3. in 1 and 2, +/- need not be on the same expr. level,
           but can be on any upper level, as in +word +(trunc1* trunc2*)
        4. otherwise
232 233 234 235 236 237
           | We have to index-search for this prefix.
           | It may cause duplicates, as in the index (sorted by <word,docid>)
           |   <aaaa,row1>
           |   <aabb,row2>
           |   <aacc,row1>
           | Searching for "aa*" will find row1 twice...
238
      */
serg@serg.mylan's avatar
serg@serg.mylan committed
239 240 241 242
      FTB_EXPR *ftbe;
      for (ftbe=(FTB_EXPR*)ftbw;
           ftbe->up && !(ftbe->up->flags & FTB_FLAG_TRUNC);
           ftbe->up->flags|= FTB_FLAG_TRUNC, ftbe=ftbe->up)
serg@serg.mysql.com's avatar
serg@serg.mysql.com committed
243
      {
serg@serg.mylan's avatar
serg@serg.mylan committed
244 245 246 247
        if (ftbe->flags & FTB_FLAG_NO ||                     /* 2 */
             ftbe->up->ythresh - ftbe->up->yweaks >1)        /* 1 */
        {
          FTB_EXPR *top_ftbe=ftbe->up->up;
248
          ftbw->docid[0]=HA_OFFSET_ERROR;
serg@serg.mylan's avatar
serg@serg.mylan committed
249 250 251 252 253 254
          for (ftbe=ftbw->up; ftbe != top_ftbe; ftbe=ftbe->up)
            if (ftbe->flags & FTB_FLAG_YES)
              ftbe->yweaks++;
          ftbe=0;
          break;
        }
serg@serg.mysql.com's avatar
serg@serg.mysql.com committed
255
      }
serg@serg.mylan's avatar
serg@serg.mylan committed
256 257 258 259 260 261 262 263
      if (!ftbe)
        continue;
      /* 3 */
      if (!is_tree_inited(& ftb->no_dupes))
        init_tree(& ftb->no_dupes,0,0,sizeof(my_off_t),
            _ftb_no_dupes_cmp,0,0,0);
      else
        reset_tree(& ftb->no_dupes);
264
    }
265 266 267 268 269 270 271 272
    for (
         r=_mi_search(info, keyinfo, (uchar*) ftbw->word, ftbw->len,
                      SEARCH_FIND | SEARCH_BIGGER, keyroot) ;
         !r && info->lastpos >= info->state->data_file_length;
         r=_mi_search_next(info, keyinfo, info->lastkey, info->lastkey_length,
                           SEARCH_BIGGER, keyroot)
        );

273 274
    if (!r)
    {
275
      r=_mi_compare_text(ftb->charset,
276 277
                         info->lastkey + (ftbw->flags&FTB_FLAG_TRUNC),
                         ftbw->len     - (ftbw->flags&FTB_FLAG_TRUNC),
278
                         (uchar*) ftbw->word    + (ftbw->flags&FTB_FLAG_TRUNC),
279
                         ftbw->len     - (ftbw->flags&FTB_FLAG_TRUNC),
serg@serg.mysql.com's avatar
serg@serg.mysql.com committed
280
                         0);
281 282 283
    }
    if (r) /* not found */
    {
284
      if (ftbw->flags&FTB_FLAG_YES && ftbw->up->up==0)
285 286 287 288 289
      {
	/*
	  This word MUST BE present in every document returned,
	  so we can abort the search right now
	*/
290 291 292 293 294 295 296
        ftb->state=INDEX_DONE;
        return;
      }
    }
    else
    {
      memcpy(ftbw->word, info->lastkey, info->lastkey_length);
297
      ftbw->docid[0]=info->lastpos;
298 299 300 301 302
    }
  }
  queue_fix(& ftb->queue);
}

303

304
FT_INFO * ft_init_boolean_search(MI_INFO *info, uint keynr, byte *query,
305 306
				 uint query_len,
				 my_bool presort __attribute__((unused)))
307
{
308 309 310
  FTB       *ftb;
  FTB_EXPR  *ftbe;
  uint       res;
311

312 313
  if (!(ftb=(FTB *)my_malloc(sizeof(FTB), MYF(MY_WME))))
    return 0;
314
  ftb->please= (struct _ft_vft *) & _ft_vft_boolean;
315
  ftb->state=UNINITIALIZED;
316 317
  ftb->info=info;
  ftb->keynr=keynr;
318 319 320
  ftb->charset= ((keynr==NO_SUCH_KEY) ?
    default_charset_info              :
    info->s->keyinfo[keynr].seg->charset);
321
  ftb->with_scan=0;
322
  ftb->lastpos=HA_OFFSET_ERROR;
serg@serg.mysql.com's avatar
serg@serg.mysql.com committed
323
  bzero(& ftb->no_dupes, sizeof(TREE));
324

325
  init_alloc_root(&ftb->mem_root, 1024, 1024);
326

327 328 329 330
  /*
    Hack: instead of init_queue, we'll use reinit queue to be able
    to alloc queue with alloc_root()
  */
331
  res=ftb->queue.max_elements=1+query_len/(min(ft_min_word_len,2)+1);
332 333 334
  if (!(ftb->queue.root=
        (byte **)alloc_root(&ftb->mem_root, (res+1)*sizeof(void*))))
    goto err;
335
  reinit_queue(& ftb->queue, res, 0, 0,
336
                         (int (*)(void*,byte*,byte*))FTB_WORD_cmp, 0);
337 338
  if (!(ftbe=(FTB_EXPR *)alloc_root(&ftb->mem_root, sizeof(FTB_EXPR))))
    goto err;
339
  ftbe->weight=1;
340 341
  ftbe->flags=FTB_FLAG_YES;
  ftbe->nos=1;
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
342 343
  ftbe->quot=0;
  ftbe->up=0;
344
  ftbe->ythresh=ftbe->yweaks=0;
345
  ftbe->docid[0]=ftbe->docid[1]=HA_OFFSET_ERROR;
346
  ftb->root=ftbe;
347
  _ftb_parse_query(ftb, &query, query+query_len, ftbe, 0);
348 349
  ftb->list=(FTB_WORD **)alloc_root(&ftb->mem_root,
                                     sizeof(FTB_WORD *)*ftb->queue.elements);
serg@serg.mysql.com's avatar
serg@serg.mysql.com committed
350
  memcpy(ftb->list, ftb->queue.root+1, sizeof(FTB_WORD *)*ftb->queue.elements);
351
  qsort2(ftb->list, ftb->queue.elements, sizeof(FTB_WORD *),
352
                              (qsort2_cmp)FTB_WORD_cmp_list, ftb->charset);
serg@serg.mysql.com's avatar
serg@serg.mysql.com committed
353
  if (ftb->queue.elements<2) ftb->with_scan &= ~FTB_FLAG_TRUNC;
354
  ftb->state=READY;
355
  return ftb;
356 357 358 359
err:
  free_root(& ftb->mem_root, MYF(0));
  my_free((gptr)ftb,MYF(0));
  return 0;
360
}
361

362

363
/* returns 1 if str0 ~= /\bstr1\b/ */
364
static int _ftb_strstr(const byte *s0, const byte *e0,
serg@serg.mysql.com's avatar
serg@serg.mysql.com committed
365 366
                const byte *s1, const byte *e1,
                CHARSET_INFO *cs)
367
{
serg@serg.mylan's avatar
serg@serg.mylan committed
368 369
  const byte *p0, *p1;
  my_bool s_after, e_before;
serg@serg.mysql.com's avatar
serg@serg.mysql.com committed
370

serg@serg.mylan's avatar
serg@serg.mylan committed
371 372 373 374 375
  s_after=true_word_char(s1[0]);
  e_before=true_word_char(e1[-1]);
  p0=s0;

  while (p0 < e0)
serg@serg.mysql.com's avatar
serg@serg.mysql.com committed
376
  {
serg@serg.mylan's avatar
serg@serg.mylan committed
377
    while (p0 < e0 && cs->to_upper[(uint) (uchar) *p0++] !=
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
378
	   cs->to_upper[(uint) (uchar) *s1])
serg@serg.mysql.com's avatar
serg@serg.mysql.com committed
379
      /* no-op */;
serg@serg.mylan's avatar
serg@serg.mylan committed
380
    if (p0 >= e0)
serg@serg.mysql.com's avatar
serg@serg.mysql.com committed
381
      return 0;
serg@serg.mylan's avatar
serg@serg.mylan committed
382 383 384 385 386 387 388 389 390

    if (s_after && p0-1 > s0 && true_word_char(p0[-2]))
      continue;

    p1=s1+1;
    while (p0 < e0 && p1 < e1 && cs->to_upper[(uint) (uchar) *p0] ==
	   cs->to_upper[(uint) (uchar) *p1])
      p0++, p1++;
    if (p1 == e1 && (!e_before || p0 == e0 || !true_word_char(p0[0])))
serg@serg.mysql.com's avatar
serg@serg.mysql.com committed
391 392 393 394 395
      return 1;
  }
  return 0;
}

396

397
static void _ftb_climb_the_tree(FTB *ftb, FTB_WORD *ftbw, FT_SEG_ITERATOR *ftsi_orig)
serg@serg.mysql.com's avatar
serg@serg.mysql.com committed
398 399
{
  FT_SEG_ITERATOR ftsi;
400 401
  FTB_EXPR *ftbe;
  float weight=ftbw->weight;
serg@serg.mysql.com's avatar
serg@serg.mysql.com committed
402
  int  yn=ftbw->flags, ythresh, mode=(ftsi_orig != 0);
403
  my_off_t curdoc=ftbw->docid[mode];
404 405 406

  for (ftbe=ftbw->up; ftbe; ftbe=ftbe->up)
  {
407 408
    ythresh = ftbe->ythresh - (mode ? 0 : ftbe->yweaks);
    if (ftbe->docid[mode] != curdoc)
409
    {
410 411
      ftbe->cur_weight=0;
      ftbe->yesses=ftbe->nos=0;
412
      ftbe->docid[mode]=curdoc;
413
    }
414 415
    if (ftbe->nos)
      break;
416
    if (yn & FTB_FLAG_YES)
417
    {
418 419
      weight /= ftbe->ythresh;
      ftbe->cur_weight += weight;
420
      if (++ftbe->yesses == ythresh)
421
      {
422
        yn=ftbe->flags;
423
        weight=ftbe->cur_weight*ftbe->weight;
serg@serg.mysql.com's avatar
serg@serg.mysql.com committed
424 425 426 427 428 429 430 431 432 433 434 435 436 437
        if (mode && ftbe->quot)
        {
          int not_found=1;

          memcpy(&ftsi, ftsi_orig, sizeof(ftsi));
          while (_mi_ft_segiterator(&ftsi) && not_found)
          {
            if (!ftsi.pos)
              continue;
            not_found = ! _ftb_strstr(ftsi.pos, ftsi.pos+ftsi.len,
                                      ftbe->quot, ftbe->qend, ftb->charset);
          }
          if (not_found) break;
        } /* ftbe->quot */
438 439 440 441 442
      }
      else
        break;
    }
    else
443
    if (yn & FTB_FLAG_NO)
444
    {
445 446 447 448 449 450 451
      /*
	NOTE: special sort function of queue assures that all
	(yn & FTB_FLAG_NO) != 0
	events for every particular subexpression will
	"auto-magically" happen BEFORE all the
	(yn & FTB_FLAG_YES) != 0 events. So no
	already matched expression can become not-matched again.
452 453 454 455 456 457
      */
      ++ftbe->nos;
      break;
    }
    else
    {
458 459
      if (ftbe->ythresh)
	weight/=3;
460
      ftbe->cur_weight +=  weight;
461
      if (ftbe->yesses < ythresh)
462
        break;
463 464
      if (!(yn & FTB_FLAG_WONLY))
        yn= (ftbe->yesses++ == ythresh) ? ftbe->flags : FTB_FLAG_WONLY ;
465
      weight*= ftbe->weight;
466 467 468 469
    }
  }
}

470

471
int ft_boolean_read_next(FT_INFO *ftb, char *record)
472
{
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
473
  FTB_EXPR  *ftbe;
474 475 476 477 478 479 480
  FTB_WORD  *ftbw;
  MI_INFO   *info=ftb->info;
  MI_KEYDEF *keyinfo=info->s->keyinfo+ftb->keynr;
  my_off_t   keyroot=info->s->state.key_root[ftb->keynr];
  my_off_t   curdoc;
  int        r;

481 482
  if (ftb->state != INDEX_SEARCH && ftb->state != INDEX_DONE)
    return -1;
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
483

484 485 486 487 488 489 490
  /* black magic ON */
  if ((int) _mi_check_index(info, ftb->keynr) < 0)
    return my_errno;
  if (_mi_readinfo(info, F_RDLCK, 1))
    return my_errno;
  /* black magic OFF */

491 492
  if (!ftb->queue.elements)
    return my_errno=HA_ERR_END_OF_FILE;
493

494 495 496
  /* Attention!!! Address of a local variable is used here! See err: label */
  ftb->queue.first_cmp_arg=(void *)&curdoc;

497 498
  while (ftb->state == INDEX_SEARCH &&
	 (curdoc=((FTB_WORD *)queue_top(& ftb->queue))->docid[0]) !=
499
	 HA_OFFSET_ERROR)
500
  {
501
    while (curdoc==(ftbw=(FTB_WORD *)queue_top(& ftb->queue))->docid[0])
502
    {
serg@serg.mysql.com's avatar
serg@serg.mysql.com committed
503
      _ftb_climb_the_tree(ftb, ftbw, 0);
504

505
      /* update queue */
506 507 508 509 510 511 512
      for (
          r=_mi_search(info, keyinfo, (uchar*) ftbw->word, USE_WHOLE_KEY,
                       SEARCH_BIGGER, keyroot) ;
           !r && info->lastpos >= info->state->data_file_length ;
           r=_mi_search_next(info, keyinfo, info->lastkey, info->lastkey_length,
                             SEARCH_BIGGER, keyroot)
          );
513 514
      if (!r)
      {
515
        r=_mi_compare_text(ftb->charset,
516 517
                           info->lastkey + (ftbw->flags&FTB_FLAG_TRUNC),
                           ftbw->len     - (ftbw->flags&FTB_FLAG_TRUNC),
518
                           (uchar*) ftbw->word + (ftbw->flags&FTB_FLAG_TRUNC),
serg@serg.mysql.com's avatar
serg@serg.mysql.com committed
519
                           ftbw->len     - (ftbw->flags&FTB_FLAG_TRUNC),
520
                           0);
521 522 523
      }
      if (r) /* not found */
      {
524
        ftbw->docid[0]=HA_OFFSET_ERROR;
525
        if (ftbw->flags&FTB_FLAG_YES && ftbw->up->up==0)
526 527 528 529 530
        {
	  /*
	    This word MUST BE present in every document returned,
	    so we can stop the search right now
	  */
531
          ftb->state=INDEX_DONE;
532
        }
533 534 535 536
      }
      else
      {
        memcpy(ftbw->word, info->lastkey, info->lastkey_length);
537
        ftbw->docid[0]=info->lastpos;
538
      }
539
      queue_replaced(& ftb->queue);
540
    }
541

542
    ftbe=ftb->root;
543 544
    if (ftbe->docid[0]==curdoc && ftbe->cur_weight>0 &&
        ftbe->yesses>=(ftbe->ythresh-ftbe->yweaks) && !ftbe->nos)
545 546
    {
      /* curdoc matched ! */
serg@serg.mysql.com's avatar
serg@serg.mysql.com committed
547 548 549 550 551
      if (is_tree_inited(& ftb->no_dupes) &&
          tree_insert(& ftb->no_dupes, &curdoc, 0)->count >1)
        /* but it managed to get past this line once */
        continue;

552
      info->lastpos=curdoc;
553
      info->update&= (HA_STATE_CHANGED | HA_STATE_ROW_CHANGED);
554

555 556
      if (!(*info->read_record)(info,curdoc,record))
      {
557
        info->update|= HA_STATE_AKTIV;          /* Record is read */
558 559
        if (ftb->with_scan && ft_boolean_find_relevance(ftb,record,0)==0)
            continue; /* no match */
560 561
        my_errno=0;
        goto err;
562
      }
563
      goto err;
564 565
    }
  }
566
  ftb->state=INDEX_DONE;
567 568 569 570
  my_errno=HA_ERR_END_OF_FILE;
err:
  ftb->queue.first_cmp_arg=(void *)0;
  return my_errno;
571 572
}

573

574
float ft_boolean_find_relevance(FT_INFO *ftb, byte *record, uint length)
575
{
576
  FT_WORD word;
577 578
  FTB_WORD *ftbw;
  FTB_EXPR *ftbe;
serg@serg.mysql.com's avatar
serg@serg.mysql.com committed
579
  FT_SEG_ITERATOR ftsi, ftsi2;
580
  const byte *end;
581
  my_off_t  docid=ftb->info->lastpos;
582

583
  if (docid == HA_OFFSET_ERROR)
584
    return -2.0;
serg@serg.mysql.com's avatar
serg@serg.mysql.com committed
585 586
  if (!ftb->queue.elements)
    return 0;
587

588
  if (ftb->state != INDEX_SEARCH && docid <= ftb->lastpos)
589 590 591 592 593 594
  {
    FTB_EXPR *x;
    uint i;

    for (i=0; i < ftb->queue.elements; i++)
    {
595
      ftb->list[i]->docid[1]=HA_OFFSET_ERROR;
596
      for (x=ftb->list[i]->up; x; x=x->up)
597
        x->docid[1]=HA_OFFSET_ERROR;
598 599 600 601 602
    }
  }

  ftb->lastpos=docid;

603 604 605 606
  if (ftb->keynr==NO_SUCH_KEY)
    _mi_ft_segiterator_dummy_init(record, length, &ftsi);
  else
    _mi_ft_segiterator_init(ftb->info, ftb->keynr, record, &ftsi);
serg@serg.mysql.com's avatar
serg@serg.mysql.com committed
607
  memcpy(&ftsi2, &ftsi, sizeof(ftsi));
608

609
  while (_mi_ft_segiterator(&ftsi))
610
  {
611 612 613 614
    if (!ftsi.pos)
      continue;

    end=ftsi.pos+ftsi.len;
615
    while (ft_simple_get_word((byte **) &ftsi.pos,(byte *) end, &word))
616
    {
617 618
      int a, b, c;
      for (a=0, b=ftb->queue.elements, c=(a+b)/2; b-a>1; c=(a+b)/2)
619
      {
620
        ftbw=ftb->list[c];
621
        if (_mi_compare_text(ftb->charset, (uchar*) word.pos, word.len,
622 623
                             (uchar*) ftbw->word+1, ftbw->len-1,
                             (my_bool) (ftbw->flags&FTB_FLAG_TRUNC)) >0)
624 625 626 627
          b=c;
        else
          a=c;
      }
628
      for (; c>=0; c--)
629
      {
630
        ftbw=ftb->list[c];
631
        if (_mi_compare_text(ftb->charset, (uchar*) word.pos, word.len,
632 633
                             (uchar*) ftbw->word+1,ftbw->len-1,
                              (my_bool) (ftbw->flags&FTB_FLAG_TRUNC)))
634
          break;
635
        if (ftbw->docid[1] == docid)
636
          continue;
637
        ftbw->docid[1]=docid;
serg@serg.mysql.com's avatar
serg@serg.mysql.com committed
638
        _ftb_climb_the_tree(ftb, ftbw, &ftsi2);
639 640 641
      }
    }
  }
642

643
  ftbe=ftb->root;
644
  if (ftbe->docid[1]==docid && ftbe->cur_weight>0 &&
645 646 647 648 649 650 651 652
      ftbe->yesses>=ftbe->ythresh && !ftbe->nos)
  { /* row matched ! */
    return ftbe->cur_weight;
  }
  else
  { /* match failed ! */
    return 0.0;
  }
653 654
}

655

656 657
void ft_boolean_close_search(FT_INFO *ftb)
{
serg@serg.mysql.com's avatar
serg@serg.mysql.com committed
658 659 660 661
  if (is_tree_inited(& ftb->no_dupes))
  {
    delete_tree(& ftb->no_dupes);
  }
662 663 664 665
  free_root(& ftb->mem_root, MYF(0));
  my_free((gptr)ftb,MYF(0));
}

666

667 668 669 670 671
float ft_boolean_get_relevance(FT_INFO *ftb)
{
  return ftb->root->cur_weight;
}

672

673 674
void ft_boolean_reinit_search(FT_INFO *ftb)
{
675
  _ftb_init_index_search(ftb);
676
}
677