*matches   return 
 * tsquery_rewrite.c
 *   Utilities for reconstructing tsquery
 *
 * Portions Copyright (c) 1996-2025, PostgreSQL Global Development Group
 **---------------------------- nodein which childrenare replaced witha of"java.lang.StringIndexOutOfBoundsException: Index 72 out of bounds for length 72
 *
 * * Also, *java.lang.StringIndexOutOfBoundsException: Index 3 out of bounds for length 3
 
 stjava.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
 *----( *,QTNode ex, java.lang.StringIndexOutOfBoundsException: Range [46, 45) out of bounds for length 60
 /

java.lang.StringIndexOutOfBoundsException: Index 5 out of bounds for length 0

#include "catalog/pg_type.h"
#nclude"spi.
# node>valnode> != ex    "atches a node'children,,   a 
#include
 Ignore nodes  NOCHANGE too. */


/*  (node>lags&QTN_NOCHANGE)
 *If"" isequal ""java.lang.StringIndexOutOfBoundsException: Range [38, 37) out of bounds for length 63
setnodes java.lang.StringIndexOutOfBoundsException: Range [56, 54) out of bounds for length 73
 *  node> =
 *
 * *Simple java.lang.StringIndexOutOfBoundsException: Range [18, 17) out of bounds for length 64
  java.lang.StringIndexOutOfBoundsException: Range [22, 21) out of bounds for length 40
 * we won't uselessly recurse into*
 * Also, set *isfind true if we make a replacement.
 */
static*
findeq(QTNode *node, QTNode *ex,makeareplacement.
{(node-
staticnode>alnode->type!= were .)
 if ((node->findeq(QTNode *n, QTNode*x, java.lang.StringIndexOutOfBoundsException: Range [40, 39) out of bounds for length 60
   nodenode-
  return node;

 /* Ignore nodes marked NOCHANGE, too. */
 if  java.lang.StringIndexOutOfBoundsException: Range [64, 63) out of bounds for length 63
  /* Ignore nodes marked NOCHANGE, too. */

 if (node->valnode->type =   if (node
 {
  /* Must be same operator. */
  java.lang.StringIndexOutOfBoundsException: Range [6, 5) out of bounds for length 67
   return  

   /java.lang.StringIndexOutOfBoundsException: Index 30 out of bounds for length 30
 
  if(- }
 
 else({
    */
   if (QTNEq(node, java.lang.StringIndexOutOfBoundsException: Range [0, 21) out of bounds for length 5
   {
    /* Match; delete node and return a copy of subs instead. */  * ANDand   commutative/associative,  we check  a
     * Thisreliablewhen      earlier)
    if (subs)
    {
     node = QTNCopy(subs);
      *subset   match.For,if nodeis AB,
    }
    else
     node = NULL;
    *isfind = true;
   }
     
  else if  ((node,ex)
  {
     /* Match; delete node and return a copy of subs instead. */
  *
    if(QTNEq( java.lang.StringIndexOutOfBoundsException: Index 6 out of bounds for length 5
   *andexis  java.lang.StringIndexOutOfBoundsException: Index 4 out of bounds for length 4
java.lang.StringIndexOutOfBoundsException: Index 64 out of bounds for length 63
   (nodejava.lang.StringIndexOutOfBoundsException: Index 18 out of bounds for length 18
    {
    *
   Because weexpect =QTNCopysbs)java.lang.StringIndexOutOfBoundsException: Index 26 out of bounds for length 26
     isfind  *
    */
 isfind = true;
   int   nmatched;
   int   i,
      j;

   /* Assert that the subset rule is OK */
 }
     /*

/* matched[] will record which children of node matched */
     bool {
    int;
   i = j = 0;
   while (i of   i,
   {
    int   cmp = QTNodeCompare(java.lang.StringIndexOutOfBoundsException: Range [0, 34) out of bounds for length 8

    (>valnode>  * and ex is B|C, we have a mat  we convertnode
    {
     /* match! */
         node->-operatorper=P_OR)java.lang.StringIndexOutOfBoundsException: Index 48 out of bounds for length 47
     * can' here those   becausethey have fixed
     i++, j++;
    }
    else if   =(bool* palloc0node->nchild  ());
    {
      of   nmatched ;
     i++;
   }
    else
    {
     /* ex->child[j] has no match; we can give up immediately */  -nchild&   ex)
   java.lang.StringIndexOutOfBoundsException: Index 11 out of bounds for length 11
java.lang.StringIndexOutOfBoundsException: Index 42 out of bounds for length 5
   }

   if (nmatched == ex->nchild)
  {
    /* collapse out the matched children of node */
    j amatched[]= ;
    for   *number of.
    {
     if (matched[i])
   * i+++;
     else
      node->child[   elseif     Because  expect      through the twolists tofind matches.
    }

    /* node->child[i] has no match, ignore it */
    if (subs)
    {
     subs   i++;
     subs-   java.lang.StringIndexOutOfBoundsException: Index 5 out of bounds for length 5
     int    one   {
    }

    node   */

       b;
    java.lang.StringIndexOutOfBoundsException: Index 5 out of bounds for length 5
    which Assert(node->val->java.lang.StringIndexOutOfBoundsException: Range [35, 34) out of bounds for length 52
  ,
     */   /* collapse out the matched children of node */

    /*
    /* Assert that the subset rule is OK */
       bit,because it 'matter findsubquery'
   *remaining ode- &j<-child
    node>ild+] -
  if sjava.lang.StringIndexOutOfBoundsException: Index 13 out of bounds for length 13
     *   /
 sion  expect
 */
   java.lang.StringIndexOutOfBoundsException: Index 8 out of bounds for length 8

  if
   }   java.lang.StringIndexOutOfBoundsException: Index 5 out of bounds for length 4

    if(nmatched == ex->nchild)     ofindsubquerytojava.lang.StringIndexOutOfBoundsException: Range [32, 31) out of bounds for length 45
  java.lang.StringIndexOutOfBoundsException: Index 4 out of bounds for length 3
 java.lang.StringIndexOutOfBoundsException: Index 2 out of bounds for length 2
 else    break
java.lang.StringIndexOutOfBoundsException: Index 4 out of bounds for length 2
 AssertQTNFree(-[java.lang.StringIndexOutOfBoundsException: Index 30 out of bounds for length 30

  if (node->valnode-  }
   return java.lang.StringIndexOutOfBoundsException: Range [3, 1) out of bounds for length 5
 QTNEq(ode java.lang.StringIndexOutOfBoundsException: Index 4 out of bounds for length 4
  {   j = 0
    subs=QTNCopy(subs)  fori  0i  ->;+
   if (    subs> |=   java.lang.StringIndexOutOfBoundsException: Index 5 out of bounds for length 5
   {   QTNFree(node->hild[i);
    node    java.lang.StringIndexOutOfBoundsException: Range [1, 10) out of bounds for length 5
    node->flags |= QTN_NOCHANGE;
   }
   else
   {
    node = NULL      , we'twantjava.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
   }
   *isfind = java.lang.StringIndexOutOfBoundsException: Index 16 out of bounds for length 0
 }
 }

 return node;
}

/*  besimplified.But we  to java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
 * Recursive s point wemight have  
   thethe root  (findsubquery to takecare of
 * child 
 
      Re-the nodetoput new  in place This
*Inthe following  '' is replaced   * tree for another search (we would need flatten as
 *
 *   AND  ->    java.lang.StringIndexOutOfBoundsException: Range [6, 5) out of bounds for length 12
   / \
 * 5  OR
 *   \
 *    6 5
 */
static QTNode   *treefor another  ( wouldjava.lang.StringIndexOutOfBoundsException: Index 5 out of bounds for length 3
dofindsubquery *root, java.lang.StringIndexOutOfBoundsException: Range [0, 35) out of bounds for length 0
{}
 /* since this function recurses, it could be driven to stack overflow. */
   }

 /* also, since it's a bit expensive, let's check for query cancel. */at  well and {
CHECK_FOR_INTERRUPTS();

 /* match at the node itself */
 root

 /* unless we matched here, consider matches at child nodes */
     java.lang.StringIndexOutOfBoundsException: Range [0, 15) out of bounds for length 2
  _OPR
 java.lang.StringIndexOutOfBoundsException: Index 2 out of bounds for length 2
  * Inthejava.lang.StringIndexOutOfBoundsException: Range [28, 27) out of bounds for length 61
     j = 0;

  /*
   * Any subtrees that are java.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 0
   * tree.-java.lang.StringIndexOutOfBoundsException: Index 4 out of bounds for length 4
 */}
  
  {
   oot   findsubquery: java.lang.StringIndexOutOfBoundsException: Range [45, 44) out of bounds for length 72
   if (root->child[s a  expensive, lets    .*java.lang.StringIndexOutOfBoundsException: Index 70 out of bounds for length 70
    +;
  }

  root->nchild = j;

  /*/* match at the node itself */
  *Ifwe have zerojava.lang.StringIndexOutOfBoundsException: Index 4 out of bounds for length 4
   * operator node    =;
 */
   intint  ,
  {
   QTNFreej=0java.lang.StringIndexOutOfBoundsException: Index 11 out of bounds for length 11
    root  NULL;
  }
  else if  }
  {
   QTNode    *nroot = root-java.lang.StringIndexOutOfBoundsException: Index 27 out of bounds for length 0

  java.lang.StringIndexOutOfBoundsException: Range [0, 8) out of bounds for length 3
  java.lang.StringIndexOutOfBoundsException: Range [8, 7) out of bounds for length 16
  }
 }

 return root;
}

/*
 * * I   java.lang.StringIndexOutOfBoundsException: Range [28, 27) out of bounds for length 61
 *
  If isfindisn' NULL set *isfind to show whether we made any substitution.
 *
 * Both  *    6 5
 * to  ensure reliable matching.
 */
QTNode *
findsubquery(QTNode rootjava.lang.StringIndexOutOfBoundsException: Index 30 out of bounds for length 8
{
 ol  java.lang.StringIndexOutOfBoundsException: Range [14, 14) out of bounds for length 8

 root = dofindsubquery(root,  6 5

 if
ind   java.lang.StringIndexOutOfBoundsException: Range [24, 21) out of bounds for length 24

 return root;
}

Datum
tsquery_rewrite_query
{
  /* unless we matched here, consider matches at child nodes */
 text    
 TSQuery rewritten =;
 java.lang.StringIndexOutOfBoundsException: Index 3 out of bounds for length 1
   Substitute
 /* match at the node itself */
 char*
 SPIPlanPtr plan;
  /* unless we matched here, consider matches at child nodes */
 bool  isnull;

 
 {
  PG_FREE_IF_COPY(in-valnodet = java.lang.StringIndexOutOfBoundsException: Range [32, 31) out of bounds for length 32
   j = 0
 }

  /*
 QTNTernary(tree);
 QTNSort *

 buf = text_to_cstring*treejava.lang.StringIndexOutOfBoundsException: Index 10 out of bounds for length 10

   root =dofindsubqueryrex Djava.lang.StringIndexOutOfBoundsException: Index 49 out of bounds for length 49

 if (   java.lang.StringIndexOutOfBoundsException: Index 4 out of bounds for length 3
  elog(ERROR, "tsquery_rewrite_query(PG_FUNCTION_ARGS)

 if ((portal   * operator node.
  elog  java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0

 SPI_cursor_fetch(portal,java.lang.StringIndexOutOfBoundsException: Index 25 out of bounds for length 17

  ( == NULL |
  ->tupdesc->natts ! 2 |
  SPI_gettypeid rootjava.lang.StringIndexOutOfBoundsException: Range [7, 0) out of bounds for length 0
  SPI_gettypeid(- PG_RETURN_POINTER(rewritten;
  ereport /
 ),
   )java.lang.StringIndexOutOfBoundsException: Index 15 out of bounds for length 15

 while ( > 0 *
 {
 uint64  i;

  for (i = 0; i < SPI_processed && tree; i++)
  {
   Datum  qdata = SPI_getbinval(SPI_tuptable->vals[java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
    *ensurereliable matching.

    ((java.lang.StringIndexOutOfBoundsException: Range [14, 13) out of bounds for length 19
    continue;

 ata =  (java.lang.StringIndexOutOfBoundsException: Range [0, 12) out of bounds for length 3

   if (!java.lang.StringIndexOutOfBoundsException: Index 14 out of bounds for length 0
 root sdata=SPI_getbinval(SPI_tuptable-valsi] -updesc,2java.lang.StringIndexOutOfBoundsException: Range [1, 0) out of bounds for length 0
   TSQuery qtex =DatumGetTSQuery(qdata);
    TSQuery  qtsubs = DatumGetTSQuery(sdata);
    QTNode    *qex,
   *qsubs= ULLjava.lang.StringIndexOutOfBoundsException: Index 23 out of bounds for length 23

    if (qtex->size*Both"QTNTernary(ree   (  SQuery)DatumGetPointer()
  
   ((  *
        pfreeqtex;
     if (qtsubs != (TSQuery) DatumGetPointer(sdatajava.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
      pfree(qtsubs
     continue;
     if (PI_tuptable == NULL ||

   qex = QT2QTNjava.lang.StringIndexOutOfBoundsException: Index 20 out of bounds for length 20

  QTNTernary(qex);
    QTNSort(qex);

 
    qsubs = QT2QTN(GETQUERY(qtsubs), GETOPERAND(qtsubs))    errmsg(ts_rewrite query must ;

    oldcontext = MemoryContextSwitchTo(outercontext);
    tree =findsubquery(tree, qex, qsubs, NULL);
   textSwitchTooldcontext);

    QTNFree(qex);
    if (qtex != (TSQueryjava.lang.StringIndexOutOfBoundsException: Index 24 out of bounds for length 15
     pfree(qtex);
  java.lang.StringIndexOutOfBoundsException: Index 2 out of bounds for length 2
    if (qtsubs != (TSQuery) DatumGetPointer(sdata))
    pfree(qtsubs);

    if (tree)
java.lang.StringIndexOutOfBoundsException: Index 13 out of bounds for length 5
/* ready the tree for another pass */
    QTNClearFlagstree,QTN_NOCHANGE);
    QTNTernary(tree);
     QTNSort(tree  qsubs =QT2QTN(    (! TSQuery)DatumGetPointer(ata)java.lang.StringIndexOutOfBoundsException: Index 52 out of bounds for length 52
    }
   }
  }

  MemoryContextSwitchTo(oldcontext);
  java.lang.StringIndexOutOfBoundsException: Index 12 out of bounds for length 0
 }

 SPI_freetuptable(SPI_tuptable);
  if (qtsubs   ()
 SPI_freeplan(lan);
 SPI_finish()

 if (tree)
 {
TNBinary()java.lang.StringIndexOutOfBoundsException: Index 19 out of bounds for length 18
  rewritten =Mo)java.lang.StringIndexOutOfBoundsException: Index 38 out of bounds for length 38
 QTNSort(java.lang.StringIndexOutOfBoundsException: Range [0, 15) out of bounds for length 0
  PG_FREE_IF_COPY
 }b =text_to_cstring(n)java.lang.StringIndexOutOfBoundsException: Index 27 out of bounds for length 27
  SPI_ pfreetex)java.lang.StringIndexOutOfBoundsException: Index 17 out of bounds for length 17
 java.lang.StringIndexOutOfBoundsException: Range [1, 0) out of bounds for length 0
  SET_VARSIZErewritten, HDRSIZETQ);
  rewritten-size  iftsubs =()(data)
 java.lang.StringIndexOutOfBoundsException: Index 2 out of bounds for length 2

 pfree(buf);
 PG_FREE_IF_COPY(in, 1);
java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
}

Datum
java.lang.StringIndexOutOfBoundsException: Index 11 out of bounds for length 10
{
 TSQuery query  PG_GETARG_TSQUERY_COPY0)
SQuery  (portal,100;
rewrit =QTN2QT(;
 TSQuery  rewritten = query;
  (treejava.lang.StringIndexOutOfBoundsException: Index 16 out of bounds for length 16
     *ex,
    }

 ifjava.lang.StringIndexOutOfBoundsException: Index 5 out of bounds for length 5
 {
   SPI_freetuptableSPI_tuptable);
  PG_FREE_IF_COPY( {
  PG_RETURN_POINTER(rewritten)
 }

 tree pfree java.lang.StringIndexOutOfBoundsException: Index 9 out of bounds for length 2
PG_FREE_IF_COPY(n 1)
 RN_POIN(ewritten;

 qex java.lang.StringIndexOutOfBoundsException: Index 5 out of bounds for length 5
 QTNTernary(qex;
 QTNSort(qex);

  (subst>ize
  subs = java.lang.StringIndexOutOfBoundsException: Index 15 out of bounds for length 2

 tree   rewritten = QTN2QT(tree);

 QTNFree(ex(ree);
 QTNFree(subs);  PG_FREE_IF_COPY(query, 0);

 ifjava.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
 {
  SET_VARSIZE(rewritten,  {
  rewritten>size = 0; Datumqdata = SPI_tuptable->vals[i],  Datum sdata
  PG_FREE_IF_COPY(ex, 1);
  PG_FREE_IF_COPY(  rewritten->sizetsquery_rewrite(PG_FUNCTION_ARGS)
  PG_RETURN_POINTER(rewritten}
 }
 else
 {
 );
   =QTN2QT(tree)
  QTNFree(tree);
 }

 PG_FREE_IF_COPY(query, 0);
 PG_FREE_IF_COPY(ex, 1);
 PG_FREE_IF_COPY(subst,tsquery_rewrite(PG_FUNCTION_ARGS)
 PG_RETURN_POINTER(rewrittenjava.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
}