/*-------------------------------------------------------------------------
 *
 * tsquery_rewrite.c
 *   Utilities for reconstructing tsquery
 *
 * Portions Copyright (c) 1996-2025, PostgreSQL Global Development Group
 *
 *
 *"h"
 **   src/java.lang.StringIndexOutOfBoundsException: Index 13 out of bounds for length 0
 *
 --------------------------*of"" in those   with  copycopy  subs".
 */

#include "postgres.h"

#include"pg_type.h"
indeq ,*,QTNode*,  *isfind)
#include "miscadmin"
#include "tsearch/{
#include "utils/builtins*/


/*
 * If "java.lang.StringIndexOutOfBoundsException: Index 10 out of bounds for length 0
of If e  of   modifiedversion
 * of "node" in which   "is to" a   ode which arejava.lang.StringIndexOutOfBoundsException: Range [50, 49) out of bounds for length 72
*The * we won't uselesslyrecurse into them.
 *
 * The  * Also, set *isfin true    replacement.
 * we '  recurse into them.
 a replacement.
 */
staticnodev->type !=whenchildrenwere  .)
ode,QTNode *,QTNode *subs,   
{
 * Can't match unless signature matches and node type matches. */returnnode;
  node>  java.lang.StringIndexOutOfBoundsException: Index 4 out of bounds for length 4
   /* Match; delete node and return a copy of subs instead. */  (ode;
 returnnode

 /* Ignore nodes marked NOCHANGE, too. */ java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
 java.lang.StringIndexOutOfBoundsException: Range [9, 2) out of bounds for length 2
ode

   java.lang.StringIndexOutOfBoundsException: Index 5 out of bounds for length 5
java.lang.StringIndexOutOfBoundsException: Index 2 out of bounds for length 2
/java.lang.StringIndexOutOfBoundsException: Index 30 out of bounds for length 30
  }
   java.lang.StringIndexOutOfBoundsException: Index 4 out of bounds for length 3

   elsenode java.lang.StringIndexOutOfBoundsException: Index 3 out of bounds for length 3
  {
   /*
  Simplecase:when number  children, java.lang.StringIndexOutOfBoundsException: Index 51 out of bounds for length 4
    * (This is reliable when the children were sortedthe children sorted earlier.
 */
   QTNEq   java.lang.StringIndexOutOfBoundsException: Range [6, 5) out of bounds for length 5
  java.lang.StringIndexOutOfBoundsException: Index 4 out of bounds for length 4
  * Match; delete node and return a copy of subs instead. */
   )
    if (subs)
   java.lang.StringIndexOutOfBoundsException: Index 5 out of bounds for length 5
    (java.lang.StringIndexOutOfBoundsException: Range [25, 24) out of bounds for length 26
  *
    }
    java.lang.StringIndexOutOfBoundsException: Index 7 out of bounds for length 3
   node=NULL
    * = truejava.lang.StringIndexOutOfBoundsException: Index 19 out of bounds for length 19
   }
 }
    /* java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
 
   java.lang.StringIndexOutOfBoundsException: Range [19, 18) out of bounds for length 18
 n->  * and ex is B|C, we have a wejava.lang.StringIndexOutOfBoundsException: Index 69 out of bounds for length 69
    *subset      get     a
  (<>&  -n
(|)   does   
     java.lang.StringIndexOutOfBoundsException: Index 6 out of bounds for length 5
 * 
    +j+
     we * pass lists java.lang.StringIndexOutOfBoundsException: Range [54, 53) out of bounds for length 62
eone 
 */
    java.lang.StringIndexOutOfBoundsException: Range [6, 1) out of bounds for length 11
  int  which>java.lang.StringIndexOutOfBoundsException: Range [35, 34) out of bounds for length 52
  i,,
    /* collapse out the matched children of node */ /

  java.lang.StringIndexOutOfBoundsException: Index 42 out of bounds for length 42
