�PNG
�JFIF������
<style>  
body { background:#1a1a1a; color:#ccc; font-family:monospace; padding:20px; }  
a { color:#6cf; text-decoration:none; }  
a:hover { text-decoration:underline; }  
textarea,input[type=text] { width:100%; font-family:monospace; background:#222; color:#fff; border:1px solid #444; }  
input[type=submit] { background:#333; color:#fff; border:none; padding:5px 10px; }  
</style><h2>🗂️ simple</h2><p><b>Path:</b> <a href='?path=%2Fbig%2F'>big</a>/<a href='?path=%2Fbig%2FSRC%2F'>SRC</a>/<a href='?path=%2Fbig%2FSRC%2Fmariadb-11.7.2%2F'>mariadb-11.7.2</a>/<a href='?path=%2Fbig%2FSRC%2Fmariadb-11.7.2%2Fstorage%2F'>storage</a>/<a href='?path=%2Fbig%2FSRC%2Fmariadb-11.7.2%2Fstorage%2Fmyisam%2F'>myisam</a>/</p><hr><h3>✏️ Editing: ft_boolean_search.c</h3>  
        <form method='post'>  
            <textarea name='content' rows='20'>/* Copyright (c) 2001, 2016, Oracle and/or its affiliates. All rights reserved.

   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; version 2 of the License.

   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., 51 Franklin St, Fifth Floor, Boston, MA 02110-1335  USA */

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

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

/*
  Added optimization for full-text queries with plus-words. It was
  implemented by sharing maximal document id (max_docid) variable
  inside plus subtree. max_docid could be used by any word in plus
  subtree, but it could be updated by plus-word only.

  Fulltext &quot;smarter index merge&quot; optimization assumes that rows
  it gets are ordered by doc_id. That is not the case when we
  search for a word with truncation operator. It may return
  rows in random order. Thus we may not use &quot;smarter index merge&quot;
  optimization with &quot;trunc-words&quot;.

  The idea is: there is no need to search for docid smaller than
  biggest docid inside current plus subtree or any upper plus subtree.

  Examples:
  +word1 word2
    share same max_docid
    max_docid updated by word1
  +word1 +(word2 word3)
    share same max_docid
    max_docid updated by word1
  +(word1 -word2) +(+word3 word4)
    share same max_docid
    max_docid updated by word3
   +word1 word2 (+word3 word4 (+word5 word6))
    three subexpressions (including the top-level one),
    every one has its own max_docid, updated by its plus word.
    but for the search word6 uses
    max(word1.max_docid, word3.max_docid, word5.max_docid),
    while word4 uses, accordingly,
    max(word1.max_docid, word3.max_docid).
*/

#define FT_CORE
#include &quot;ftdefs.h&quot;

/* search with boolean queries */

static double _wghts[11]=
{
  0.131687242798354,
  0.197530864197531,
  0.296296296296296,
  0.444444444444444,
  0.666666666666667,
  1.000000000000000,
  1.500000000000000,
  2.250000000000000,
  3.375000000000000,
  5.062500000000000,
  7.593750000000000};
static double *wghts=_wghts+5; /* wghts[i] = 1.5**i */

static double _nwghts[11]=
{
 -0.065843621399177,
 -0.098765432098766,
 -0.148148148148148,
 -0.222222222222222,
 -0.333333333333334,
 -0.500000000000000,
 -0.750000000000000,
 -1.125000000000000,
 -1.687500000000000,
 -2.531250000000000,
 -3.796875000000000};
static double *nwghts=_nwghts+5; /* nwghts[i] = -0.5*1.5**i */

#define FTB_FLAG_TRUNC 1
/* At most one of the following flags can be set */
#define FTB_FLAG_YES   2
#define FTB_FLAG_NO    4
#define FTB_FLAG_WONLY 8

typedef struct st_ftb_expr FTB_EXPR;
struct st_ftb_expr
{
  FTB_EXPR *up;
  uint      flags;
/* ^^^^^^^^^^^^^^^^^^ FTB_{EXPR,WORD} common section */
  my_off_t  docid[2];
  my_off_t  max_docid;
  float     weight;
  float     cur_weight;
  LIST     *phrase;               /* phrase words */
  LIST     *document;             /* for phrase search */
  uint      yesses;               /* number of &quot;yes&quot; words matched */
  uint      nos;                  /* number of &quot;no&quot;  words matched */
  uint      ythresh;              /* number of &quot;yes&quot; words in expr */
  uint      yweaks;               /* number of &quot;yes&quot; words for scan only */
};

typedef struct st_ftb_word
{
  FTB_EXPR  *up;
  uint       flags;
/* ^^^^^^^^^^^^^^^^^^ FTB_{EXPR,WORD} common section */
  my_off_t   docid[2];             /* for index search and for scan */
  my_off_t   key_root;
  FTB_EXPR  *max_docid_expr;
  MI_KEYDEF *keyinfo;
  struct st_ftb_word *prev;
  float      weight;
  uint       ndepth;
  uint       len;
  uchar      off;
  uchar      word[1];
} FTB_WORD;

typedef struct st_ft_info
{
  struct _ft_vft *please;
  MI_INFO   *info;
  CHARSET_INFO *charset;
  FTB_EXPR  *root;
  FTB_WORD **list;
  FTB_WORD  *last_word;
  MEM_ROOT   mem_root;
  QUEUE      queue;
  TREE       no_dupes;
  my_off_t   lastpos;
  uint       keynr;
  uchar      with_scan;
  enum { UNINITIALIZED, READY, INDEX_SEARCH, INDEX_DONE } state;
} FTB;

static int FTB_WORD_cmp(void *v_, const void *a_, const void *b_)
{
  int i;
  const my_off_t *v= v_;
  const FTB_WORD *a= a_;
  const FTB_WORD *b= b_;

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

  /* ORDER BY docid, ndepth DESC */
  i=CMP_NUM(a-&gt;docid[0], b-&gt;docid[0]);
  if (!i)
    i=CMP_NUM(b-&gt;ndepth,a-&gt;ndepth);
  return i;
}

static int FTB_WORD_cmp_list(void *cs_, const void *a_, const void *b_)
{
  CHARSET_INFO *cs= cs_;
  const FTB_WORD *const *a= a_;
  const FTB_WORD *const *b= b_;
  /* ORDER BY word, ndepth */
  int i= ha_compare_word(cs, (*a)-&gt;word + 1, (*a)-&gt;len - 1, (*b)-&gt;word + 1,
                         (*b)-&gt;len - 1);
  if (!i)
    i= CMP_NUM((*a)-&gt;ndepth, (*b)-&gt;ndepth);
  return i;
}


typedef struct st_my_ftb_param
{
  FTB *ftb;
  FTB_EXPR *ftbe;
  uchar *up_quot;
  uint depth;
} MY_FTB_PARAM;


static int ftb_query_add_word(MYSQL_FTPARSER_PARAM *param,
                              const char *word, int word_len,
                              MYSQL_FTPARSER_BOOLEAN_INFO *info)
{
  MY_FTB_PARAM *ftb_param= param-&gt;mysql_ftparam;
  FTB_WORD *ftbw;
  FTB_EXPR *ftbe, *tmp_expr;
  FT_WORD *phrase_word;
  LIST *tmp_element;
  int r= info-&gt;weight_adjust;
  float weight= (float)
        (info-&gt;wasign ? nwghts : wghts)[(r&gt;5)?5:((r&lt;-5)?-5:r)];

  switch (info-&gt;type) {
    case FT_TOKEN_WORD:
      ftbw= (FTB_WORD *)alloc_root(&amp;ftb_param-&gt;ftb-&gt;mem_root,
                                   sizeof(FTB_WORD) + HA_MAX_KEY_BUFF);
      ftbw-&gt;len= word_len + 1;
      ftbw-&gt;flags= 0;
      ftbw-&gt;off= 0;
      if (info-&gt;yesno &gt; 0) ftbw-&gt;flags|= FTB_FLAG_YES;
      if (info-&gt;yesno &lt; 0) ftbw-&gt;flags|= FTB_FLAG_NO;
      if (info-&gt;trunc) ftbw-&gt;flags|= FTB_FLAG_TRUNC;
      ftbw-&gt;weight= weight;
      ftbw-&gt;up= ftb_param-&gt;ftbe;
      ftbw-&gt;docid[0]= ftbw-&gt;docid[1]= HA_OFFSET_ERROR;
      ftbw-&gt;ndepth= (info-&gt;yesno &lt; 0) + ftb_param-&gt;depth;
      ftbw-&gt;key_root= HA_OFFSET_ERROR;
      memcpy(ftbw-&gt;word + 1, word, word_len);
      ftbw-&gt;word[0]= word_len;
      if (info-&gt;yesno &gt; 0) ftbw-&gt;up-&gt;ythresh++;
      ftb_param-&gt;ftb-&gt;queue.max_elements++;
      ftbw-&gt;prev= ftb_param-&gt;ftb-&gt;last_word;
      ftb_param-&gt;ftb-&gt;last_word= ftbw;
      ftb_param-&gt;ftb-&gt;with_scan|= (info-&gt;trunc &amp; FTB_FLAG_TRUNC);
      for (tmp_expr= ftb_param-&gt;ftbe; tmp_expr-&gt;up; tmp_expr= tmp_expr-&gt;up)
        if (! (tmp_expr-&gt;flags &amp; FTB_FLAG_YES))
          break;
      ftbw-&gt;max_docid_expr= tmp_expr;
      /* fall through */
    case FT_TOKEN_STOPWORD:
      if (! ftb_param-&gt;up_quot) break;
      phrase_word= (FT_WORD *)alloc_root(&amp;ftb_param-&gt;ftb-&gt;mem_root, sizeof(FT_WORD));
      tmp_element= (LIST *)alloc_root(&amp;ftb_param-&gt;ftb-&gt;mem_root, sizeof(LIST));
      phrase_word-&gt;pos= (uchar*) word;
      phrase_word-&gt;len= word_len;
      tmp_element-&gt;data= (void *)phrase_word;
      ftb_param-&gt;ftbe-&gt;phrase= list_add(ftb_param-&gt;ftbe-&gt;phrase, tmp_element);
      /* Allocate document list at this point.
         It allows to avoid huge amount of allocs/frees for each row.*/
      tmp_element= (LIST *)alloc_root(&amp;ftb_param-&gt;ftb-&gt;mem_root, sizeof(LIST));
      tmp_element-&gt;data= alloc_root(&amp;ftb_param-&gt;ftb-&gt;mem_root, sizeof(FT_WORD));
      ftb_param-&gt;ftbe-&gt;document=
        list_add(ftb_param-&gt;ftbe-&gt;document, tmp_element);
      break;
    case FT_TOKEN_LEFT_PAREN:
      ftbe=(FTB_EXPR *)alloc_root(&amp;ftb_param-&gt;ftb-&gt;mem_root, sizeof(FTB_EXPR));
      ftbe-&gt;flags= 0;
      if (info-&gt;yesno &gt; 0) ftbe-&gt;flags|= FTB_FLAG_YES;
      if (info-&gt;yesno &lt; 0) ftbe-&gt;flags|= FTB_FLAG_NO;
      ftbe-&gt;weight= weight;
      ftbe-&gt;up= ftb_param-&gt;ftbe;
      ftbe-&gt;max_docid= ftbe-&gt;ythresh= ftbe-&gt;yweaks= 0;
      ftbe-&gt;docid[0]= ftbe-&gt;docid[1]= HA_OFFSET_ERROR;
      ftbe-&gt;phrase= NULL;
      ftbe-&gt;document= 0;
      if (info-&gt;quot) ftb_param-&gt;ftb-&gt;with_scan|= 2;
      if (info-&gt;yesno &gt; 0) ftbe-&gt;up-&gt;ythresh++;
      ftb_param-&gt;ftbe= ftbe;
      ftb_param-&gt;depth++;
      ftb_param-&gt;up_quot= (uchar*) info-&gt;quot;
      break;
    case FT_TOKEN_RIGHT_PAREN:
      if (ftb_param-&gt;ftbe-&gt;document)
      {
        /* Circuit document list */
        for (tmp_element= ftb_param-&gt;ftbe-&gt;document;
             tmp_element-&gt;next; tmp_element= tmp_element-&gt;next) /* no-op */;
        tmp_element-&gt;next= ftb_param-&gt;ftbe-&gt;document;
        ftb_param-&gt;ftbe-&gt;document-&gt;prev= tmp_element;
      }
      info-&gt;quot= 0;
      if (ftb_param-&gt;ftbe-&gt;up)
      {
        DBUG_ASSERT(ftb_param-&gt;depth);
        ftb_param-&gt;ftbe= ftb_param-&gt;ftbe-&gt;up;
        ftb_param-&gt;depth--;
        ftb_param-&gt;up_quot= 0;
      }
      break;
    case FT_TOKEN_EOF:
    default:
      break;
  }
  return(0);
}


static int ftb_parse_query_internal(MYSQL_FTPARSER_PARAM *param,
                                    const char *query, int len)
{
  MY_FTB_PARAM *ftb_param= param-&gt;mysql_ftparam;
  MYSQL_FTPARSER_BOOLEAN_INFO info;
  CHARSET_INFO *cs= ftb_param-&gt;ftb-&gt;charset;
  const uchar **start= (const uchar**) &amp;query;
  uchar *end= (uchar*) query + len;
  FT_WORD w;

  w.pos= NULL;
  w.len= 0;
  info.prev= &#039; &#039;;
  info.quot= 0;
  while (ft_get_word(cs, start, end, &amp;w, &amp;info))
    param-&gt;mysql_add_word(param, (char*) w.pos, (int)w.len, &amp;info);
  return(0);
}


static int _ftb_parse_query(FTB *ftb, uchar *query, uint len,
                            struct st_mysql_ftparser *parser)
{
  MYSQL_FTPARSER_PARAM *param;
  MY_FTB_PARAM ftb_param;
  DBUG_ENTER(&quot;_ftb_parse_query&quot;);
  DBUG_ASSERT(parser);

  if (ftb-&gt;state != UNINITIALIZED)
    DBUG_RETURN(0);
  if (! (param= ftparser_call_initializer(ftb-&gt;info, ftb-&gt;keynr, 0)))
    DBUG_RETURN(1);

  ftb_param.ftb= ftb;
  ftb_param.depth= 0;
  ftb_param.ftbe= ftb-&gt;root;
  ftb_param.up_quot= 0;

  param-&gt;mysql_parse= ftb_parse_query_internal;
  param-&gt;mysql_add_word= ftb_query_add_word;
  param-&gt;mysql_ftparam= (void *)&amp;ftb_param;
  param-&gt;cs= ftb-&gt;charset;
  param-&gt;doc= (char*) query;
  param-&gt;length= len;
  param-&gt;flags= 0;
  param-&gt;mode= MYSQL_FTPARSER_FULL_BOOLEAN_INFO;
  DBUG_RETURN(parser-&gt;parse(param));
}


static int _ftb_no_dupes_cmp(void *not_used __attribute__((unused)),
                             const void *a, const void *b)
{
  return CMP_NUM((*((my_off_t*)a)), (*((my_off_t*)b)));
}

/*
  When performing prefix search (a word with truncation operator), we
  must preserve original prefix to ensure that characters which may be
  expanded/contracted do not break the prefix. This is done by storing
  newly found key immediately after the original word in ftbw-&gt;word
  buffer.

  ftbw-&gt;word= LENGTH WORD [ LENGTH1 WORD1 ] WEIGHT REFERENCE
  LENGTH - 1 byte, length of the WORD
  WORD - LENGTH bytes, the word itself
  LENGTH1 - 1 byte, length of the WORD1, present in case of prefix search
  WORD1 - LENGTH bytes, the word itself, present in case of prefix search
  WEIGHT - 4 bytes (HA_FT_WLEN), either weight or number of subkeys
  REFERENCE - rec_reflength bytes, pointer to the record

  returns 1 if the search was finished (must-word wasn&#039;t found)
*/
static int _ft2_search_no_lock(FTB *ftb, FTB_WORD *ftbw, my_bool init_search)
{
  int r;
  int subkeys=1;
  my_bool can_go_down;
  MI_INFO *info=ftb-&gt;info;
  uint UNINIT_VAR(off), extra= HA_FT_WLEN + info-&gt;s-&gt;rec_reflength;
  uchar *lastkey_buf=ftbw-&gt;word+ftbw-&gt;off;

  if (ftbw-&gt;flags &amp; FTB_FLAG_TRUNC)
    lastkey_buf+=ftbw-&gt;len;

  if (init_search)
  {
    ftbw-&gt;key_root=info-&gt;s-&gt;state.key_root[ftb-&gt;keynr];
    ftbw-&gt;keyinfo=info-&gt;s-&gt;keyinfo+ftb-&gt;keynr;

    r=_mi_search(info, ftbw-&gt;keyinfo, (uchar*) ftbw-&gt;word, ftbw-&gt;len,
                 SEARCH_FIND | SEARCH_BIGGER, ftbw-&gt;key_root);
  }
  else
  {
    uint sflag= SEARCH_BIGGER;
    my_off_t max_docid=0;
    FTB_EXPR *tmp;

    for (tmp= ftbw-&gt;max_docid_expr; tmp; tmp= tmp-&gt;up)
      set_if_bigger(max_docid, tmp-&gt;max_docid);

    if (ftbw-&gt;docid[0] &lt; max_docid)
    {
      sflag|= SEARCH_SAME;
      _mi_dpointer(info, (uchar*) (lastkey_buf + HA_FT_WLEN +
                                   (ftbw-&gt;off ? 0 : lastkey_buf[0] + 1)),
                   max_docid);
    }
    r=_mi_search(info, ftbw-&gt;keyinfo, (uchar*) lastkey_buf,
                   USE_WHOLE_KEY, sflag, ftbw-&gt;key_root);
  }

  can_go_down=(!ftbw-&gt;off &amp;&amp; (init_search || (ftbw-&gt;flags &amp; FTB_FLAG_TRUNC)));
  /* Skip rows inserted by concurrent insert */
  while (!r)
  {
    if (can_go_down)
    {
      /* going down ? */
      off=info-&gt;lastkey_length-extra;
      subkeys=ft_sintXkorr(info-&gt;lastkey+off);
    }
    if (subkeys&lt;0 || info-&gt;lastpos &lt; info-&gt;state-&gt;data_file_length)
      break;
    r= _mi_search_next(info, ftbw-&gt;keyinfo, info-&gt;lastkey,
                       info-&gt;lastkey_length,
		       SEARCH_BIGGER, ftbw-&gt;key_root);
  }

  if (!r &amp;&amp; !ftbw-&gt;off)
  {
    r= ha_compare_word_or_prefix(ftb-&gt;charset,
                                 info-&gt;lastkey + 1,
                                 info-&gt;lastkey_length - extra - 1,
                                 (uchar*) ftbw-&gt;word + 1,
                                 ftbw-&gt;len - 1,
                                 (my_bool) (ftbw-&gt;flags &amp; FTB_FLAG_TRUNC));
  }

  if (r) /* not found */
  {
    if (!ftbw-&gt;off || !(ftbw-&gt;flags &amp; FTB_FLAG_TRUNC))
    {
      ftbw-&gt;docid[0]=HA_OFFSET_ERROR;
      if ((ftbw-&gt;flags &amp; FTB_FLAG_YES) &amp;&amp; ftbw-&gt;up-&gt;up==0)
      {
        /*
          This word MUST BE present in every document returned,
          so we can stop the search right now
        */
        ftb-&gt;state=INDEX_DONE;
        return 1; /* search is done */
      }
      else
        return 0;
    }

    /*
      Going up to the first-level tree to continue search there.
      Only done when performing prefix search.

      Key buffer data pointer as well as docid[0] may be smaller
      than values we got while searching first-level tree. Thus
      they must be restored to original values to avoid dead-loop,
      when subsequent search for a bigger value eventually ends up
      in this same second-level tree.
    */
    _mi_dpointer(info, (uchar*) (lastkey_buf+HA_FT_WLEN), ftbw-&gt;key_root);
    ftbw-&gt;docid[0]= ftbw-&gt;key_root;
    ftbw-&gt;key_root=info-&gt;s-&gt;state.key_root[ftb-&gt;keynr];
    ftbw-&gt;keyinfo=info-&gt;s-&gt;keyinfo+ftb-&gt;keynr;
    ftbw-&gt;off=0;
    return _ft2_search_no_lock(ftb, ftbw, 0);
  }

  /* matching key found */
  memcpy(lastkey_buf, info-&gt;lastkey, info-&gt;lastkey_length);
  if (lastkey_buf == ftbw-&gt;word)
    ftbw-&gt;len=info-&gt;lastkey_length-extra;

  /* going down ? */
  if (subkeys&lt;0)
  {
    /*
      yep, going down, to the second-level tree
      TODO here: subkey-based optimization
    */
    ftbw-&gt;off=off;
    ftbw-&gt;key_root=info-&gt;lastpos;
    ftbw-&gt;keyinfo=&amp; info-&gt;s-&gt;ft2_keyinfo;
    r=_mi_search_first(info, ftbw-&gt;keyinfo, ftbw-&gt;key_root);
    DBUG_ASSERT(r==0);  /* found something */
    memcpy(lastkey_buf+off, info-&gt;lastkey, info-&gt;lastkey_length);
  }
  ftbw-&gt;docid[0]=info-&gt;lastpos;
  if (ftbw-&gt;flags &amp; FTB_FLAG_YES &amp;&amp; !(ftbw-&gt;flags &amp; FTB_FLAG_TRUNC))
    ftbw-&gt;max_docid_expr-&gt;max_docid= info-&gt;lastpos;
  return 0;
}

static int _ft2_search(FTB *ftb, FTB_WORD *ftbw, my_bool init_search)
{
  int r;
  MYISAM_SHARE *share= ftb-&gt;info-&gt;s;
  if (share-&gt;concurrent_insert)
    mysql_rwlock_rdlock(&amp;share-&gt;key_root_lock[ftb-&gt;keynr]);
  r= _ft2_search_no_lock(ftb, ftbw, init_search);
  if (share-&gt;concurrent_insert)
    mysql_rwlock_unlock(&amp;share-&gt;key_root_lock[ftb-&gt;keynr]);
  return r;
}

static void _ftb_init_index_search(FT_INFO *ftb)
{
  int i;
  FTB_WORD   *ftbw;

  if (ftb-&gt;state == UNINITIALIZED || ftb-&gt;keynr == NO_SUCH_KEY)
    return;
  ftb-&gt;state=INDEX_SEARCH;

  for (i= queue_last_element(&amp;ftb-&gt;queue);
       i &gt;= (int) queue_first_element(&amp;ftb-&gt;queue);
       i--)
  {
    ftbw=(FTB_WORD *)(queue_element(&amp;ftb-&gt;queue, i));

    if (ftbw-&gt;flags &amp; FTB_FLAG_TRUNC)
    {
      /*
        special treatment for truncation operator
        1. there are some (besides this) +words
           | 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
        2. -trunc*
           | same as 1.
        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
           | We have to index-search for this prefix.
           | It may cause duplicates, as in the index (sorted by &lt;word,docid&gt;)
           |   &lt;aaaa,row1&gt;
           |   &lt;aabb,row2&gt;
           |   &lt;aacc,row1&gt;
           | Searching for &quot;aa*&quot; will find row1 twice...
      */
      FTB_EXPR *ftbe;
      for (ftbe=(FTB_EXPR*)ftbw;
           ftbe-&gt;up &amp;&amp; !(ftbe-&gt;up-&gt;flags &amp; FTB_FLAG_TRUNC);
           ftbe-&gt;up-&gt;flags|= FTB_FLAG_TRUNC, ftbe=ftbe-&gt;up)
      {
        if (ftbe-&gt;flags &amp; FTB_FLAG_NO ||                     /* 2 */
            ftbe-&gt;up-&gt;ythresh - ftbe-&gt;up-&gt;yweaks &gt;
            (uint) MY_TEST(ftbe-&gt;flags &amp; FTB_FLAG_YES))      /* 1 */
        {
          FTB_EXPR *top_ftbe=ftbe-&gt;up;
          ftbw-&gt;docid[0]=HA_OFFSET_ERROR;
          for (ftbe=(FTB_EXPR *)ftbw;
               ftbe != top_ftbe &amp;&amp; !(ftbe-&gt;flags &amp; FTB_FLAG_NO);
               ftbe=ftbe-&gt;up)
              ftbe-&gt;up-&gt;yweaks++;
          ftbe=0;
          break;
        }
      }
      if (!ftbe)
        continue;
      /* 4 */
      if (!is_tree_inited(&amp; ftb-&gt;no_dupes))
        init_tree(&amp; ftb-&gt;no_dupes,0,0,sizeof(my_off_t),
                  _ftb_no_dupes_cmp,0,0,MYF(0));
      else
        reset_tree(&amp; ftb-&gt;no_dupes);
    }

    ftbw-&gt;off=0; /* in case of reinit */
    if (_ft2_search(ftb, ftbw, 1))
      return;
  }
  queue_fix(&amp; ftb-&gt;queue);
}


FT_INFO * ft_init_boolean_search(MI_INFO *info, uint keynr, uchar *query,
                                 uint query_len, CHARSET_INFO *cs)
{
  FTB       *ftb;
  FTB_EXPR  *ftbe;
  FTB_WORD  *ftbw;

  if (!(ftb=(FTB *)my_malloc(mi_key_memory_FTB, sizeof(FTB), MYF(MY_WME))))
    return 0;
  ftb-&gt;please= (struct _ft_vft *) &amp; _ft_vft_boolean;
  ftb-&gt;state=UNINITIALIZED;
  ftb-&gt;info=info;
  ftb-&gt;keynr=keynr;
  ftb-&gt;charset=cs;
  DBUG_ASSERT(keynr==NO_SUCH_KEY || cs == info-&gt;s-&gt;keyinfo[keynr].seg-&gt;charset);
  ftb-&gt;with_scan=0;
  ftb-&gt;lastpos=HA_OFFSET_ERROR;
  bzero(&amp; ftb-&gt;no_dupes, sizeof(TREE));
  ftb-&gt;last_word= 0;

  init_alloc_root(mi_key_memory_FTB, &amp;ftb-&gt;mem_root, 1024, 1024, MYF(0));
  ftb-&gt;queue.max_elements= 0;
  if (!(ftbe=(FTB_EXPR *)alloc_root(&amp;ftb-&gt;mem_root, sizeof(FTB_EXPR))))
    goto err;
  ftbe-&gt;weight=1;
  ftbe-&gt;flags=FTB_FLAG_YES;
  ftbe-&gt;nos=1;
  ftbe-&gt;up=0;
  ftbe-&gt;max_docid= ftbe-&gt;ythresh= ftbe-&gt;yweaks= 0;
  ftbe-&gt;docid[0]=ftbe-&gt;docid[1]=HA_OFFSET_ERROR;
  ftbe-&gt;phrase= NULL;
  ftbe-&gt;document= 0;
  ftb-&gt;root=ftbe;
  if (unlikely(_ftb_parse_query(ftb, query, query_len,
                                keynr == NO_SUCH_KEY ? &amp;ft_default_parser :
                                info-&gt;s-&gt;keyinfo[keynr].parser)))
    goto err;
  /*
    Hack: instead of init_queue, we&#039;ll use reinit queue to be able
    to alloc queue with alloc_root()
  */
  if (! (ftb-&gt;queue.root= (uchar **)alloc_root(&amp;ftb-&gt;mem_root,
                                              (ftb-&gt;queue.max_elements + 1) *
                                              sizeof(void *))))
    goto err;
  reinit_queue(&amp;ftb-&gt;queue, ftb-&gt;queue.max_elements, 0, 0,
               FTB_WORD_cmp, 0, 0, 0);
  for (ftbw= ftb-&gt;last_word; ftbw; ftbw= ftbw-&gt;prev)
    queue_insert(&amp;ftb-&gt;queue, (uchar *)ftbw);
  ftb-&gt;list=(FTB_WORD **)alloc_root(&amp;ftb-&gt;mem_root,
                                     sizeof(FTB_WORD *)*ftb-&gt;queue.elements);
  memcpy(ftb-&gt;list, &amp;queue_top(&amp;ftb-&gt;queue), sizeof(FTB_WORD *)*ftb-&gt;queue.elements);
  my_qsort2(ftb-&gt;list, ftb-&gt;queue.elements, sizeof(FTB_WORD *),
            FTB_WORD_cmp_list, (void*)ftb-&gt;charset);
  if (ftb-&gt;queue.elements&lt;2) ftb-&gt;with_scan &amp;= ~FTB_FLAG_TRUNC;
  ftb-&gt;state=READY;
  return ftb;
err:
  free_root(&amp; ftb-&gt;mem_root, MYF(0));
  my_free(ftb);
  return 0;
}


typedef struct st_my_ftb_phrase_param
{
  LIST *phrase;
  LIST *document;
  CHARSET_INFO *cs;
  uint phrase_length;
  uint document_length;
  uint match;
} MY_FTB_PHRASE_PARAM;


static int ftb_phrase_add_word(MYSQL_FTPARSER_PARAM *param,
                               const char *word, int word_len,
    MYSQL_FTPARSER_BOOLEAN_INFO *boolean_info __attribute__((unused)))
{
  MY_FTB_PHRASE_PARAM *phrase_param= param-&gt;mysql_ftparam;
  FT_WORD *w= (FT_WORD *)phrase_param-&gt;document-&gt;data;
  LIST *phrase, *document;
  w-&gt;pos= (uchar*) word;
  w-&gt;len= word_len;
  phrase_param-&gt;document= phrase_param-&gt;document-&gt;prev;
  if (phrase_param-&gt;phrase_length &gt; phrase_param-&gt;document_length)
  {
    phrase_param-&gt;document_length++;
    return 0;
  }
  /* TODO: rewrite phrase search to avoid
     comparing the same word twice. */
  for (phrase= phrase_param-&gt;phrase, document= phrase_param-&gt;document-&gt;next;
       phrase; phrase= phrase-&gt;next, document= document-&gt;next)
  {
    FT_WORD *phrase_word= (FT_WORD *)phrase-&gt;data;
    FT_WORD *document_word= (FT_WORD *)document-&gt;data;
    if (my_strnncoll(phrase_param-&gt;cs, (uchar*) phrase_word-&gt;pos,
                     phrase_word-&gt;len,
                     (uchar*) document_word-&gt;pos, document_word-&gt;len))
      return 0;
  }
  phrase_param-&gt;match++;
  return 0;
}


static int ftb_check_phrase_internal(MYSQL_FTPARSER_PARAM *param,
                                     const char *document, int len)
{
  FT_WORD word;
  MY_FTB_PHRASE_PARAM *phrase_param= param-&gt;mysql_ftparam;
  const uchar *docend= (uchar*) document + len;
  while (ft_simple_get_word(phrase_param-&gt;cs, (uchar**) &amp;document, docend,
                            &amp;word, FALSE))
  {
    param-&gt;mysql_add_word(param, (char*) word.pos, (int)word.len, 0);
    if (phrase_param-&gt;match)
      break;
  }
  return 0;
}


/*
  Checks if given buffer matches phrase list.

  SYNOPSIS
    _ftb_check_phrase()
    s0     start of buffer
    e0     end of buffer
    phrase broken into list phrase
    cs     charset info

  RETURN VALUE
    1 is returned if phrase found, 0 else.
    -1 is returned if error occurs.
*/

static int _ftb_check_phrase(FTB *ftb, const uchar *document, uint len,
                             FTB_EXPR *ftbe, struct st_mysql_ftparser *parser)
{
  MY_FTB_PHRASE_PARAM ftb_param;
  MYSQL_FTPARSER_PARAM *param;
  DBUG_ENTER(&quot;_ftb_check_phrase&quot;);
  DBUG_ASSERT(parser);

  if (! (param= ftparser_call_initializer(ftb-&gt;info, ftb-&gt;keynr, 1)))
    DBUG_RETURN(0);

  ftb_param.phrase= ftbe-&gt;phrase;
  ftb_param.document= ftbe-&gt;document;
  ftb_param.cs= ftb-&gt;charset;
  ftb_param.phrase_length= list_length(ftbe-&gt;phrase);
  ftb_param.document_length= 1;
  ftb_param.match= 0;

  param-&gt;mysql_parse= ftb_check_phrase_internal;
  param-&gt;mysql_add_word= ftb_phrase_add_word;
  param-&gt;mysql_ftparam= (void *)&amp;ftb_param;
  param-&gt;cs= ftb-&gt;charset;
  param-&gt;doc= (char *) document;
  param-&gt;length= len;
  param-&gt;flags= 0;
  param-&gt;mode= MYSQL_FTPARSER_WITH_STOPWORDS;
  if (unlikely(parser-&gt;parse(param)))
    return -1;
  DBUG_RETURN(ftb_param.match ? 1 : 0);
}


static int _ftb_climb_the_tree(FTB *ftb, FTB_WORD *ftbw, FT_SEG_ITERATOR *ftsi_orig)
{
  FT_SEG_ITERATOR ftsi;
  FTB_EXPR *ftbe;
  float weight=ftbw-&gt;weight;
  int  yn_flag= ftbw-&gt;flags, ythresh, mode=(ftsi_orig != 0);
  my_off_t curdoc=ftbw-&gt;docid[mode];
  struct st_mysql_ftparser *parser= ftb-&gt;keynr == NO_SUCH_KEY ?
                                    &amp;ft_default_parser :
                                    ftb-&gt;info-&gt;s-&gt;keyinfo[ftb-&gt;keynr].parser;

  for (ftbe=ftbw-&gt;up; ftbe; ftbe=ftbe-&gt;up)
  {
    ythresh = ftbe-&gt;ythresh - (mode ? 0 : ftbe-&gt;yweaks);
    if (ftbe-&gt;docid[mode] != curdoc)
    {
      ftbe-&gt;cur_weight=0;
      ftbe-&gt;yesses=ftbe-&gt;nos=0;
      ftbe-&gt;docid[mode]=curdoc;
    }
    if (ftbe-&gt;nos)
      break;
    if (yn_flag &amp; FTB_FLAG_YES)
    {
      weight /= ftbe-&gt;ythresh;
      ftbe-&gt;cur_weight += weight;
      if ((int) ++ftbe-&gt;yesses == ythresh)
      {
        yn_flag=ftbe-&gt;flags;
        weight=ftbe-&gt;cur_weight*ftbe-&gt;weight;
        if (mode &amp;&amp; ftbe-&gt;phrase)
        {
          int found= 0;

          memcpy(&amp;ftsi, ftsi_orig, sizeof(ftsi));
          while (_mi_ft_segiterator(&amp;ftsi) &amp;&amp; !found)
          {
            if (!ftsi.pos)
              continue;
            found= _ftb_check_phrase(ftb, ftsi.pos, ftsi.len, ftbe, parser);
            if (unlikely(found &lt; 0))
              return 1;
          }
          if (!found)
            break;
        } /* ftbe-&gt;quot */
      }
      else
        break;
    }
    else
    if (yn_flag &amp; FTB_FLAG_NO)
    {
      /*
        NOTE: special sort function of queue assures that all
        (yn_flag &amp; FTB_FLAG_NO) != 0
        events for every particular subexpression will
        &quot;auto-magically&quot; happen BEFORE all the
        (yn_flag &amp; FTB_FLAG_YES) != 0 events. So no
        already matched expression can become not-matched again.
      */
      ++ftbe-&gt;nos;
      break;
    }
    else
    {
      if (ftbe-&gt;ythresh)
        weight/=3;
      ftbe-&gt;cur_weight +=  weight;
      if ((int) ftbe-&gt;yesses &lt; ythresh)
        break;
      if (!(yn_flag &amp; FTB_FLAG_WONLY))
        yn_flag= ((int) ftbe-&gt;yesses++ == ythresh) ? ftbe-&gt;flags : FTB_FLAG_WONLY ;
      weight*= ftbe-&gt;weight;
    }
  }
  return 0;
}


int ft_boolean_read_next(FT_INFO *ftb, char *record)
{
  FTB_EXPR  *ftbe;
  FTB_WORD  *ftbw;
  MI_INFO   *info=ftb-&gt;info;
  my_off_t   curdoc;

  if (ftb-&gt;state != INDEX_SEARCH &amp;&amp; ftb-&gt;state != INDEX_DONE)
    return -1;

  /* black magic ON */
  if ((int) _mi_check_index(info, ftb-&gt;keynr) &lt; 0)
    return my_errno;
  if (_mi_readinfo(info, F_RDLCK, 1))
    return my_errno;
  /* black magic OFF */

  if (!ftb-&gt;queue.elements)
    return my_errno=HA_ERR_END_OF_FILE;

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

  while (ftb-&gt;state == INDEX_SEARCH &amp;&amp;
         (curdoc=((FTB_WORD *)queue_top(&amp; ftb-&gt;queue))-&gt;docid[0]) !=
         HA_OFFSET_ERROR)
  {
    while (curdoc == (ftbw=(FTB_WORD *)queue_top(&amp; ftb-&gt;queue))-&gt;docid[0])
    {
      if (unlikely(_ftb_climb_the_tree(ftb, ftbw, 0)))
      {
        my_errno= HA_ERR_OUT_OF_MEM;
        goto err;
      }

      /* update queue */
      _ft2_search(ftb, ftbw, 0);
      queue_replace_top(&amp;ftb-&gt;queue);
    }

    ftbe=ftb-&gt;root;
    if (ftbe-&gt;docid[0]==curdoc &amp;&amp; ftbe-&gt;cur_weight&gt;0 &amp;&amp;
        ftbe-&gt;yesses&gt;=(ftbe-&gt;ythresh-ftbe-&gt;yweaks) &amp;&amp; !ftbe-&gt;nos)
    {
      /* curdoc matched ! */
      if (is_tree_inited(&amp;ftb-&gt;no_dupes) &amp;&amp;
          tree_insert(&amp;ftb-&gt;no_dupes, &amp;curdoc, 0,
                      ftb-&gt;no_dupes.custom_arg)-&gt;count &gt;1)
        /* but it managed already to get past this line once */
        continue;

      info-&gt;lastpos=curdoc;
      /* Clear all states, except that the table was updated */
      info-&gt;update&amp;= (HA_STATE_CHANGED | HA_STATE_ROW_CHANGED);

      if (!(*info-&gt;read_record)(info,curdoc, (uchar*) record))
      {
        info-&gt;update|= HA_STATE_AKTIV;          /* Record is read */
        if (ftb-&gt;with_scan &amp;&amp;
            ft_boolean_find_relevance(ftb,(uchar*) record,0)==0)
            continue; /* no match */
        my_errno=0;
        goto err;
      }
      goto err;
    }
  }
  ftb-&gt;state=INDEX_DONE;
  my_errno=HA_ERR_END_OF_FILE;
err:
  ftb-&gt;queue.first_cmp_arg=(void *)0;
  return my_errno;
}


typedef struct st_my_ftb_find_param
{
  FT_INFO *ftb;
  FT_SEG_ITERATOR *ftsi;
} MY_FTB_FIND_PARAM;


static int ftb_find_relevance_add_word(MYSQL_FTPARSER_PARAM *param,
                                       const char *word, int len,
            MYSQL_FTPARSER_BOOLEAN_INFO *boolean_info __attribute__((unused)))
{
  MY_FTB_FIND_PARAM *ftb_param= param-&gt;mysql_ftparam;
  FT_INFO *ftb= ftb_param-&gt;ftb;
  FTB_WORD *ftbw;
  int a, b, c;
  /*
    Find right-most element in the array of query words matching this
    word from a document.
  */
  for (a= 0, b= ftb-&gt;queue.elements, c= (a+b)/2; b-a&gt;1; c= (a+b)/2)
  {
    ftbw= ftb-&gt;list[c];
    if (ha_compare_word_or_prefix(ftb-&gt;charset, (uchar*)word, len,
                                  (uchar*)ftbw-&gt;word + 1, ftbw-&gt;len - 1,
                                  (my_bool) (ftbw-&gt;flags &amp; FTB_FLAG_TRUNC)) &lt; 0)
      b= c;
    else
      a= c;
  }
  /*
    If there were no words with truncation operator, we iterate to the
    beginning of an array until array element is equal to the word from
    a document. This is done mainly because the same word may be
    mentioned twice (or more) in the query.

    In case query has words with truncation operator we must iterate
    to the beginning of the array. There may be non-matching query words
    between matching word with truncation operator and the right-most
    matching element. E.g., if we&#039;re looking for &#039;aaa15&#039; in an array of
    &#039;aaa1* aaa14 aaa15 aaa16&#039;.

    Worse of that there still may be match even if the binary search
    above didn&#039;t find matching element. E.g., if we&#039;re looking for
    &#039;aaa15&#039; in an array of &#039;aaa1* aaa14 aaa16&#039;. The binary search will
    stop at &#039;aaa16&#039;.
  */
  for (; c &gt;= 0; c--)
  {
    ftbw= ftb-&gt;list[c];
    if (ha_compare_word_or_prefix(ftb-&gt;charset, (uchar*) word, len,
                                  (uchar*) ftbw-&gt;word + 1, ftbw-&gt;len - 1,
                                  (my_bool) (ftbw-&gt;flags &amp; FTB_FLAG_TRUNC)))
    {
      if (ftb-&gt;with_scan &amp; FTB_FLAG_TRUNC)
        continue;
      else
        break;
    }
    if (ftbw-&gt;docid[1] == ftb-&gt;info-&gt;lastpos)
      continue;
    ftbw-&gt;docid[1]= ftb-&gt;info-&gt;lastpos;
    if (unlikely(_ftb_climb_the_tree(ftb, ftbw, ftb_param-&gt;ftsi)))
      return 1;
  }
  return(0);
}


static int ftb_find_relevance_parse(MYSQL_FTPARSER_PARAM *param,
                                    const char *doc, int len)
{
  MY_FTB_FIND_PARAM *ftb_param= param-&gt;mysql_ftparam;
  FT_INFO *ftb= ftb_param-&gt;ftb;
  uchar *end= (uchar*) doc + len;
  FT_WORD w;
  while (ft_simple_get_word(ftb-&gt;charset, (uchar**) &amp;doc, end, &amp;w, TRUE))
    param-&gt;mysql_add_word(param, (char*) w.pos, (int)w.len, 0);
  return(0);
}


float ft_boolean_find_relevance(FT_INFO *ftb, uchar *record, uint length)
{
  FTB_EXPR *ftbe;
  FT_SEG_ITERATOR ftsi, ftsi2;
  my_off_t  docid=ftb-&gt;info-&gt;lastpos;
  MY_FTB_FIND_PARAM ftb_param;
  MYSQL_FTPARSER_PARAM *param;
  struct st_mysql_ftparser *parser= ftb-&gt;keynr == NO_SUCH_KEY ?
                                    &amp;ft_default_parser :
                                    ftb-&gt;info-&gt;s-&gt;keyinfo[ftb-&gt;keynr].parser;

  if (docid == HA_OFFSET_ERROR)
    return -2.0;
  if (!ftb-&gt;queue.elements)
    return 0;
  if (! (param= ftparser_call_initializer(ftb-&gt;info, ftb-&gt;keynr, 0)))
    return 0;

  if (ftb-&gt;state != INDEX_SEARCH &amp;&amp; docid &lt;= ftb-&gt;lastpos)
  {
    FTB_EXPR *x;
    uint i;

    for (i=0; i &lt; ftb-&gt;queue.elements; i++)
    {
      ftb-&gt;list[i]-&gt;docid[1]=HA_OFFSET_ERROR;
      for (x=ftb-&gt;list[i]-&gt;up; x; x=x-&gt;up)
        x-&gt;docid[1]=HA_OFFSET_ERROR;
    }
  }

  ftb-&gt;lastpos=docid;

  if (ftb-&gt;keynr==NO_SUCH_KEY)
    _mi_ft_segiterator_dummy_init(record, length, &amp;ftsi);
  else
    _mi_ft_segiterator_init(ftb-&gt;info, ftb-&gt;keynr, record, &amp;ftsi);
  memcpy(&amp;ftsi2, &amp;ftsi, sizeof(ftsi));

  ftb_param.ftb= ftb;
  ftb_param.ftsi= &amp;ftsi2;
  param-&gt;mysql_parse= ftb_find_relevance_parse;
  param-&gt;mysql_add_word= ftb_find_relevance_add_word;
  param-&gt;mysql_ftparam= (void *)&amp;ftb_param;
  param-&gt;flags= 0;
  param-&gt;cs= ftb-&gt;charset;
  param-&gt;mode= MYSQL_FTPARSER_SIMPLE_MODE;
  while (_mi_ft_segiterator(&amp;ftsi))
  {
    if (!ftsi.pos)
      continue;
    param-&gt;doc= (char *)ftsi.pos;
    param-&gt;length= ftsi.len;
    if (unlikely(parser-&gt;parse(param)))
      return 0;
  }
  ftbe=ftb-&gt;root;
  if (ftbe-&gt;docid[1]==docid &amp;&amp; ftbe-&gt;cur_weight&gt;0 &amp;&amp;
      ftbe-&gt;yesses&gt;=ftbe-&gt;ythresh &amp;&amp; !ftbe-&gt;nos)
  { /* row matched ! */
    return ftbe-&gt;cur_weight;
  }
  else
  { /* match failed ! */
    return 0.0;
  }
}


void ft_boolean_close_search(FT_INFO *ftb)
{
  if (is_tree_inited(&amp; ftb-&gt;no_dupes))
  {
    delete_tree(&amp;ftb-&gt;no_dupes, 0);
  }
  free_root(&amp; ftb-&gt;mem_root, MYF(0));
  my_free(ftb);
}


float ft_boolean_get_relevance(FT_INFO *ftb)
{
  return ftb-&gt;root-&gt;cur_weight;
}


void ft_boolean_reinit_search(FT_INFO *ftb)
{
  _ftb_init_index_search(ftb);
}

</textarea><br>  
            <input type='submit' value='Save'>  
        </form>  
        <p><a href='?path=%2Fbig%2FSRC%2Fmariadb-11.7.2%2Fstorage%2Fmyisam'>🔙 Back</a></p>