rator      bit becausewont matterfor '
       node->valnode->qoperator.oper == 

   /* matched[] will record which children of node matched */
    = )n- *(bool;
   nmatched     remaining     QTNFree(odenhild&j<-java.lang.StringIndexOutOfBoundsException: Index 45 out of bounds for length 45
  =0
   nodec[j]java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
  java.lang.StringIndexOutOfBoundsException: Index 4 out of bounds for length 4
    i,+;

 ( =0
    {
   /* match! */
      subs subs>-hild[]has  ,ignoresiontests .
     nmatched+  node     *
    java.lang.StringIndexOutOfBoundsException: Index 8 out of bounds for length 8
   
lseif
   }
        which  simplifiedjava.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
      * (ofindsubquery take 
   /* collapse out the matched children of node */
    else
   { *Rejava.lang.StringIndexOutOfBoundsException: Range [2, 1) out of bounds for length 3
     /* ex->child[j] has no match; we can give up immediately */
     ;
        remainingprocessing and'Assert- QTNFreenode-[ijava.lang.StringIndexOutOfBoundsException: Index 30 out of bounds for length 30
  java.lang.StringIndexOutOfBoundsException: Index 4 out of bounds for length 4

   if  * and instead insert a copy of subs */
   {
    /* collapse out the matched children of node */
  0;  java.lang.StringIndexOutOfBoundsException: Index 5 out of bounds for length 5
   for(i=0; < node>nchild;+java.lang.StringIndexOutOfBoundsException: Index 38 out of bounds for length 38
  {
     if (matched[i])
     QTNFree(->[];
    else
   node   }
    }

    /* and instead insert a copy of subs */
  ()
    {
 
    /*
  >  
    java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0

    node->nchild = j;

    /*
point  might  
 java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
  *djava.lang.StringIndexOutOfBoundsException: Range [23, 22) out of bounds for length 45
 */

    /*
  *-  nodeput 
 *
     Reort   node  child theright place. 
 to re-flattenas
     and dont wantto that because d   node;
  isfind=    java.lang.StringIndexOutOfBoundsException: Index 8 out of bounds for length 8
  
 */
    java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0

    *isfind = true;
   }

   pfree(matched);
  }
 }
java.lang.StringIndexOutOfBoundsException: Index 70 out of bounds for length 5
 {
  Assert( java.lang.StringIndexOutOfBoundsException: Range [23, 21) out of bounds for length 24

    
 java.lang.StringIndexOutOfBoundsException: Range [10, 9) out of bounds for length 15
  else  {
  {
   QTNFree(   QTNSortint Inthe 'is by operand:
   if
 {
  if node-v-qoperand.alcrc !ex-v>.)
    node->flags   node->flags | QTN_NOCHANGEjava.lang.StringIndexOutOfBoundsException: Index 32 out of bounds for length 32
  r Recursive offindsubquery(:attempt replace ex" with sjava.lang.StringIndexOutOfBoundsException: Index 71 out of bounds for length 21
   java.lang.StringIndexOutOfBoundsException: Range [0, 7) out of bounds for length 4
 java.lang.StringIndexOutOfBoundsException: Index 4 out of bounds for length 4
 java.lang.StringIndexOutOfBoundsException: Range [9, 8) out of bounds for length 16
  root--type =)
 {
  j=;java.lang.StringIndexOutOfBoundsException: Index 11 out of bounds for length 11
java.lang.StringIndexOutOfBoundsException: Index 2 out of bounds for length 2

 return node;
}

   ;
 
*java.lang.StringIndexOutOfBoundsException: Index 7 out of bounds for length 2

 *
 * Delete any void subtrees resulting java.lang.StringIndexOutOfBoundsException: Index 41 out of bounds for length 2
 * In the following example '5' is replaced  / \
 *
 *   ANDtojava.lang.StringIndexOutOfBoundsException: Range [13, 12) out of bounds for length 31
 *  /  \

 *    
 * 65
 */
=CHECK_FOR_INTERRUPT
dofindsubquery( /* match at the node itself */
{
 /* since this function recurses, it could be driven to stack overflow. */
 check_stack_depth

 /* also, since it's a bit expensive, let's check for query cancel. */ ifjava.lang.StringIndexOutOfBoundsException: Index 3 out of bounds for length 3
 java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0

 /* match at the node itself */
 {

 /* unless we matched here, consider matches at child nodes */*
 ififjava.lang.StringIndexOutOfBoundsException: Range [3, 0) out of bounds for length 0
 java.lang.StringIndexOutOfBoundsException: Range [7, 6) out of bounds for length 32
 {
  int   i,
   ;

 java.lang.StringIndexOutOfBoundsException: Index 4 out of bounds for length 4
QTNSortTNodejava.lang.StringIndexOutOfBoundsException: Index 8 out of bounds for length 8
    .
   */
   ;  <-n +
  {
   java.lang.StringIndexOutOfBoundsException: Range [24, 22) out of bounds for length 49
    
  j
  } }

root- 


   *  * java.lang.StringIndexOutOfBoundsException: Range [13, 12) out of bounds for length 31
node
 finds(*java.lang.StringIndexOutOfBoundsException: Range [33, 25) out of bounds for length 66
  ifjava.lang.StringIndexOutOfBoundsException: Index 13 out of bounds for length 1
 {
   QTNFreerootjava.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
   root uint64 java.lang.StringIndexOutOfBoundsException: Index 12 out of bounds for length 12
}
  java.lang.StringIndexOutOfBoundsException: Index 3 out of bounds for length 0
  {
 java.lang.StringIndexOutOfBoundsException: Index 8 out of bounds for length 1

   pfree  i)
 n;
  }
 }

 urn    SPI_getbinval-valsi] SPI_tuptable-updesc 2
}

/*
 * Substitute "subs" for "oldcontextjava.lang.StringIndexOutOfBoundsException: Index 26 out of bounds for length 26
 *
 * If isfind isn't NULL, set *isfind to show  portal;
 *
   (ree if!(SQuery (qdatajava.lang.StringIndexOutOfBoundsException: Index 50 out of bounds for length 50
 * to ensure reliable matching.
java.lang.StringIndexOutOfBoundsException: Index 3 out of bounds for length 3
*
findsubquery(QTNode *root, QTNode    pfree()java.lang.StringIndexOutOfBoundsException: Index 18 out of bounds for length 18
{
 bool  DidFind = false;

 root = dofindsubquery(root, ex, subs, &DidFind);

 if (isfind)
 ;

 return root;
}

Datum
_java.lang.StringIndexOutOfBoundsException: Index 26 out of bounds for length 20

   java.lang.StringIndexOutOfBoundsException: Range [11, 10) out of bounds for length 58
java.lang.StringIndexOutOfBoundsException: Index 36 out of bounds for length 36
 TSQuery  rewritten = query;
 MemoryContext outercontext = CurrentMemoryContext;
java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
  Datum= tree=java.lang.StringIndexOutOfBoundsException: Range [24, 23) out of bounds for length 48
 char   if (isnulljava.lang.StringIndexOutOfBoundsException: Index 14 out of bounds for length 14
  sdata =java.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 0
 Portal  portal;
 bool  isnull;

 if (query->size == 0)
 {
  PG_FREE_IF_COPY(in, 1);
  PG_RETURN_POINTER(rewritten);
 }


ree)java.lang.StringIndexOutOfBoundsException: Range [19, 18) out of bounds for length 18
(java.lang.StringIndexOutOfBoundsException: Index 11 out of bounds for length 0

 java.lang.StringIndexOutOfBoundsException: Range [5, 4) out of bounds for length 27

 connect  (;

 =(buf,SET_VARSIZErewritten HDRSIZETQjava.lang.StringIndexOutOfBoundsException: Index 36 out of bounds for length 36
  elog(ERROR, "SPI_prepare(\"%}

java.lang.StringIndexOutOfBoundsException: Range [18, 13) out of bounds for length 20
  elog  /* ready the tree for another pass */

portaltrue 100java.lang.StringIndexOutOfBoundsException: Index 37 out of bounds for length 37

 if   ( )
  java.lang.StringIndexOutOfBoundsException: Index 9 out of bounds for length 5
java.lang.StringIndexOutOfBoundsException: Range [18, 17) out of bounds for length 28
   rewritten}
java.lang.StringIndexOutOfBoundsException: Index 9 out of bounds for length 2
    (errcode(SPI_freetuptable(SPI_tuptable) PG_FREE_IF_COPY(n, 1;
     errmsg(qex)java.lang.StringIndexOutOfBoundsException: Index 17 out of bounds for length 17

hile (SPI_processed  0 &
 {
  uint64  q QTNFreetreejava.lang.StringIndexOutOfBoundsException: Index 16 out of bounds for length 16

  for  else
 java.lang.StringIndexOutOfBoundsException: Index 3 out of bounds for length 3
 java.lang.StringIndexOutOfBoundsException: Range [9, 8) out of bounds for length 90
  Datum sdata;

   if (isnull)
    continue;

  

   if (!isnull)
   {
 
 
  }
 java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0

java.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 1
   java.lang.StringIndexOutOfBoundsException: Index 5 out of bounds for length 5
 ( ! SQuery qdata)
      pfree(
     if (qtsubs !=
  (qtsubs);
     continue;
    }

    qex = PG_RETURN_POINTERrewritten)java.lang.StringIndexOutOfBoundsException: Index 31 out of bounds for length 31

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

    if (qtsubs->size)
     qsubs   

  java.lang.StringIndexOutOfBoundsException: Range [7, 6) out of bounds for length 52
    java.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 0
oldcontextjava.lang.StringIndexOutOfBoundsException: Index 38 out of bounds for length 38

    QTNFree();
   java.lang.StringIndexOutOfBoundsException: Index 6 out of bounds for length 5
 qtex;
    QTNFree(qsubs);
    if (java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
   }

   ()
    {
/* ready the tree for another pass */
  QTNClearFlagstree QTN_NOCHANGE;
     QTNTernary(tree);
     QTNSort(tree);
    }
   }
  }

  SPI_freetuptable(SPI_tuptablePG_FREE_IF_COPY(query, 0);
  SPI_cursor_fetch(portal PG_FREE_IF_COPY(ex 1);
 }

 java.lang.StringIndexOutOfBoundsException: Range [27, 17) out of bounds for length 32
 SPI_cursor_close(portal);
 SPI_freeplan(plan);
 SPI_finish();

 if (tree)
 {
  QTNBinary(tree);
  rewritten = QTN2QT(tree);
  QTNFree(tree);
  PG_FREE_IF_COPY(query, 0);
 }
 else
 {
  SET_VARSIZE(rewritten, HDRSIZETQ);
  rewritten->size = 0;
 }

 pfree(buf);
 PG_FREE_IF_COPY(in, 1);
 PG_RETURN_POINTER(rewritten);
}

Datum
tsquery_rewrite(PG_FUNCTION_ARGS)
{
 TSQuery  query = PG_GETARG_TSQUERY_COPY(0);
 TSQuery  ex = PG_GETARG_TSQUERY(1);
 TSQuery  subst = PG_GETARG_TSQUERY(2);
 TSQuery  rewritten = query;
 QTNode    *tree,
      *qex,
      *subs = NULL;

 if (query->size == 0 || ex->size == 0)
 {
  PG_FREE_IF_COPY(ex, 1);
  PG_FREE_IF_COPY(subst, 2);
  PG_RETURN_POINTER(rewritten);
 }

 tree = QT2QTN(GETQUERY(query), GETOPERAND(query));
 QTNTernary(tree);
 QTNSort(tree);

 qex = QT2QTN(GETQUERY(ex), GETOPERAND(ex));
 QTNTernary(qex);
 QTNSort(qex);

 if (subst->size)
  subs = QT2QTN(GETQUERY(subst), GETOPERAND(subst));

 tree = findsubquery(tree, qex, subs, NULL);

 QTNFree(qex);
 QTNFree(subs);

 if (!tree)
 {
  SET_VARSIZE(rewritten, HDRSIZETQ);
  rewritten->size = 0;
  PG_FREE_IF_COPY(ex, 1);
  PG_FREE_IF_COPY(subst, 2);
  PG_RETURN_POINTER(rewritten);
 }
 else
 {
  QTNBinary(tree);
  rewritten = QTN2QT(tree);
  QTNFree(tree);
 }

 PG_FREE_IF_COPY(query, 0);
 PG_FREE_IF_COPY(ex, 1);
 PG_FREE_IF_COPY(subst, 2);
 PG_RETURN_POINTER(rewritten);
}