PostgreSQL Source Code  git master
tsvector_op.c
Go to the documentation of this file.
1 /*-------------------------------------------------------------------------
2  *
3  * tsvector_op.c
4  * operations over tsvector
5  *
6  * Portions Copyright (c) 1996-2024, PostgreSQL Global Development Group
7  *
8  *
9  * IDENTIFICATION
10  * src/backend/utils/adt/tsvector_op.c
11  *
12  *-------------------------------------------------------------------------
13  */
14 #include "postgres.h"
15 
16 #include <limits.h>
17 
18 #include "access/htup_details.h"
19 #include "catalog/namespace.h"
20 #include "catalog/pg_type.h"
21 #include "commands/trigger.h"
22 #include "common/int.h"
23 #include "executor/spi.h"
24 #include "funcapi.h"
25 #include "lib/qunique.h"
26 #include "mb/pg_wchar.h"
27 #include "miscadmin.h"
28 #include "parser/parse_coerce.h"
29 #include "tsearch/ts_utils.h"
30 #include "utils/array.h"
31 #include "utils/builtins.h"
32 #include "utils/regproc.h"
33 #include "utils/rel.h"
34 
35 
36 typedef struct
37 {
40  char *values;
41  char *operand;
42 } CHKVAL;
43 
44 
45 typedef struct StatEntry
46 {
47  uint32 ndoc; /* zero indicates that we were already here
48  * while walking through the tree */
50  struct StatEntry *left;
51  struct StatEntry *right;
55 
56 #define STATENTRYHDRSZ (offsetof(StatEntry, lexeme))
57 
58 typedef struct
59 {
61 
63 
66 
68 } TSVectorStat;
69 
70 
71 static TSTernaryValue TS_execute_recurse(QueryItem *curitem, void *arg,
72  uint32 flags,
73  TSExecuteCallback chkcond);
74 static bool TS_execute_locations_recurse(QueryItem *curitem,
75  void *arg,
76  TSExecuteCallback chkcond,
77  List **locations);
78 static int tsvector_bsearch(const TSVector tsv, char *lexeme, int lexeme_len);
79 static Datum tsvector_update_trigger(PG_FUNCTION_ARGS, bool config_column);
80 
81 
82 /*
83  * Order: haspos, len, word, for all positions (pos, weight)
84  */
85 static int
87 {
88  if (VARSIZE(a) < VARSIZE(b))
89  return -1;
90  else if (VARSIZE(a) > VARSIZE(b))
91  return 1;
92  else if (a->size < b->size)
93  return -1;
94  else if (a->size > b->size)
95  return 1;
96  else
97  {
98  WordEntry *aptr = ARRPTR(a);
99  WordEntry *bptr = ARRPTR(b);
100  int i = 0;
101  int res;
102 
103 
104  for (i = 0; i < a->size; i++)
105  {
106  if (aptr->haspos != bptr->haspos)
107  {
108  return (aptr->haspos > bptr->haspos) ? -1 : 1;
109  }
110  else if ((res = tsCompareString(STRPTR(a) + aptr->pos, aptr->len, STRPTR(b) + bptr->pos, bptr->len, false)) != 0)
111  {
112  return res;
113  }
114  else if (aptr->haspos)
115  {
116  WordEntryPos *ap = POSDATAPTR(a, aptr);
117  WordEntryPos *bp = POSDATAPTR(b, bptr);
118  int j;
119 
120  if (POSDATALEN(a, aptr) != POSDATALEN(b, bptr))
121  return (POSDATALEN(a, aptr) > POSDATALEN(b, bptr)) ? -1 : 1;
122 
123  for (j = 0; j < POSDATALEN(a, aptr); j++)
124  {
125  if (WEP_GETPOS(*ap) != WEP_GETPOS(*bp))
126  {
127  return (WEP_GETPOS(*ap) > WEP_GETPOS(*bp)) ? -1 : 1;
128  }
129  else if (WEP_GETWEIGHT(*ap) != WEP_GETWEIGHT(*bp))
130  {
131  return (WEP_GETWEIGHT(*ap) > WEP_GETWEIGHT(*bp)) ? -1 : 1;
132  }
133  ap++, bp++;
134  }
135  }
136 
137  aptr++;
138  bptr++;
139  }
140  }
141 
142  return 0;
143 }
144 
145 #define TSVECTORCMPFUNC( type, action, ret ) \
146 Datum \
147 tsvector_##type(PG_FUNCTION_ARGS) \
148 { \
149  TSVector a = PG_GETARG_TSVECTOR(0); \
150  TSVector b = PG_GETARG_TSVECTOR(1); \
151  int res = silly_cmp_tsvector(a, b); \
152  PG_FREE_IF_COPY(a,0); \
153  PG_FREE_IF_COPY(b,1); \
154  PG_RETURN_##ret( res action 0 ); \
155 } \
156 /* keep compiler quiet - no extra ; */ \
157 extern int no_such_variable
158 
159 TSVECTORCMPFUNC(lt, <, BOOL);
160 TSVECTORCMPFUNC(le, <=, BOOL);
161 TSVECTORCMPFUNC(eq, ==, BOOL);
162 TSVECTORCMPFUNC(ge, >=, BOOL);
163 TSVECTORCMPFUNC(gt, >, BOOL);
164 TSVECTORCMPFUNC(ne, !=, BOOL);
165 TSVECTORCMPFUNC(cmp, +, INT32);
166 
167 Datum
169 {
171  TSVector out;
172  int i,
173  len = 0;
174  WordEntry *arrin = ARRPTR(in),
175  *arrout;
176  char *cur;
177 
178  for (i = 0; i < in->size; i++)
179  len += arrin[i].len;
180 
181  len = CALCDATASIZE(in->size, len);
182  out = (TSVector) palloc0(len);
183  SET_VARSIZE(out, len);
184  out->size = in->size;
185  arrout = ARRPTR(out);
186  cur = STRPTR(out);
187  for (i = 0; i < in->size; i++)
188  {
189  memcpy(cur, STRPTR(in) + arrin[i].pos, arrin[i].len);
190  arrout[i].haspos = 0;
191  arrout[i].len = arrin[i].len;
192  arrout[i].pos = cur - STRPTR(out);
193  cur += arrout[i].len;
194  }
195 
196  PG_FREE_IF_COPY(in, 0);
197  PG_RETURN_POINTER(out);
198 }
199 
200 Datum
202 {
204  int32 ret = in->size;
205 
206  PG_FREE_IF_COPY(in, 0);
207  PG_RETURN_INT32(ret);
208 }
209 
210 Datum
212 {
214  char cw = PG_GETARG_CHAR(1);
215  TSVector out;
216  int i,
217  j;
218  WordEntry *entry;
219  WordEntryPos *p;
220  int w = 0;
221 
222  switch (cw)
223  {
224  case 'A':
225  case 'a':
226  w = 3;
227  break;
228  case 'B':
229  case 'b':
230  w = 2;
231  break;
232  case 'C':
233  case 'c':
234  w = 1;
235  break;
236  case 'D':
237  case 'd':
238  w = 0;
239  break;
240  default:
241  /* internal error */
242  elog(ERROR, "unrecognized weight: %d", cw);
243  }
244 
245  out = (TSVector) palloc(VARSIZE(in));
246  memcpy(out, in, VARSIZE(in));
247  entry = ARRPTR(out);
248  i = out->size;
249  while (i--)
250  {
251  if ((j = POSDATALEN(out, entry)) != 0)
252  {
253  p = POSDATAPTR(out, entry);
254  while (j--)
255  {
256  WEP_SETWEIGHT(*p, w);
257  p++;
258  }
259  }
260  entry++;
261  }
262 
263  PG_FREE_IF_COPY(in, 0);
264  PG_RETURN_POINTER(out);
265 }
266 
267 /*
268  * setweight(tsin tsvector, char_weight "char", lexemes "text"[])
269  *
270  * Assign weight w to elements of tsin that are listed in lexemes.
271  */
272 Datum
274 {
275  TSVector tsin = PG_GETARG_TSVECTOR(0);
276  char char_weight = PG_GETARG_CHAR(1);
277  ArrayType *lexemes = PG_GETARG_ARRAYTYPE_P(2);
278 
279  TSVector tsout;
280  int i,
281  j,
282  nlexemes,
283  weight;
284  WordEntry *entry;
285  Datum *dlexemes;
286  bool *nulls;
287 
288  switch (char_weight)
289  {
290  case 'A':
291  case 'a':
292  weight = 3;
293  break;
294  case 'B':
295  case 'b':
296  weight = 2;
297  break;
298  case 'C':
299  case 'c':
300  weight = 1;
301  break;
302  case 'D':
303  case 'd':
304  weight = 0;
305  break;
306  default:
307  /* internal error */
308  elog(ERROR, "unrecognized weight: %c", char_weight);
309  }
310 
311  tsout = (TSVector) palloc(VARSIZE(tsin));
312  memcpy(tsout, tsin, VARSIZE(tsin));
313  entry = ARRPTR(tsout);
314 
315  deconstruct_array_builtin(lexemes, TEXTOID, &dlexemes, &nulls, &nlexemes);
316 
317  /*
318  * Assuming that lexemes array is significantly shorter than tsvector we
319  * can iterate through lexemes performing binary search of each lexeme
320  * from lexemes in tsvector.
321  */
322  for (i = 0; i < nlexemes; i++)
323  {
324  char *lex;
325  int lex_len,
326  lex_pos;
327 
328  /* Ignore null array elements, they surely don't match */
329  if (nulls[i])
330  continue;
331 
332  lex = VARDATA(dlexemes[i]);
333  lex_len = VARSIZE(dlexemes[i]) - VARHDRSZ;
334  lex_pos = tsvector_bsearch(tsout, lex, lex_len);
335 
336  if (lex_pos >= 0 && (j = POSDATALEN(tsout, entry + lex_pos)) != 0)
337  {
338  WordEntryPos *p = POSDATAPTR(tsout, entry + lex_pos);
339 
340  while (j--)
341  {
342  WEP_SETWEIGHT(*p, weight);
343  p++;
344  }
345  }
346  }
347 
348  PG_FREE_IF_COPY(tsin, 0);
349  PG_FREE_IF_COPY(lexemes, 2);
350 
351  PG_RETURN_POINTER(tsout);
352 }
353 
354 #define compareEntry(pa, a, pb, b) \
355  tsCompareString((pa) + (a)->pos, (a)->len, \
356  (pb) + (b)->pos, (b)->len, \
357  false)
358 
359 /*
360  * Add positions from src to dest after offsetting them by maxpos.
361  * Return the number added (might be less than expected due to overflow)
362  */
363 static int32
365  TSVector dest, WordEntry *destptr,
366  int32 maxpos)
367 {
368  uint16 *clen = &_POSVECPTR(dest, destptr)->npos;
369  int i;
370  uint16 slen = POSDATALEN(src, srcptr),
371  startlen;
372  WordEntryPos *spos = POSDATAPTR(src, srcptr),
373  *dpos = POSDATAPTR(dest, destptr);
374 
375  if (!destptr->haspos)
376  *clen = 0;
377 
378  startlen = *clen;
379  for (i = 0;
380  i < slen && *clen < MAXNUMPOS &&
381  (*clen == 0 || WEP_GETPOS(dpos[*clen - 1]) != MAXENTRYPOS - 1);
382  i++)
383  {
384  WEP_SETWEIGHT(dpos[*clen], WEP_GETWEIGHT(spos[i]));
385  WEP_SETPOS(dpos[*clen], LIMITPOS(WEP_GETPOS(spos[i]) + maxpos));
386  (*clen)++;
387  }
388 
389  if (*clen != startlen)
390  destptr->haspos = 1;
391  return *clen - startlen;
392 }
393 
394 /*
395  * Perform binary search of given lexeme in TSVector.
396  * Returns lexeme position in TSVector's entry array or -1 if lexeme wasn't
397  * found.
398  */
399 static int
400 tsvector_bsearch(const TSVector tsv, char *lexeme, int lexeme_len)
401 {
402  WordEntry *arrin = ARRPTR(tsv);
403  int StopLow = 0,
404  StopHigh = tsv->size,
405  StopMiddle,
406  cmp;
407 
408  while (StopLow < StopHigh)
409  {
410  StopMiddle = (StopLow + StopHigh) / 2;
411 
412  cmp = tsCompareString(lexeme, lexeme_len,
413  STRPTR(tsv) + arrin[StopMiddle].pos,
414  arrin[StopMiddle].len,
415  false);
416 
417  if (cmp < 0)
418  StopHigh = StopMiddle;
419  else if (cmp > 0)
420  StopLow = StopMiddle + 1;
421  else /* found it */
422  return StopMiddle;
423  }
424 
425  return -1;
426 }
427 
428 /*
429  * qsort comparator functions
430  */
431 
432 static int
433 compare_int(const void *va, const void *vb)
434 {
435  int a = *((const int *) va);
436  int b = *((const int *) vb);
437 
438  return pg_cmp_s32(a, b);
439 }
440 
441 static int
442 compare_text_lexemes(const void *va, const void *vb)
443 {
444  Datum a = *((const Datum *) va);
445  Datum b = *((const Datum *) vb);
446  char *alex = VARDATA_ANY(a);
447  int alex_len = VARSIZE_ANY_EXHDR(a);
448  char *blex = VARDATA_ANY(b);
449  int blex_len = VARSIZE_ANY_EXHDR(b);
450 
451  return tsCompareString(alex, alex_len, blex, blex_len, false);
452 }
453 
454 /*
455  * Internal routine to delete lexemes from TSVector by array of offsets.
456  *
457  * int *indices_to_delete -- array of lexeme offsets to delete (modified here!)
458  * int indices_count -- size of that array
459  *
460  * Returns new TSVector without given lexemes along with their positions
461  * and weights.
462  */
463 static TSVector
464 tsvector_delete_by_indices(TSVector tsv, int *indices_to_delete,
465  int indices_count)
466 {
467  TSVector tsout;
468  WordEntry *arrin = ARRPTR(tsv),
469  *arrout;
470  char *data = STRPTR(tsv),
471  *dataout;
472  int i, /* index in arrin */
473  j, /* index in arrout */
474  k, /* index in indices_to_delete */
475  curoff; /* index in dataout area */
476 
477  /*
478  * Sort the filter array to simplify membership checks below. Also, get
479  * rid of any duplicate entries, so that we can assume that indices_count
480  * is exactly equal to the number of lexemes that will be removed.
481  */
482  if (indices_count > 1)
483  {
484  qsort(indices_to_delete, indices_count, sizeof(int), compare_int);
485  indices_count = qunique(indices_to_delete, indices_count, sizeof(int),
486  compare_int);
487  }
488 
489  /*
490  * Here we overestimate tsout size, since we don't know how much space is
491  * used by the deleted lexeme(s). We will set exact size below.
492  */
493  tsout = (TSVector) palloc0(VARSIZE(tsv));
494 
495  /* This count must be correct because STRPTR(tsout) relies on it. */
496  tsout->size = tsv->size - indices_count;
497 
498  /*
499  * Copy tsv to tsout, skipping lexemes listed in indices_to_delete.
500  */
501  arrout = ARRPTR(tsout);
502  dataout = STRPTR(tsout);
503  curoff = 0;
504  for (i = j = k = 0; i < tsv->size; i++)
505  {
506  /*
507  * If current i is present in indices_to_delete, skip this lexeme.
508  * Since indices_to_delete is already sorted, we only need to check
509  * the current (k'th) entry.
510  */
511  if (k < indices_count && i == indices_to_delete[k])
512  {
513  k++;
514  continue;
515  }
516 
517  /* Copy lexeme and its positions and weights */
518  memcpy(dataout + curoff, data + arrin[i].pos, arrin[i].len);
519  arrout[j].haspos = arrin[i].haspos;
520  arrout[j].len = arrin[i].len;
521  arrout[j].pos = curoff;
522  curoff += arrin[i].len;
523  if (arrin[i].haspos)
524  {
525  int len = POSDATALEN(tsv, arrin + i) * sizeof(WordEntryPos)
526  + sizeof(uint16);
527 
528  curoff = SHORTALIGN(curoff);
529  memcpy(dataout + curoff,
530  STRPTR(tsv) + SHORTALIGN(arrin[i].pos + arrin[i].len),
531  len);
532  curoff += len;
533  }
534 
535  j++;
536  }
537 
538  /*
539  * k should now be exactly equal to indices_count. If it isn't then the
540  * caller provided us with indices outside of [0, tsv->size) range and
541  * estimation of tsout's size is wrong.
542  */
543  Assert(k == indices_count);
544 
545  SET_VARSIZE(tsout, CALCDATASIZE(tsout->size, curoff));
546  return tsout;
547 }
548 
549 /*
550  * Delete given lexeme from tsvector.
551  * Implementation of user-level ts_delete(tsvector, text).
552  */
553 Datum
555 {
556  TSVector tsin = PG_GETARG_TSVECTOR(0),
557  tsout;
558  text *tlexeme = PG_GETARG_TEXT_PP(1);
559  char *lexeme = VARDATA_ANY(tlexeme);
560  int lexeme_len = VARSIZE_ANY_EXHDR(tlexeme),
561  skip_index;
562 
563  if ((skip_index = tsvector_bsearch(tsin, lexeme, lexeme_len)) == -1)
564  PG_RETURN_POINTER(tsin);
565 
566  tsout = tsvector_delete_by_indices(tsin, &skip_index, 1);
567 
568  PG_FREE_IF_COPY(tsin, 0);
569  PG_FREE_IF_COPY(tlexeme, 1);
570  PG_RETURN_POINTER(tsout);
571 }
572 
573 /*
574  * Delete given array of lexemes from tsvector.
575  * Implementation of user-level ts_delete(tsvector, text[]).
576  */
577 Datum
579 {
580  TSVector tsin = PG_GETARG_TSVECTOR(0),
581  tsout;
582  ArrayType *lexemes = PG_GETARG_ARRAYTYPE_P(1);
583  int i,
584  nlex,
585  skip_count,
586  *skip_indices;
587  Datum *dlexemes;
588  bool *nulls;
589 
590  deconstruct_array_builtin(lexemes, TEXTOID, &dlexemes, &nulls, &nlex);
591 
592  /*
593  * In typical use case array of lexemes to delete is relatively small. So
594  * here we optimize things for that scenario: iterate through lexarr
595  * performing binary search of each lexeme from lexarr in tsvector.
596  */
597  skip_indices = palloc0(nlex * sizeof(int));
598  for (i = skip_count = 0; i < nlex; i++)
599  {
600  char *lex;
601  int lex_len,
602  lex_pos;
603 
604  /* Ignore null array elements, they surely don't match */
605  if (nulls[i])
606  continue;
607 
608  lex = VARDATA(dlexemes[i]);
609  lex_len = VARSIZE(dlexemes[i]) - VARHDRSZ;
610  lex_pos = tsvector_bsearch(tsin, lex, lex_len);
611 
612  if (lex_pos >= 0)
613  skip_indices[skip_count++] = lex_pos;
614  }
615 
616  tsout = tsvector_delete_by_indices(tsin, skip_indices, skip_count);
617 
618  pfree(skip_indices);
619  PG_FREE_IF_COPY(tsin, 0);
620  PG_FREE_IF_COPY(lexemes, 1);
621 
622  PG_RETURN_POINTER(tsout);
623 }
624 
625 /*
626  * Expand tsvector as table with following columns:
627  * lexeme: lexeme text
628  * positions: integer array of lexeme positions
629  * weights: char array of weights corresponding to positions
630  */
631 Datum
633 {
634  FuncCallContext *funcctx;
635  TSVector tsin;
636 
637  if (SRF_IS_FIRSTCALL())
638  {
639  MemoryContext oldcontext;
640  TupleDesc tupdesc;
641 
642  funcctx = SRF_FIRSTCALL_INIT();
643  oldcontext = MemoryContextSwitchTo(funcctx->multi_call_memory_ctx);
644 
645  tupdesc = CreateTemplateTupleDesc(3);
646  TupleDescInitEntry(tupdesc, (AttrNumber) 1, "lexeme",
647  TEXTOID, -1, 0);
648  TupleDescInitEntry(tupdesc, (AttrNumber) 2, "positions",
649  INT2ARRAYOID, -1, 0);
650  TupleDescInitEntry(tupdesc, (AttrNumber) 3, "weights",
651  TEXTARRAYOID, -1, 0);
652  if (get_call_result_type(fcinfo, NULL, &tupdesc) != TYPEFUNC_COMPOSITE)
653  elog(ERROR, "return type must be a row type");
654  funcctx->tuple_desc = tupdesc;
655 
656  funcctx->user_fctx = PG_GETARG_TSVECTOR_COPY(0);
657 
658  MemoryContextSwitchTo(oldcontext);
659  }
660 
661  funcctx = SRF_PERCALL_SETUP();
662  tsin = (TSVector) funcctx->user_fctx;
663 
664  if (funcctx->call_cntr < tsin->size)
665  {
666  WordEntry *arrin = ARRPTR(tsin);
667  char *data = STRPTR(tsin);
668  HeapTuple tuple;
669  int j,
670  i = funcctx->call_cntr;
671  bool nulls[] = {false, false, false};
672  Datum values[3];
673 
674  values[0] = PointerGetDatum(cstring_to_text_with_len(data + arrin[i].pos, arrin[i].len));
675 
676  if (arrin[i].haspos)
677  {
678  WordEntryPosVector *posv;
679  Datum *positions;
680  Datum *weights;
681  char weight;
682 
683  /*
684  * Internally tsvector stores position and weight in the same
685  * uint16 (2 bits for weight, 14 for position). Here we extract
686  * that in two separate arrays.
687  */
688  posv = _POSVECPTR(tsin, arrin + i);
689  positions = palloc(posv->npos * sizeof(Datum));
690  weights = palloc(posv->npos * sizeof(Datum));
691  for (j = 0; j < posv->npos; j++)
692  {
693  positions[j] = Int16GetDatum(WEP_GETPOS(posv->pos[j]));
694  weight = 'D' - WEP_GETWEIGHT(posv->pos[j]);
696  1));
697  }
698 
699  values[1] = PointerGetDatum(construct_array_builtin(positions, posv->npos, INT2OID));
701  }
702  else
703  {
704  nulls[1] = nulls[2] = true;
705  }
706 
707  tuple = heap_form_tuple(funcctx->tuple_desc, values, nulls);
708  SRF_RETURN_NEXT(funcctx, HeapTupleGetDatum(tuple));
709  }
710  else
711  {
712  SRF_RETURN_DONE(funcctx);
713  }
714 }
715 
716 /*
717  * Convert tsvector to array of lexemes.
718  */
719 Datum
721 {
722  TSVector tsin = PG_GETARG_TSVECTOR(0);
723  WordEntry *arrin = ARRPTR(tsin);
724  Datum *elements;
725  int i;
726  ArrayType *array;
727 
728  elements = palloc(tsin->size * sizeof(Datum));
729 
730  for (i = 0; i < tsin->size; i++)
731  {
732  elements[i] = PointerGetDatum(cstring_to_text_with_len(STRPTR(tsin) + arrin[i].pos,
733  arrin[i].len));
734  }
735 
736  array = construct_array_builtin(elements, tsin->size, TEXTOID);
737 
738  pfree(elements);
739  PG_FREE_IF_COPY(tsin, 0);
740  PG_RETURN_POINTER(array);
741 }
742 
743 /*
744  * Build tsvector from array of lexemes.
745  */
746 Datum
748 {
750  TSVector tsout;
751  Datum *dlexemes;
752  WordEntry *arrout;
753  bool *nulls;
754  int nitems,
755  i,
756  tslen,
757  datalen = 0;
758  char *cur;
759 
760  deconstruct_array_builtin(v, TEXTOID, &dlexemes, &nulls, &nitems);
761 
762  /*
763  * Reject nulls and zero length strings (maybe we should just ignore them,
764  * instead?)
765  */
766  for (i = 0; i < nitems; i++)
767  {
768  if (nulls[i])
769  ereport(ERROR,
770  (errcode(ERRCODE_NULL_VALUE_NOT_ALLOWED),
771  errmsg("lexeme array may not contain nulls")));
772 
773  if (VARSIZE(dlexemes[i]) - VARHDRSZ == 0)
774  ereport(ERROR,
775  (errcode(ERRCODE_ZERO_LENGTH_CHARACTER_STRING),
776  errmsg("lexeme array may not contain empty strings")));
777  }
778 
779  /* Sort and de-dup, because this is required for a valid tsvector. */
780  if (nitems > 1)
781  {
782  qsort(dlexemes, nitems, sizeof(Datum), compare_text_lexemes);
783  nitems = qunique(dlexemes, nitems, sizeof(Datum),
785  }
786 
787  /* Calculate space needed for surviving lexemes. */
788  for (i = 0; i < nitems; i++)
789  datalen += VARSIZE(dlexemes[i]) - VARHDRSZ;
790  tslen = CALCDATASIZE(nitems, datalen);
791 
792  /* Allocate and fill tsvector. */
793  tsout = (TSVector) palloc0(tslen);
794  SET_VARSIZE(tsout, tslen);
795  tsout->size = nitems;
796 
797  arrout = ARRPTR(tsout);
798  cur = STRPTR(tsout);
799  for (i = 0; i < nitems; i++)
800  {
801  char *lex = VARDATA(dlexemes[i]);
802  int lex_len = VARSIZE(dlexemes[i]) - VARHDRSZ;
803 
804  memcpy(cur, lex, lex_len);
805  arrout[i].haspos = 0;
806  arrout[i].len = lex_len;
807  arrout[i].pos = cur - STRPTR(tsout);
808  cur += lex_len;
809  }
810 
811  PG_FREE_IF_COPY(v, 0);
812  PG_RETURN_POINTER(tsout);
813 }
814 
815 /*
816  * ts_filter(): keep only lexemes with given weights in tsvector.
817  */
818 Datum
820 {
821  TSVector tsin = PG_GETARG_TSVECTOR(0),
822  tsout;
824  WordEntry *arrin = ARRPTR(tsin),
825  *arrout;
826  char *datain = STRPTR(tsin),
827  *dataout;
828  Datum *dweights;
829  bool *nulls;
830  int nweights;
831  int i,
832  j;
833  int cur_pos = 0;
834  char mask = 0;
835 
836  deconstruct_array_builtin(weights, CHAROID, &dweights, &nulls, &nweights);
837 
838  for (i = 0; i < nweights; i++)
839  {
840  char char_weight;
841 
842  if (nulls[i])
843  ereport(ERROR,
844  (errcode(ERRCODE_NULL_VALUE_NOT_ALLOWED),
845  errmsg("weight array may not contain nulls")));
846 
847  char_weight = DatumGetChar(dweights[i]);
848  switch (char_weight)
849  {
850  case 'A':
851  case 'a':
852  mask = mask | 8;
853  break;
854  case 'B':
855  case 'b':
856  mask = mask | 4;
857  break;
858  case 'C':
859  case 'c':
860  mask = mask | 2;
861  break;
862  case 'D':
863  case 'd':
864  mask = mask | 1;
865  break;
866  default:
867  ereport(ERROR,
868  (errcode(ERRCODE_INVALID_PARAMETER_VALUE),
869  errmsg("unrecognized weight: \"%c\"", char_weight)));
870  }
871  }
872 
873  tsout = (TSVector) palloc0(VARSIZE(tsin));
874  tsout->size = tsin->size;
875  arrout = ARRPTR(tsout);
876  dataout = STRPTR(tsout);
877 
878  for (i = j = 0; i < tsin->size; i++)
879  {
880  WordEntryPosVector *posvin,
881  *posvout;
882  int npos = 0;
883  int k;
884 
885  if (!arrin[i].haspos)
886  continue;
887 
888  posvin = _POSVECPTR(tsin, arrin + i);
889  posvout = (WordEntryPosVector *)
890  (dataout + SHORTALIGN(cur_pos + arrin[i].len));
891 
892  for (k = 0; k < posvin->npos; k++)
893  {
894  if (mask & (1 << WEP_GETWEIGHT(posvin->pos[k])))
895  posvout->pos[npos++] = posvin->pos[k];
896  }
897 
898  /* if no satisfactory positions found, skip lexeme */
899  if (!npos)
900  continue;
901 
902  arrout[j].haspos = true;
903  arrout[j].len = arrin[i].len;
904  arrout[j].pos = cur_pos;
905 
906  memcpy(dataout + cur_pos, datain + arrin[i].pos, arrin[i].len);
907  posvout->npos = npos;
908  cur_pos += SHORTALIGN(arrin[i].len);
909  cur_pos += POSDATALEN(tsout, arrout + j) * sizeof(WordEntryPos) +
910  sizeof(uint16);
911  j++;
912  }
913 
914  tsout->size = j;
915  if (dataout != STRPTR(tsout))
916  memmove(STRPTR(tsout), dataout, cur_pos);
917 
918  SET_VARSIZE(tsout, CALCDATASIZE(tsout->size, cur_pos));
919 
920  PG_FREE_IF_COPY(tsin, 0);
921  PG_RETURN_POINTER(tsout);
922 }
923 
924 Datum
926 {
927  TSVector in1 = PG_GETARG_TSVECTOR(0);
928  TSVector in2 = PG_GETARG_TSVECTOR(1);
929  TSVector out;
930  WordEntry *ptr;
931  WordEntry *ptr1,
932  *ptr2;
933  WordEntryPos *p;
934  int maxpos = 0,
935  i,
936  j,
937  i1,
938  i2,
939  dataoff,
940  output_bytes,
941  output_size;
942  char *data,
943  *data1,
944  *data2;
945 
946  /* Get max position in in1; we'll need this to offset in2's positions */
947  ptr = ARRPTR(in1);
948  i = in1->size;
949  while (i--)
950  {
951  if ((j = POSDATALEN(in1, ptr)) != 0)
952  {
953  p = POSDATAPTR(in1, ptr);
954  while (j--)
955  {
956  if (WEP_GETPOS(*p) > maxpos)
957  maxpos = WEP_GETPOS(*p);
958  p++;
959  }
960  }
961  ptr++;
962  }
963 
964  ptr1 = ARRPTR(in1);
965  ptr2 = ARRPTR(in2);
966  data1 = STRPTR(in1);
967  data2 = STRPTR(in2);
968  i1 = in1->size;
969  i2 = in2->size;
970 
971  /*
972  * Conservative estimate of space needed. We might need all the data in
973  * both inputs, and conceivably add a pad byte before position data for
974  * each item where there was none before.
975  */
976  output_bytes = VARSIZE(in1) + VARSIZE(in2) + i1 + i2;
977 
978  out = (TSVector) palloc0(output_bytes);
979  SET_VARSIZE(out, output_bytes);
980 
981  /*
982  * We must make out->size valid so that STRPTR(out) is sensible. We'll
983  * collapse out any unused space at the end.
984  */
985  out->size = in1->size + in2->size;
986 
987  ptr = ARRPTR(out);
988  data = STRPTR(out);
989  dataoff = 0;
990  while (i1 && i2)
991  {
992  int cmp = compareEntry(data1, ptr1, data2, ptr2);
993 
994  if (cmp < 0)
995  { /* in1 first */
996  ptr->haspos = ptr1->haspos;
997  ptr->len = ptr1->len;
998  memcpy(data + dataoff, data1 + ptr1->pos, ptr1->len);
999  ptr->pos = dataoff;
1000  dataoff += ptr1->len;
1001  if (ptr->haspos)
1002  {
1003  dataoff = SHORTALIGN(dataoff);
1004  memcpy(data + dataoff, _POSVECPTR(in1, ptr1), POSDATALEN(in1, ptr1) * sizeof(WordEntryPos) + sizeof(uint16));
1005  dataoff += POSDATALEN(in1, ptr1) * sizeof(WordEntryPos) + sizeof(uint16);
1006  }
1007 
1008  ptr++;
1009  ptr1++;
1010  i1--;
1011  }
1012  else if (cmp > 0)
1013  { /* in2 first */
1014  ptr->haspos = ptr2->haspos;
1015  ptr->len = ptr2->len;
1016  memcpy(data + dataoff, data2 + ptr2->pos, ptr2->len);
1017  ptr->pos = dataoff;
1018  dataoff += ptr2->len;
1019  if (ptr->haspos)
1020  {
1021  int addlen = add_pos(in2, ptr2, out, ptr, maxpos);
1022 
1023  if (addlen == 0)
1024  ptr->haspos = 0;
1025  else
1026  {
1027  dataoff = SHORTALIGN(dataoff);
1028  dataoff += addlen * sizeof(WordEntryPos) + sizeof(uint16);
1029  }
1030  }
1031 
1032  ptr++;
1033  ptr2++;
1034  i2--;
1035  }
1036  else
1037  {
1038  ptr->haspos = ptr1->haspos | ptr2->haspos;
1039  ptr->len = ptr1->len;
1040  memcpy(data + dataoff, data1 + ptr1->pos, ptr1->len);
1041  ptr->pos = dataoff;
1042  dataoff += ptr1->len;
1043  if (ptr->haspos)
1044  {
1045  if (ptr1->haspos)
1046  {
1047  dataoff = SHORTALIGN(dataoff);
1048  memcpy(data + dataoff, _POSVECPTR(in1, ptr1), POSDATALEN(in1, ptr1) * sizeof(WordEntryPos) + sizeof(uint16));
1049  dataoff += POSDATALEN(in1, ptr1) * sizeof(WordEntryPos) + sizeof(uint16);
1050  if (ptr2->haspos)
1051  dataoff += add_pos(in2, ptr2, out, ptr, maxpos) * sizeof(WordEntryPos);
1052  }
1053  else /* must have ptr2->haspos */
1054  {
1055  int addlen = add_pos(in2, ptr2, out, ptr, maxpos);
1056 
1057  if (addlen == 0)
1058  ptr->haspos = 0;
1059  else
1060  {
1061  dataoff = SHORTALIGN(dataoff);
1062  dataoff += addlen * sizeof(WordEntryPos) + sizeof(uint16);
1063  }
1064  }
1065  }
1066 
1067  ptr++;
1068  ptr1++;
1069  ptr2++;
1070  i1--;
1071  i2--;
1072  }
1073  }
1074 
1075  while (i1)
1076  {
1077  ptr->haspos = ptr1->haspos;
1078  ptr->len = ptr1->len;
1079  memcpy(data + dataoff, data1 + ptr1->pos, ptr1->len);
1080  ptr->pos = dataoff;
1081  dataoff += ptr1->len;
1082  if (ptr->haspos)
1083  {
1084  dataoff = SHORTALIGN(dataoff);
1085  memcpy(data + dataoff, _POSVECPTR(in1, ptr1), POSDATALEN(in1, ptr1) * sizeof(WordEntryPos) + sizeof(uint16));
1086  dataoff += POSDATALEN(in1, ptr1) * sizeof(WordEntryPos) + sizeof(uint16);
1087  }
1088 
1089  ptr++;
1090  ptr1++;
1091  i1--;
1092  }
1093 
1094  while (i2)
1095  {
1096  ptr->haspos = ptr2->haspos;
1097  ptr->len = ptr2->len;
1098  memcpy(data + dataoff, data2 + ptr2->pos, ptr2->len);
1099  ptr->pos = dataoff;
1100  dataoff += ptr2->len;
1101  if (ptr->haspos)
1102  {
1103  int addlen = add_pos(in2, ptr2, out, ptr, maxpos);
1104 
1105  if (addlen == 0)
1106  ptr->haspos = 0;
1107  else
1108  {
1109  dataoff = SHORTALIGN(dataoff);
1110  dataoff += addlen * sizeof(WordEntryPos) + sizeof(uint16);
1111  }
1112  }
1113 
1114  ptr++;
1115  ptr2++;
1116  i2--;
1117  }
1118 
1119  /*
1120  * Instead of checking each offset individually, we check for overflow of
1121  * pos fields once at the end.
1122  */
1123  if (dataoff > MAXSTRPOS)
1124  ereport(ERROR,
1125  (errcode(ERRCODE_PROGRAM_LIMIT_EXCEEDED),
1126  errmsg("string is too long for tsvector (%d bytes, max %d bytes)", dataoff, MAXSTRPOS)));
1127 
1128  /*
1129  * Adjust sizes (asserting that we didn't overrun the original estimates)
1130  * and collapse out any unused array entries.
1131  */
1132  output_size = ptr - ARRPTR(out);
1133  Assert(output_size <= out->size);
1134  out->size = output_size;
1135  if (data != STRPTR(out))
1136  memmove(STRPTR(out), data, dataoff);
1137  output_bytes = CALCDATASIZE(out->size, dataoff);
1138  Assert(output_bytes <= VARSIZE(out));
1139  SET_VARSIZE(out, output_bytes);
1140 
1141  PG_FREE_IF_COPY(in1, 0);
1142  PG_FREE_IF_COPY(in2, 1);
1143  PG_RETURN_POINTER(out);
1144 }
1145 
1146 /*
1147  * Compare two strings by tsvector rules.
1148  *
1149  * if prefix = true then it returns zero value iff b has prefix a
1150  */
1151 int32
1152 tsCompareString(char *a, int lena, char *b, int lenb, bool prefix)
1153 {
1154  int cmp;
1155 
1156  if (lena == 0)
1157  {
1158  if (prefix)
1159  cmp = 0; /* empty string is prefix of anything */
1160  else
1161  cmp = (lenb > 0) ? -1 : 0;
1162  }
1163  else if (lenb == 0)
1164  {
1165  cmp = (lena > 0) ? 1 : 0;
1166  }
1167  else
1168  {
1169  cmp = memcmp(a, b, Min((unsigned int) lena, (unsigned int) lenb));
1170 
1171  if (prefix)
1172  {
1173  if (cmp == 0 && lena > lenb)
1174  cmp = 1; /* a is longer, so not a prefix of b */
1175  }
1176  else if (cmp == 0 && lena != lenb)
1177  {
1178  cmp = (lena < lenb) ? -1 : 1;
1179  }
1180  }
1181 
1182  return cmp;
1183 }
1184 
1185 /*
1186  * Check weight info or/and fill 'data' with the required positions
1187  */
1188 static TSTernaryValue
1191 {
1192  TSTernaryValue result = TS_NO;
1193 
1194  Assert(data == NULL || data->npos == 0);
1195 
1196  if (entry->haspos)
1197  {
1198  WordEntryPosVector *posvec;
1199 
1200  /*
1201  * We can't use the _POSVECPTR macro here because the pointer to the
1202  * tsvector's lexeme storage is already contained in chkval->values.
1203  */
1204  posvec = (WordEntryPosVector *)
1205  (chkval->values + SHORTALIGN(entry->pos + entry->len));
1206 
1207  if (val->weight && data)
1208  {
1209  WordEntryPos *posvec_iter = posvec->pos;
1210  WordEntryPos *dptr;
1211 
1212  /*
1213  * Filter position information by weights
1214  */
1215  dptr = data->pos = palloc(sizeof(WordEntryPos) * posvec->npos);
1216  data->allocated = true;
1217 
1218  /* Is there a position with a matching weight? */
1219  while (posvec_iter < posvec->pos + posvec->npos)
1220  {
1221  /* If true, append this position to the data->pos */
1222  if (val->weight & (1 << WEP_GETWEIGHT(*posvec_iter)))
1223  {
1224  *dptr = WEP_GETPOS(*posvec_iter);
1225  dptr++;
1226  }
1227 
1228  posvec_iter++;
1229  }
1230 
1231  data->npos = dptr - data->pos;
1232 
1233  if (data->npos > 0)
1234  result = TS_YES;
1235  else
1236  {
1237  pfree(data->pos);
1238  data->pos = NULL;
1239  data->allocated = false;
1240  }
1241  }
1242  else if (val->weight)
1243  {
1244  WordEntryPos *posvec_iter = posvec->pos;
1245 
1246  /* Is there a position with a matching weight? */
1247  while (posvec_iter < posvec->pos + posvec->npos)
1248  {
1249  if (val->weight & (1 << WEP_GETWEIGHT(*posvec_iter)))
1250  {
1251  result = TS_YES;
1252  break; /* no need to go further */
1253  }
1254 
1255  posvec_iter++;
1256  }
1257  }
1258  else if (data)
1259  {
1260  data->npos = posvec->npos;
1261  data->pos = posvec->pos;
1262  data->allocated = false;
1263  result = TS_YES;
1264  }
1265  else
1266  {
1267  /* simplest case: no weight check, positions not needed */
1268  result = TS_YES;
1269  }
1270  }
1271  else
1272  {
1273  /*
1274  * Position info is lacking, so if the caller requires it, we can only
1275  * say that maybe there is a match.
1276  *
1277  * Notice, however, that we *don't* check val->weight here.
1278  * Historically, stripped tsvectors are considered to match queries
1279  * whether or not the query has a weight restriction; that's a little
1280  * dubious but we'll preserve the behavior.
1281  */
1282  if (data)
1283  result = TS_MAYBE;
1284  else
1285  result = TS_YES;
1286  }
1287 
1288  return result;
1289 }
1290 
1291 /*
1292  * TS_execute callback for matching a tsquery operand to plain tsvector data
1293  */
1294 static TSTernaryValue
1296 {
1297  CHKVAL *chkval = (CHKVAL *) checkval;
1298  WordEntry *StopLow = chkval->arrb;
1299  WordEntry *StopHigh = chkval->arre;
1300  WordEntry *StopMiddle = StopHigh;
1302 
1303  /* Loop invariant: StopLow <= val < StopHigh */
1304  while (StopLow < StopHigh)
1305  {
1306  int difference;
1307 
1308  StopMiddle = StopLow + (StopHigh - StopLow) / 2;
1309  difference = tsCompareString(chkval->operand + val->distance,
1310  val->length,
1311  chkval->values + StopMiddle->pos,
1312  StopMiddle->len,
1313  false);
1314 
1315  if (difference == 0)
1316  {
1317  /* Check weight info & fill 'data' with positions */
1318  res = checkclass_str(chkval, StopMiddle, val, data);
1319  break;
1320  }
1321  else if (difference > 0)
1322  StopLow = StopMiddle + 1;
1323  else
1324  StopHigh = StopMiddle;
1325  }
1326 
1327  /*
1328  * If it's a prefix search, we should also consider lexemes that the
1329  * search term is a prefix of (which will necessarily immediately follow
1330  * the place we found in the above loop). But we can skip them if there
1331  * was a definite match on the exact term AND the caller doesn't need
1332  * position info.
1333  */
1334  if (val->prefix && (res != TS_YES || data))
1335  {
1336  WordEntryPos *allpos = NULL;
1337  int npos = 0,
1338  totalpos = 0;
1339 
1340  /* adjust start position for corner case */
1341  if (StopLow >= StopHigh)
1342  StopMiddle = StopHigh;
1343 
1344  /* we don't try to re-use any data from the initial match */
1345  if (data)
1346  {
1347  if (data->allocated)
1348  pfree(data->pos);
1349  data->pos = NULL;
1350  data->allocated = false;
1351  data->npos = 0;
1352  }
1353  res = TS_NO;
1354 
1355  while ((res != TS_YES || data) &&
1356  StopMiddle < chkval->arre &&
1357  tsCompareString(chkval->operand + val->distance,
1358  val->length,
1359  chkval->values + StopMiddle->pos,
1360  StopMiddle->len,
1361  true) == 0)
1362  {
1363  TSTernaryValue subres;
1364 
1365  subres = checkclass_str(chkval, StopMiddle, val, data);
1366 
1367  if (subres != TS_NO)
1368  {
1369  if (data)
1370  {
1371  /*
1372  * We need to join position information
1373  */
1374  if (subres == TS_MAYBE)
1375  {
1376  /*
1377  * No position info for this match, so we must report
1378  * MAYBE overall.
1379  */
1380  res = TS_MAYBE;
1381  /* forget any previous positions */
1382  npos = 0;
1383  /* don't leak storage */
1384  if (allpos)
1385  pfree(allpos);
1386  break;
1387  }
1388 
1389  while (npos + data->npos > totalpos)
1390  {
1391  if (totalpos == 0)
1392  {
1393  totalpos = 256;
1394  allpos = palloc(sizeof(WordEntryPos) * totalpos);
1395  }
1396  else
1397  {
1398  totalpos *= 2;
1399  allpos = repalloc(allpos, sizeof(WordEntryPos) * totalpos);
1400  }
1401  }
1402 
1403  memcpy(allpos + npos, data->pos, sizeof(WordEntryPos) * data->npos);
1404  npos += data->npos;
1405 
1406  /* don't leak storage from individual matches */
1407  if (data->allocated)
1408  pfree(data->pos);
1409  data->pos = NULL;
1410  data->allocated = false;
1411  /* it's important to reset data->npos before next loop */
1412  data->npos = 0;
1413  }
1414  else
1415  {
1416  /* Don't need positions, just handle YES/MAYBE */
1417  if (subres == TS_YES || res == TS_NO)
1418  res = subres;
1419  }
1420  }
1421 
1422  StopMiddle++;
1423  }
1424 
1425  if (data && npos > 0)
1426  {
1427  /* Sort and make unique array of found positions */
1428  data->pos = allpos;
1429  qsort(data->pos, npos, sizeof(WordEntryPos), compareWordEntryPos);
1430  data->npos = qunique(data->pos, npos, sizeof(WordEntryPos),
1432  data->allocated = true;
1433  res = TS_YES;
1434  }
1435  }
1436 
1437  return res;
1438 }
1439 
1440 /*
1441  * Compute output position list for a tsquery operator in phrase mode.
1442  *
1443  * Merge the position lists in Ldata and Rdata as specified by "emit",
1444  * returning the result list into *data. The input position lists must be
1445  * sorted and unique, and the output will be as well.
1446  *
1447  * data: pointer to initially-all-zeroes output struct, or NULL
1448  * Ldata, Rdata: input position lists
1449  * emit: bitmask of TSPO_XXX flags
1450  * Loffset: offset to be added to Ldata positions before comparing/outputting
1451  * Roffset: offset to be added to Rdata positions before comparing/outputting
1452  * max_npos: maximum possible required size of output position array
1453  *
1454  * Loffset and Roffset should not be negative, else we risk trying to output
1455  * negative positions, which won't fit into WordEntryPos.
1456  *
1457  * The result is boolean (TS_YES or TS_NO), but for the caller's convenience
1458  * we return it as TSTernaryValue.
1459  *
1460  * Returns TS_YES if any positions were emitted to *data; or if data is NULL,
1461  * returns TS_YES if any positions would have been emitted.
1462  */
1463 #define TSPO_L_ONLY 0x01 /* emit positions appearing only in L */
1464 #define TSPO_R_ONLY 0x02 /* emit positions appearing only in R */
1465 #define TSPO_BOTH 0x04 /* emit positions appearing in both L&R */
1466 
1467 static TSTernaryValue
1469  ExecPhraseData *Ldata,
1470  ExecPhraseData *Rdata,
1471  int emit,
1472  int Loffset,
1473  int Roffset,
1474  int max_npos)
1475 {
1476  int Lindex,
1477  Rindex;
1478 
1479  /* Loop until both inputs are exhausted */
1480  Lindex = Rindex = 0;
1481  while (Lindex < Ldata->npos || Rindex < Rdata->npos)
1482  {
1483  int Lpos,
1484  Rpos;
1485  int output_pos = 0;
1486 
1487  /*
1488  * Fetch current values to compare. WEP_GETPOS() is needed because
1489  * ExecPhraseData->data can point to a tsvector's WordEntryPosVector.
1490  */
1491  if (Lindex < Ldata->npos)
1492  Lpos = WEP_GETPOS(Ldata->pos[Lindex]) + Loffset;
1493  else
1494  {
1495  /* L array exhausted, so we're done if R_ONLY isn't set */
1496  if (!(emit & TSPO_R_ONLY))
1497  break;
1498  Lpos = INT_MAX;
1499  }
1500  if (Rindex < Rdata->npos)
1501  Rpos = WEP_GETPOS(Rdata->pos[Rindex]) + Roffset;
1502  else
1503  {
1504  /* R array exhausted, so we're done if L_ONLY isn't set */
1505  if (!(emit & TSPO_L_ONLY))
1506  break;
1507  Rpos = INT_MAX;
1508  }
1509 
1510  /* Merge-join the two input lists */
1511  if (Lpos < Rpos)
1512  {
1513  /* Lpos is not matched in Rdata, should we output it? */
1514  if (emit & TSPO_L_ONLY)
1515  output_pos = Lpos;
1516  Lindex++;
1517  }
1518  else if (Lpos == Rpos)
1519  {
1520  /* Lpos and Rpos match ... should we output it? */
1521  if (emit & TSPO_BOTH)
1522  output_pos = Rpos;
1523  Lindex++;
1524  Rindex++;
1525  }
1526  else /* Lpos > Rpos */
1527  {
1528  /* Rpos is not matched in Ldata, should we output it? */
1529  if (emit & TSPO_R_ONLY)
1530  output_pos = Rpos;
1531  Rindex++;
1532  }
1533 
1534  if (output_pos > 0)
1535  {
1536  if (data)
1537  {
1538  /* Store position, first allocating output array if needed */
1539  if (data->pos == NULL)
1540  {
1541  data->pos = (WordEntryPos *)
1542  palloc(max_npos * sizeof(WordEntryPos));
1543  data->allocated = true;
1544  }
1545  data->pos[data->npos++] = output_pos;
1546  }
1547  else
1548  {
1549  /*
1550  * Exact positions not needed, so return TS_YES as soon as we
1551  * know there is at least one.
1552  */
1553  return TS_YES;
1554  }
1555  }
1556  }
1557 
1558  if (data && data->npos > 0)
1559  {
1560  /* Let's assert we didn't overrun the array */
1561  Assert(data->npos <= max_npos);
1562  return TS_YES;
1563  }
1564  return TS_NO;
1565 }
1566 
1567 /*
1568  * Execute tsquery at or below an OP_PHRASE operator.
1569  *
1570  * This handles tsquery execution at recursion levels where we need to care
1571  * about match locations.
1572  *
1573  * In addition to the same arguments used for TS_execute, the caller may pass
1574  * a preinitialized-to-zeroes ExecPhraseData struct, to be filled with lexeme
1575  * match position info on success. data == NULL if no position data need be
1576  * returned.
1577  * Note: the function assumes data != NULL for operators other than OP_PHRASE.
1578  * This is OK because an outside call always starts from an OP_PHRASE node,
1579  * and all internal recursion cases pass data != NULL.
1580  *
1581  * The detailed semantics of the match data, given that the function returned
1582  * TS_YES (successful match), are:
1583  *
1584  * npos > 0, negate = false:
1585  * query is matched at specified position(s) (and only those positions)
1586  * npos > 0, negate = true:
1587  * query is matched at all positions *except* specified position(s)
1588  * npos = 0, negate = true:
1589  * query is matched at all positions
1590  * npos = 0, negate = false:
1591  * disallowed (this should result in TS_NO or TS_MAYBE, as appropriate)
1592  *
1593  * Successful matches also return a "width" value which is the match width in
1594  * lexemes, less one. Hence, "width" is zero for simple one-lexeme matches,
1595  * and is the sum of the phrase operator distances for phrase matches. Note
1596  * that when width > 0, the listed positions represent the ends of matches not
1597  * the starts. (This unintuitive rule is needed to avoid possibly generating
1598  * negative positions, which wouldn't fit into the WordEntryPos arrays.)
1599  *
1600  * If the TSExecuteCallback function reports that an operand is present
1601  * but fails to provide position(s) for it, we will return TS_MAYBE when
1602  * it is possible but not certain that the query is matched.
1603  *
1604  * When the function returns TS_NO or TS_MAYBE, it must return npos = 0,
1605  * negate = false (which is the state initialized by the caller); but the
1606  * "width" output in such cases is undefined.
1607  */
1608 static TSTernaryValue
1609 TS_phrase_execute(QueryItem *curitem, void *arg, uint32 flags,
1610  TSExecuteCallback chkcond,
1612 {
1613  ExecPhraseData Ldata,
1614  Rdata;
1615  TSTernaryValue lmatch,
1616  rmatch;
1617  int Loffset,
1618  Roffset,
1619  maxwidth;
1620 
1621  /* since this function recurses, it could be driven to stack overflow */
1623 
1624  /* ... and let's check for query cancel while we're at it */
1626 
1627  if (curitem->type == QI_VAL)
1628  return chkcond(arg, (QueryOperand *) curitem, data);
1629 
1630  switch (curitem->qoperator.oper)
1631  {
1632  case OP_NOT:
1633 
1634  /*
1635  * We need not touch data->width, since a NOT operation does not
1636  * change the match width.
1637  */
1638  if (flags & TS_EXEC_SKIP_NOT)
1639  {
1640  /* with SKIP_NOT, report NOT as "match everywhere" */
1641  Assert(data->npos == 0 && !data->negate);
1642  data->negate = true;
1643  return TS_YES;
1644  }
1645  switch (TS_phrase_execute(curitem + 1, arg, flags, chkcond, data))
1646  {
1647  case TS_NO:
1648  /* change "match nowhere" to "match everywhere" */
1649  Assert(data->npos == 0 && !data->negate);
1650  data->negate = true;
1651  return TS_YES;
1652  case TS_YES:
1653  if (data->npos > 0)
1654  {
1655  /* we have some positions, invert negate flag */
1656  data->negate = !data->negate;
1657  return TS_YES;
1658  }
1659  else if (data->negate)
1660  {
1661  /* change "match everywhere" to "match nowhere" */
1662  data->negate = false;
1663  return TS_NO;
1664  }
1665  /* Should not get here if result was TS_YES */
1666  Assert(false);
1667  break;
1668  case TS_MAYBE:
1669  /* match positions are, and remain, uncertain */
1670  return TS_MAYBE;
1671  }
1672  break;
1673 
1674  case OP_PHRASE:
1675  case OP_AND:
1676  memset(&Ldata, 0, sizeof(Ldata));
1677  memset(&Rdata, 0, sizeof(Rdata));
1678 
1679  lmatch = TS_phrase_execute(curitem + curitem->qoperator.left,
1680  arg, flags, chkcond, &Ldata);
1681  if (lmatch == TS_NO)
1682  return TS_NO;
1683 
1684  rmatch = TS_phrase_execute(curitem + 1,
1685  arg, flags, chkcond, &Rdata);
1686  if (rmatch == TS_NO)
1687  return TS_NO;
1688 
1689  /*
1690  * If either operand has no position information, then we can't
1691  * return reliable position data, only a MAYBE result.
1692  */
1693  if (lmatch == TS_MAYBE || rmatch == TS_MAYBE)
1694  return TS_MAYBE;
1695 
1696  if (curitem->qoperator.oper == OP_PHRASE)
1697  {
1698  /*
1699  * Compute Loffset and Roffset suitable for phrase match, and
1700  * compute overall width of whole phrase match.
1701  */
1702  Loffset = curitem->qoperator.distance + Rdata.width;
1703  Roffset = 0;
1704  if (data)
1705  data->width = curitem->qoperator.distance +
1706  Ldata.width + Rdata.width;
1707  }
1708  else
1709  {
1710  /*
1711  * For OP_AND, set output width and alignment like OP_OR (see
1712  * comment below)
1713  */
1714  maxwidth = Max(Ldata.width, Rdata.width);
1715  Loffset = maxwidth - Ldata.width;
1716  Roffset = maxwidth - Rdata.width;
1717  if (data)
1718  data->width = maxwidth;
1719  }
1720 
1721  if (Ldata.negate && Rdata.negate)
1722  {
1723  /* !L & !R: treat as !(L | R) */
1724  (void) TS_phrase_output(data, &Ldata, &Rdata,
1726  Loffset, Roffset,
1727  Ldata.npos + Rdata.npos);
1728  if (data)
1729  data->negate = true;
1730  return TS_YES;
1731  }
1732  else if (Ldata.negate)
1733  {
1734  /* !L & R */
1735  return TS_phrase_output(data, &Ldata, &Rdata,
1736  TSPO_R_ONLY,
1737  Loffset, Roffset,
1738  Rdata.npos);
1739  }
1740  else if (Rdata.negate)
1741  {
1742  /* L & !R */
1743  return TS_phrase_output(data, &Ldata, &Rdata,
1744  TSPO_L_ONLY,
1745  Loffset, Roffset,
1746  Ldata.npos);
1747  }
1748  else
1749  {
1750  /* straight AND */
1751  return TS_phrase_output(data, &Ldata, &Rdata,
1752  TSPO_BOTH,
1753  Loffset, Roffset,
1754  Min(Ldata.npos, Rdata.npos));
1755  }
1756 
1757  case OP_OR:
1758  memset(&Ldata, 0, sizeof(Ldata));
1759  memset(&Rdata, 0, sizeof(Rdata));
1760 
1761  lmatch = TS_phrase_execute(curitem + curitem->qoperator.left,
1762  arg, flags, chkcond, &Ldata);
1763  rmatch = TS_phrase_execute(curitem + 1,
1764  arg, flags, chkcond, &Rdata);
1765 
1766  if (lmatch == TS_NO && rmatch == TS_NO)
1767  return TS_NO;
1768 
1769  /*
1770  * If either operand has no position information, then we can't
1771  * return reliable position data, only a MAYBE result.
1772  */
1773  if (lmatch == TS_MAYBE || rmatch == TS_MAYBE)
1774  return TS_MAYBE;
1775 
1776  /*
1777  * Cope with undefined output width from failed submatch. (This
1778  * takes less code than trying to ensure that all failure returns
1779  * set data->width to zero.)
1780  */
1781  if (lmatch == TS_NO)
1782  Ldata.width = 0;
1783  if (rmatch == TS_NO)
1784  Rdata.width = 0;
1785 
1786  /*
1787  * For OP_AND and OP_OR, report the width of the wider of the two
1788  * inputs, and align the narrower input's positions to the right
1789  * end of that width. This rule deals at least somewhat
1790  * reasonably with cases like "x <-> (y | z <-> q)".
1791  */
1792  maxwidth = Max(Ldata.width, Rdata.width);
1793  Loffset = maxwidth - Ldata.width;
1794  Roffset = maxwidth - Rdata.width;
1795  data->width = maxwidth;
1796 
1797  if (Ldata.negate && Rdata.negate)
1798  {
1799  /* !L | !R: treat as !(L & R) */
1800  (void) TS_phrase_output(data, &Ldata, &Rdata,
1801  TSPO_BOTH,
1802  Loffset, Roffset,
1803  Min(Ldata.npos, Rdata.npos));
1804  data->negate = true;
1805  return TS_YES;
1806  }
1807  else if (Ldata.negate)
1808  {
1809  /* !L | R: treat as !(L & !R) */
1810  (void) TS_phrase_output(data, &Ldata, &Rdata,
1811  TSPO_L_ONLY,
1812  Loffset, Roffset,
1813  Ldata.npos);
1814  data->negate = true;
1815  return TS_YES;
1816  }
1817  else if (Rdata.negate)
1818  {
1819  /* L | !R: treat as !(!L & R) */
1820  (void) TS_phrase_output(data, &Ldata, &Rdata,
1821  TSPO_R_ONLY,
1822  Loffset, Roffset,
1823  Rdata.npos);
1824  data->negate = true;
1825  return TS_YES;
1826  }
1827  else
1828  {
1829  /* straight OR */
1830  return TS_phrase_output(data, &Ldata, &Rdata,
1832  Loffset, Roffset,
1833  Ldata.npos + Rdata.npos);
1834  }
1835 
1836  default:
1837  elog(ERROR, "unrecognized operator: %d", curitem->qoperator.oper);
1838  }
1839 
1840  /* not reachable, but keep compiler quiet */
1841  return TS_NO;
1842 }
1843 
1844 
1845 /*
1846  * Evaluate tsquery boolean expression.
1847  *
1848  * curitem: current tsquery item (initially, the first one)
1849  * arg: opaque value to pass through to callback function
1850  * flags: bitmask of flag bits shown in ts_utils.h
1851  * chkcond: callback function to check whether a primitive value is present
1852  */
1853 bool
1854 TS_execute(QueryItem *curitem, void *arg, uint32 flags,
1855  TSExecuteCallback chkcond)
1856 {
1857  /*
1858  * If we get TS_MAYBE from the recursion, return true. We could only see
1859  * that result if the caller passed TS_EXEC_PHRASE_NO_POS, so there's no
1860  * need to check again.
1861  */
1862  return TS_execute_recurse(curitem, arg, flags, chkcond) != TS_NO;
1863 }
1864 
1865 /*
1866  * Evaluate tsquery boolean expression.
1867  *
1868  * This is the same as TS_execute except that TS_MAYBE is returned as-is.
1869  */
1871 TS_execute_ternary(QueryItem *curitem, void *arg, uint32 flags,
1872  TSExecuteCallback chkcond)
1873 {
1874  return TS_execute_recurse(curitem, arg, flags, chkcond);
1875 }
1876 
1877 /*
1878  * TS_execute recursion for operators above any phrase operator. Here we do
1879  * not need to worry about lexeme positions. As soon as we hit an OP_PHRASE
1880  * operator, we pass it off to TS_phrase_execute which does worry.
1881  */
1882 static TSTernaryValue
1883 TS_execute_recurse(QueryItem *curitem, void *arg, uint32 flags,
1884  TSExecuteCallback chkcond)
1885 {
1886  TSTernaryValue lmatch;
1887 
1888  /* since this function recurses, it could be driven to stack overflow */
1890 
1891  /* ... and let's check for query cancel while we're at it */
1893 
1894  if (curitem->type == QI_VAL)
1895  return chkcond(arg, (QueryOperand *) curitem,
1896  NULL /* don't need position info */ );
1897 
1898  switch (curitem->qoperator.oper)
1899  {
1900  case OP_NOT:
1901  if (flags & TS_EXEC_SKIP_NOT)
1902  return TS_YES;
1903  switch (TS_execute_recurse(curitem + 1, arg, flags, chkcond))
1904  {
1905  case TS_NO:
1906  return TS_YES;
1907  case TS_YES:
1908  return TS_NO;
1909  case TS_MAYBE:
1910  return TS_MAYBE;
1911  }
1912  break;
1913 
1914  case OP_AND:
1915  lmatch = TS_execute_recurse(curitem + curitem->qoperator.left, arg,
1916  flags, chkcond);
1917  if (lmatch == TS_NO)
1918  return TS_NO;
1919  switch (TS_execute_recurse(curitem + 1, arg, flags, chkcond))
1920  {
1921  case TS_NO:
1922  return TS_NO;
1923  case TS_YES:
1924  return lmatch;
1925  case TS_MAYBE:
1926  return TS_MAYBE;
1927  }
1928  break;
1929 
1930  case OP_OR:
1931  lmatch = TS_execute_recurse(curitem + curitem->qoperator.left, arg,
1932  flags, chkcond);
1933  if (lmatch == TS_YES)
1934  return TS_YES;
1935  switch (TS_execute_recurse(curitem + 1, arg, flags, chkcond))
1936  {
1937  case TS_NO:
1938  return lmatch;
1939  case TS_YES:
1940  return TS_YES;
1941  case TS_MAYBE:
1942  return TS_MAYBE;
1943  }
1944  break;
1945 
1946  case OP_PHRASE:
1947 
1948  /*
1949  * If we get a MAYBE result, and the caller doesn't want that,
1950  * convert it to NO. It would be more consistent, perhaps, to
1951  * return the result of TS_phrase_execute() verbatim and then
1952  * convert MAYBE results at the top of the recursion. But
1953  * converting at the topmost phrase operator gives results that
1954  * are bug-compatible with the old implementation, so do it like
1955  * this for now.
1956  */
1957  switch (TS_phrase_execute(curitem, arg, flags, chkcond, NULL))
1958  {
1959  case TS_NO:
1960  return TS_NO;
1961  case TS_YES:
1962  return TS_YES;
1963  case TS_MAYBE:
1964  return (flags & TS_EXEC_PHRASE_NO_POS) ? TS_MAYBE : TS_NO;
1965  }
1966  break;
1967 
1968  default:
1969  elog(ERROR, "unrecognized operator: %d", curitem->qoperator.oper);
1970  }
1971 
1972  /* not reachable, but keep compiler quiet */
1973  return TS_NO;
1974 }
1975 
1976 /*
1977  * Evaluate tsquery and report locations of matching terms.
1978  *
1979  * This is like TS_execute except that it returns match locations not just
1980  * success/failure status. The callback function is required to provide
1981  * position data (we report failure if it doesn't).
1982  *
1983  * On successful match, the result is a List of ExecPhraseData structs, one
1984  * for each AND'ed term or phrase operator in the query. Each struct includes
1985  * a sorted array of lexeme positions matching that term. (Recall that for
1986  * phrase operators, the match includes width+1 lexemes, and the recorded
1987  * position is that of the rightmost lexeme.)
1988  *
1989  * OR subexpressions are handled by union'ing their match locations into a
1990  * single List element, which is valid since any of those locations contains
1991  * a match. However, when some of the OR'ed terms are phrase operators, we
1992  * report the maximum width of any of the OR'ed terms, making such cases
1993  * slightly imprecise in the conservative direction. (For example, if the
1994  * tsquery is "(A <-> B) | C", an occurrence of C in the data would be
1995  * reported as though it includes the lexeme to the left of C.)
1996  *
1997  * Locations of NOT subexpressions are not reported. (Obviously, there can
1998  * be no successful NOT matches at top level, or the match would have failed.
1999  * So this amounts to ignoring NOTs underneath ORs.)
2000  *
2001  * The result is NIL if no match, or if position data was not returned.
2002  *
2003  * Arguments are the same as for TS_execute, although flags is currently
2004  * vestigial since none of the defined bits are sensible here.
2005  */
2006 List *
2008  uint32 flags,
2009  TSExecuteCallback chkcond)
2010 {
2011  List *result;
2012 
2013  /* No flags supported, as yet */
2014  Assert(flags == TS_EXEC_EMPTY);
2015  if (TS_execute_locations_recurse(curitem, arg, chkcond, &result))
2016  return result;
2017  return NIL;
2018 }
2019 
2020 /*
2021  * TS_execute_locations recursion for operators above any phrase operator.
2022  * OP_PHRASE subexpressions can be passed off to TS_phrase_execute.
2023  */
2024 static bool
2026  TSExecuteCallback chkcond,
2027  List **locations)
2028 {
2029  bool lmatch,
2030  rmatch;
2031  List *llocations,
2032  *rlocations;
2034 
2035  /* since this function recurses, it could be driven to stack overflow */
2037 
2038  /* ... and let's check for query cancel while we're at it */
2040 
2041  /* Default locations result is empty */
2042  *locations = NIL;
2043 
2044  if (curitem->type == QI_VAL)
2045  {
2047  if (chkcond(arg, (QueryOperand *) curitem, data) == TS_YES)
2048  {
2049  *locations = list_make1(data);
2050  return true;
2051  }
2052  pfree(data);
2053  return false;
2054  }
2055 
2056  switch (curitem->qoperator.oper)
2057  {
2058  case OP_NOT:
2059  if (!TS_execute_locations_recurse(curitem + 1, arg, chkcond,
2060  &llocations))
2061  return true; /* we don't pass back any locations */
2062  return false;
2063 
2064  case OP_AND:
2065  if (!TS_execute_locations_recurse(curitem + curitem->qoperator.left,
2066  arg, chkcond,
2067  &llocations))
2068  return false;
2069  if (!TS_execute_locations_recurse(curitem + 1,
2070  arg, chkcond,
2071  &rlocations))
2072  return false;
2073  *locations = list_concat(llocations, rlocations);
2074  return true;
2075 
2076  case OP_OR:
2077  lmatch = TS_execute_locations_recurse(curitem + curitem->qoperator.left,
2078  arg, chkcond,
2079  &llocations);
2080  rmatch = TS_execute_locations_recurse(curitem + 1,
2081  arg, chkcond,
2082  &rlocations);
2083  if (lmatch || rmatch)
2084  {
2085  /*
2086  * We generate an AND'able location struct from each
2087  * combination of sub-matches, following the disjunctive law
2088  * (A & B) | (C & D) = (A | C) & (A | D) & (B | C) & (B | D).
2089  *
2090  * However, if either input didn't produce locations (i.e., it
2091  * failed or was a NOT), we must just return the other list.
2092  */
2093  if (llocations == NIL)
2094  *locations = rlocations;
2095  else if (rlocations == NIL)
2096  *locations = llocations;
2097  else
2098  {
2099  ListCell *ll;
2100 
2101  foreach(ll, llocations)
2102  {
2103  ExecPhraseData *ldata = (ExecPhraseData *) lfirst(ll);
2104  ListCell *lr;
2105 
2106  foreach(lr, rlocations)
2107  {
2108  ExecPhraseData *rdata = (ExecPhraseData *) lfirst(lr);
2109 
2111  (void) TS_phrase_output(data, ldata, rdata,
2113  0, 0,
2114  ldata->npos + rdata->npos);
2115  /* Report the larger width, as explained above. */
2116  data->width = Max(ldata->width, rdata->width);
2117  *locations = lappend(*locations, data);
2118  }
2119  }
2120  }
2121 
2122  return true;
2123  }
2124  return false;
2125 
2126  case OP_PHRASE:
2127  /* We can hand this off to TS_phrase_execute */
2129  if (TS_phrase_execute(curitem, arg, TS_EXEC_EMPTY, chkcond,
2130  data) == TS_YES)
2131  {
2132  if (!data->negate)
2133  *locations = list_make1(data);
2134  return true;
2135  }
2136  pfree(data);
2137  return false;
2138 
2139  default:
2140  elog(ERROR, "unrecognized operator: %d", curitem->qoperator.oper);
2141  }
2142 
2143  /* not reachable, but keep compiler quiet */
2144  return false;
2145 }
2146 
2147 /*
2148  * Detect whether a tsquery boolean expression requires any positive matches
2149  * to values shown in the tsquery.
2150  *
2151  * This is needed to know whether a GIN index search requires full index scan.
2152  * For example, 'x & !y' requires a match of x, so it's sufficient to scan
2153  * entries for x; but 'x | !y' could match rows containing neither x nor y.
2154  */
2155 bool
2157 {
2158  /* since this function recurses, it could be driven to stack overflow */
2160 
2161  if (curitem->type == QI_VAL)
2162  return true;
2163 
2164  switch (curitem->qoperator.oper)
2165  {
2166  case OP_NOT:
2167 
2168  /*
2169  * Assume there are no required matches underneath a NOT. For
2170  * some cases with nested NOTs, we could prove there's a required
2171  * match, but it seems unlikely to be worth the trouble.
2172  */
2173  return false;
2174 
2175  case OP_PHRASE:
2176 
2177  /*
2178  * Treat OP_PHRASE as OP_AND here
2179  */
2180  case OP_AND:
2181  /* If either side requires a match, we're good */
2182  if (tsquery_requires_match(curitem + curitem->qoperator.left))
2183  return true;
2184  else
2185  return tsquery_requires_match(curitem + 1);
2186 
2187  case OP_OR:
2188  /* Both sides must require a match */
2189  if (tsquery_requires_match(curitem + curitem->qoperator.left))
2190  return tsquery_requires_match(curitem + 1);
2191  else
2192  return false;
2193 
2194  default:
2195  elog(ERROR, "unrecognized operator: %d", curitem->qoperator.oper);
2196  }
2197 
2198  /* not reachable, but keep compiler quiet */
2199  return false;
2200 }
2201 
2202 /*
2203  * boolean operations
2204  */
2205 Datum
2207 {
2209  PG_GETARG_DATUM(1),
2210  PG_GETARG_DATUM(0)));
2211 }
2212 
2213 Datum
2215 {
2217  TSQuery query = PG_GETARG_TSQUERY(1);
2218  CHKVAL chkval;
2219  bool result;
2220 
2221  /* empty query matches nothing */
2222  if (!query->size)
2223  {
2224  PG_FREE_IF_COPY(val, 0);
2225  PG_FREE_IF_COPY(query, 1);
2226  PG_RETURN_BOOL(false);
2227  }
2228 
2229  chkval.arrb = ARRPTR(val);
2230  chkval.arre = chkval.arrb + val->size;
2231  chkval.values = STRPTR(val);
2232  chkval.operand = GETOPERAND(query);
2233  result = TS_execute(GETQUERY(query),
2234  &chkval,
2235  TS_EXEC_EMPTY,
2237 
2238  PG_FREE_IF_COPY(val, 0);
2239  PG_FREE_IF_COPY(query, 1);
2240  PG_RETURN_BOOL(result);
2241 }
2242 
2243 Datum
2245 {
2246  TSVector vector;
2247  TSQuery query;
2248  bool res;
2249 
2251  PG_GETARG_DATUM(0)));
2253  PG_GETARG_DATUM(1)));
2254 
2256  TSVectorGetDatum(vector),
2257  TSQueryGetDatum(query)));
2258 
2259  pfree(vector);
2260  pfree(query);
2261 
2263 }
2264 
2265 Datum
2267 {
2268  TSVector vector;
2269  TSQuery query = PG_GETARG_TSQUERY(1);
2270  bool res;
2271 
2273  PG_GETARG_DATUM(0)));
2274 
2276  TSVectorGetDatum(vector),
2277  TSQueryGetDatum(query)));
2278 
2279  pfree(vector);
2280  PG_FREE_IF_COPY(query, 1);
2281 
2283 }
2284 
2285 /*
2286  * ts_stat statistic function support
2287  */
2288 
2289 
2290 /*
2291  * Returns the number of positions in value 'wptr' within tsvector 'txt',
2292  * that have a weight equal to one of the weights in 'weight' bitmask.
2293  */
2294 static int
2296 {
2297  int len = POSDATALEN(txt, wptr);
2298  int num = 0;
2299  WordEntryPos *ptr = POSDATAPTR(txt, wptr);
2300 
2301  while (len--)
2302  {
2303  if (weight & (1 << WEP_GETWEIGHT(*ptr)))
2304  num++;
2305  ptr++;
2306  }
2307  return num;
2308 }
2309 
2310 #define compareStatWord(a,e,t) \
2311  tsCompareString((a)->lexeme, (a)->lenlexeme, \
2312  STRPTR(t) + (e)->pos, (e)->len, \
2313  false)
2314 
2315 static void
2317 {
2318  WordEntry *we = ARRPTR(txt) + off;
2319  StatEntry *node = stat->root,
2320  *pnode = NULL;
2321  int n,
2322  res = 0;
2323  uint32 depth = 1;
2324 
2325  if (stat->weight == 0)
2326  n = (we->haspos) ? POSDATALEN(txt, we) : 1;
2327  else
2328  n = (we->haspos) ? check_weight(txt, we, stat->weight) : 0;
2329 
2330  if (n == 0)
2331  return; /* nothing to insert */
2332 
2333  while (node)
2334  {
2335  res = compareStatWord(node, we, txt);
2336 
2337  if (res == 0)
2338  {
2339  break;
2340  }
2341  else
2342  {
2343  pnode = node;
2344  node = (res < 0) ? node->left : node->right;
2345  }
2346  depth++;
2347  }
2348 
2349  if (depth > stat->maxdepth)
2350  stat->maxdepth = depth;
2351 
2352  if (node == NULL)
2353  {
2354  node = MemoryContextAlloc(persistentContext, STATENTRYHDRSZ + we->len);
2355  node->left = node->right = NULL;
2356  node->ndoc = 1;
2357  node->nentry = n;
2358  node->lenlexeme = we->len;
2359  memcpy(node->lexeme, STRPTR(txt) + we->pos, node->lenlexeme);
2360 
2361  if (pnode == NULL)
2362  {
2363  stat->root = node;
2364  }
2365  else
2366  {
2367  if (res < 0)
2368  pnode->left = node;
2369  else
2370  pnode->right = node;
2371  }
2372  }
2373  else
2374  {
2375  node->ndoc++;
2376  node->nentry += n;
2377  }
2378 }
2379 
2380 static void
2382  uint32 low, uint32 high, uint32 offset)
2383 {
2384  uint32 pos;
2385  uint32 middle = (low + high) >> 1;
2386 
2387  pos = (low + middle) >> 1;
2388  if (low != middle && pos >= offset && pos - offset < txt->size)
2389  insertStatEntry(persistentContext, stat, txt, pos - offset);
2390  pos = (high + middle + 1) >> 1;
2391  if (middle + 1 != high && pos >= offset && pos - offset < txt->size)
2392  insertStatEntry(persistentContext, stat, txt, pos - offset);
2393 
2394  if (low != middle)
2395  chooseNextStatEntry(persistentContext, stat, txt, low, middle, offset);
2396  if (high != middle + 1)
2397  chooseNextStatEntry(persistentContext, stat, txt, middle + 1, high, offset);
2398 }
2399 
2400 /*
2401  * This is written like a custom aggregate function, because the
2402  * original plan was to do just that. Unfortunately, an aggregate function
2403  * can't return a set, so that plan was abandoned. If that limitation is
2404  * lifted in the future, ts_stat could be a real aggregate function so that
2405  * you could use it like this:
2406  *
2407  * SELECT ts_stat(vector_column) FROM vector_table;
2408  *
2409  * where vector_column is a tsvector-type column in vector_table.
2410  */
2411 
2412 static TSVectorStat *
2414 {
2416  uint32 i,
2417  nbit = 0,
2418  offset;
2419 
2420  if (stat == NULL)
2421  { /* Init in first */
2422  stat = MemoryContextAllocZero(persistentContext, sizeof(TSVectorStat));
2423  stat->maxdepth = 1;
2424  }
2425 
2426  /* simple check of correctness */
2427  if (txt == NULL || txt->size == 0)
2428  {
2429  if (txt && txt != (TSVector) DatumGetPointer(data))
2430  pfree(txt);
2431  return stat;
2432  }
2433 
2434  i = txt->size - 1;
2435  for (; i > 0; i >>= 1)
2436  nbit++;
2437 
2438  nbit = 1 << nbit;
2439  offset = (nbit - txt->size) / 2;
2440 
2441  insertStatEntry(persistentContext, stat, txt, (nbit >> 1) - offset);
2442  chooseNextStatEntry(persistentContext, stat, txt, 0, nbit, offset);
2443 
2444  return stat;
2445 }
2446 
2447 static void
2449  TSVectorStat *stat)
2450 {
2451  TupleDesc tupdesc;
2452  MemoryContext oldcontext;
2453  StatEntry *node;
2454 
2455  funcctx->user_fctx = (void *) stat;
2456 
2457  oldcontext = MemoryContextSwitchTo(funcctx->multi_call_memory_ctx);
2458 
2459  stat->stack = palloc0(sizeof(StatEntry *) * (stat->maxdepth + 1));
2460  stat->stackpos = 0;
2461 
2462  node = stat->root;
2463  /* find leftmost value */
2464  if (node == NULL)
2465  stat->stack[stat->stackpos] = NULL;
2466  else
2467  for (;;)
2468  {
2469  stat->stack[stat->stackpos] = node;
2470  if (node->left)
2471  {
2472  stat->stackpos++;
2473  node = node->left;
2474  }
2475  else
2476  break;
2477  }
2478  Assert(stat->stackpos <= stat->maxdepth);
2479 
2480  if (get_call_result_type(fcinfo, NULL, &tupdesc) != TYPEFUNC_COMPOSITE)
2481  elog(ERROR, "return type must be a row type");
2482  funcctx->tuple_desc = tupdesc;
2483  funcctx->attinmeta = TupleDescGetAttInMetadata(tupdesc);
2484 
2485  MemoryContextSwitchTo(oldcontext);
2486 }
2487 
2488 static StatEntry *
2490 {
2491  StatEntry *node = stat->stack[stat->stackpos];
2492 
2493  if (node == NULL)
2494  return NULL;
2495 
2496  if (node->ndoc != 0)
2497  {
2498  /* return entry itself: we already was at left sublink */
2499  return node;
2500  }
2501  else if (node->right && node->right != stat->stack[stat->stackpos + 1])
2502  {
2503  /* go on right sublink */
2504  stat->stackpos++;
2505  node = node->right;
2506 
2507  /* find most-left value */
2508  for (;;)
2509  {
2510  stat->stack[stat->stackpos] = node;
2511  if (node->left)
2512  {
2513  stat->stackpos++;
2514  node = node->left;
2515  }
2516  else
2517  break;
2518  }
2519  Assert(stat->stackpos <= stat->maxdepth);
2520  }
2521  else
2522  {
2523  /* we already return all left subtree, itself and right subtree */
2524  if (stat->stackpos == 0)
2525  return NULL;
2526 
2527  stat->stackpos--;
2528  return walkStatEntryTree(stat);
2529  }
2530 
2531  return node;
2532 }
2533 
2534 static Datum
2536 {
2537  TSVectorStat *st;
2538  StatEntry *entry;
2539 
2540  st = (TSVectorStat *) funcctx->user_fctx;
2541 
2542  entry = walkStatEntryTree(st);
2543 
2544  if (entry != NULL)
2545  {
2546  Datum result;
2547  char *values[3];
2548  char ndoc[16];
2549  char nentry[16];
2550  HeapTuple tuple;
2551 
2552  values[0] = palloc(entry->lenlexeme + 1);
2553  memcpy(values[0], entry->lexeme, entry->lenlexeme);
2554  (values[0])[entry->lenlexeme] = '\0';
2555  sprintf(ndoc, "%d", entry->ndoc);
2556  values[1] = ndoc;
2557  sprintf(nentry, "%d", entry->nentry);
2558  values[2] = nentry;
2559 
2560  tuple = BuildTupleFromCStrings(funcctx->attinmeta, values);
2561  result = HeapTupleGetDatum(tuple);
2562 
2563  pfree(values[0]);
2564 
2565  /* mark entry as already visited */
2566  entry->ndoc = 0;
2567 
2568  return result;
2569  }
2570 
2571  return (Datum) 0;
2572 }
2573 
2574 static TSVectorStat *
2575 ts_stat_sql(MemoryContext persistentContext, text *txt, text *ws)
2576 {
2577  char *query = text_to_cstring(txt);
2578  TSVectorStat *stat;
2579  bool isnull;
2580  Portal portal;
2581  SPIPlanPtr plan;
2582 
2583  if ((plan = SPI_prepare(query, 0, NULL)) == NULL)
2584  /* internal error */
2585  elog(ERROR, "SPI_prepare(\"%s\") failed", query);
2586 
2587  if ((portal = SPI_cursor_open(NULL, plan, NULL, NULL, true)) == NULL)
2588  /* internal error */
2589  elog(ERROR, "SPI_cursor_open(\"%s\") failed", query);
2590 
2591  SPI_cursor_fetch(portal, true, 100);
2592 
2593  if (SPI_tuptable == NULL ||
2594  SPI_tuptable->tupdesc->natts != 1 ||
2596  TSVECTOROID))
2597  ereport(ERROR,
2598  (errcode(ERRCODE_INVALID_PARAMETER_VALUE),
2599  errmsg("ts_stat query must return one tsvector column")));
2600 
2601  stat = MemoryContextAllocZero(persistentContext, sizeof(TSVectorStat));
2602  stat->maxdepth = 1;
2603 
2604  if (ws)
2605  {
2606  char *buf;
2607 
2608  buf = VARDATA_ANY(ws);
2609  while (buf - VARDATA_ANY(ws) < VARSIZE_ANY_EXHDR(ws))
2610  {
2611  if (pg_mblen(buf) == 1)
2612  {
2613  switch (*buf)
2614  {
2615  case 'A':
2616  case 'a':
2617  stat->weight |= 1 << 3;
2618  break;
2619  case 'B':
2620  case 'b':
2621  stat->weight |= 1 << 2;
2622  break;
2623  case 'C':
2624  case 'c':
2625  stat->weight |= 1 << 1;
2626  break;
2627  case 'D':
2628  case 'd':
2629  stat->weight |= 1;
2630  break;
2631  default:
2632  stat->weight |= 0;
2633  }
2634  }
2635  buf += pg_mblen(buf);
2636  }
2637  }
2638 
2639  while (SPI_processed > 0)
2640  {
2641  uint64 i;
2642 
2643  for (i = 0; i < SPI_processed; i++)
2644  {
2646 
2647  if (!isnull)
2648  stat = ts_accum(persistentContext, stat, data);
2649  }
2650 
2652  SPI_cursor_fetch(portal, true, 100);
2653  }
2654 
2656  SPI_cursor_close(portal);
2657  SPI_freeplan(plan);
2658  pfree(query);
2659 
2660  return stat;
2661 }
2662 
2663 Datum
2665 {
2666  FuncCallContext *funcctx;
2667  Datum result;
2668 
2669  if (SRF_IS_FIRSTCALL())
2670  {
2671  TSVectorStat *stat;
2672  text *txt = PG_GETARG_TEXT_PP(0);
2673 
2674  funcctx = SRF_FIRSTCALL_INIT();
2675  SPI_connect();
2676  stat = ts_stat_sql(funcctx->multi_call_memory_ctx, txt, NULL);
2677  PG_FREE_IF_COPY(txt, 0);
2678  ts_setup_firstcall(fcinfo, funcctx, stat);
2679  SPI_finish();
2680  }
2681 
2682  funcctx = SRF_PERCALL_SETUP();
2683  if ((result = ts_process_call(funcctx)) != (Datum) 0)
2684  SRF_RETURN_NEXT(funcctx, result);
2685  SRF_RETURN_DONE(funcctx);
2686 }
2687 
2688 Datum
2690 {
2691  FuncCallContext *funcctx;
2692  Datum result;
2693 
2694  if (SRF_IS_FIRSTCALL())
2695  {
2696  TSVectorStat *stat;
2697  text *txt = PG_GETARG_TEXT_PP(0);
2698  text *ws = PG_GETARG_TEXT_PP(1);
2699 
2700  funcctx = SRF_FIRSTCALL_INIT();
2701  SPI_connect();
2702  stat = ts_stat_sql(funcctx->multi_call_memory_ctx, txt, ws);
2703  PG_FREE_IF_COPY(txt, 0);
2704  PG_FREE_IF_COPY(ws, 1);
2705  ts_setup_firstcall(fcinfo, funcctx, stat);
2706  SPI_finish();
2707  }
2708 
2709  funcctx = SRF_PERCALL_SETUP();
2710  if ((result = ts_process_call(funcctx)) != (Datum) 0)
2711  SRF_RETURN_NEXT(funcctx, result);
2712  SRF_RETURN_DONE(funcctx);
2713 }
2714 
2715 
2716 /*
2717  * Triggers for automatic update of a tsvector column from text column(s)
2718  *
2719  * Trigger arguments are either
2720  * name of tsvector col, name of tsconfig to use, name(s) of text col(s)
2721  * name of tsvector col, name of regconfig col, name(s) of text col(s)
2722  * ie, tsconfig can either be specified by name, or indirectly as the
2723  * contents of a regconfig field in the row. If the name is used, it must
2724  * be explicitly schema-qualified.
2725  */
2726 Datum
2728 {
2729  return tsvector_update_trigger(fcinfo, false);
2730 }
2731 
2732 Datum
2734 {
2735  return tsvector_update_trigger(fcinfo, true);
2736 }
2737 
2738 static Datum
2740 {
2741  TriggerData *trigdata;
2742  Trigger *trigger;
2743  Relation rel;
2744  HeapTuple rettuple = NULL;
2745  int tsvector_attr_num,
2746  i;
2747  ParsedText prs;
2748  Datum datum;
2749  bool isnull;
2750  text *txt;
2751  Oid cfgId;
2752  bool update_needed;
2753 
2754  /* Check call context */
2755  if (!CALLED_AS_TRIGGER(fcinfo)) /* internal error */
2756  elog(ERROR, "tsvector_update_trigger: not fired by trigger manager");
2757 
2758  trigdata = (TriggerData *) fcinfo->context;
2759  if (!TRIGGER_FIRED_FOR_ROW(trigdata->tg_event))
2760  elog(ERROR, "tsvector_update_trigger: must be fired for row");
2761  if (!TRIGGER_FIRED_BEFORE(trigdata->tg_event))
2762  elog(ERROR, "tsvector_update_trigger: must be fired BEFORE event");
2763 
2764  if (TRIGGER_FIRED_BY_INSERT(trigdata->tg_event))
2765  {
2766  rettuple = trigdata->tg_trigtuple;
2767  update_needed = true;
2768  }
2769  else if (TRIGGER_FIRED_BY_UPDATE(trigdata->tg_event))
2770  {
2771  rettuple = trigdata->tg_newtuple;
2772  update_needed = false; /* computed below */
2773  }
2774  else
2775  elog(ERROR, "tsvector_update_trigger: must be fired for INSERT or UPDATE");
2776 
2777  trigger = trigdata->tg_trigger;
2778  rel = trigdata->tg_relation;
2779 
2780  if (trigger->tgnargs < 3)
2781  elog(ERROR, "tsvector_update_trigger: arguments must be tsvector_field, ts_config, text_field1, ...)");
2782 
2783  /* Find the target tsvector column */
2784  tsvector_attr_num = SPI_fnumber(rel->rd_att, trigger->tgargs[0]);
2785  if (tsvector_attr_num == SPI_ERROR_NOATTRIBUTE)
2786  ereport(ERROR,
2787  (errcode(ERRCODE_UNDEFINED_COLUMN),
2788  errmsg("tsvector column \"%s\" does not exist",
2789  trigger->tgargs[0])));
2790  /* This will effectively reject system columns, so no separate test: */
2791  if (!IsBinaryCoercible(SPI_gettypeid(rel->rd_att, tsvector_attr_num),
2792  TSVECTOROID))
2793  ereport(ERROR,
2794  (errcode(ERRCODE_DATATYPE_MISMATCH),
2795  errmsg("column \"%s\" is not of tsvector type",
2796  trigger->tgargs[0])));
2797 
2798  /* Find the configuration to use */
2799  if (config_column)
2800  {
2801  int config_attr_num;
2802 
2803  config_attr_num = SPI_fnumber(rel->rd_att, trigger->tgargs[1]);
2804  if (config_attr_num == SPI_ERROR_NOATTRIBUTE)
2805  ereport(ERROR,
2806  (errcode(ERRCODE_UNDEFINED_COLUMN),
2807  errmsg("configuration column \"%s\" does not exist",
2808  trigger->tgargs[1])));
2809  if (!IsBinaryCoercible(SPI_gettypeid(rel->rd_att, config_attr_num),
2810  REGCONFIGOID))
2811  ereport(ERROR,
2812  (errcode(ERRCODE_DATATYPE_MISMATCH),
2813  errmsg("column \"%s\" is not of regconfig type",
2814  trigger->tgargs[1])));
2815 
2816  datum = SPI_getbinval(rettuple, rel->rd_att, config_attr_num, &isnull);
2817  if (isnull)
2818  ereport(ERROR,
2819  (errcode(ERRCODE_NULL_VALUE_NOT_ALLOWED),
2820  errmsg("configuration column \"%s\" must not be null",
2821  trigger->tgargs[1])));
2822  cfgId = DatumGetObjectId(datum);
2823  }
2824  else
2825  {
2826  List *names;
2827 
2828  names = stringToQualifiedNameList(trigger->tgargs[1], NULL);
2829  /* require a schema so that results are not search path dependent */
2830  if (list_length(names) < 2)
2831  ereport(ERROR,
2832  (errcode(ERRCODE_INVALID_PARAMETER_VALUE),
2833  errmsg("text search configuration name \"%s\" must be schema-qualified",
2834  trigger->tgargs[1])));
2835  cfgId = get_ts_config_oid(names, false);
2836  }
2837 
2838  /* initialize parse state */
2839  prs.lenwords = 32;
2840  prs.curwords = 0;
2841  prs.pos = 0;
2842  prs.words = (ParsedWord *) palloc(sizeof(ParsedWord) * prs.lenwords);
2843 
2844  /* find all words in indexable column(s) */
2845  for (i = 2; i < trigger->tgnargs; i++)
2846  {
2847  int numattr;
2848 
2849  numattr = SPI_fnumber(rel->rd_att, trigger->tgargs[i]);
2851  ereport(ERROR,
2852  (errcode(ERRCODE_UNDEFINED_COLUMN),
2853  errmsg("column \"%s\" does not exist",
2854  trigger->tgargs[i])));
2855  if (!IsBinaryCoercible(SPI_gettypeid(rel->rd_att, numattr), TEXTOID))
2856  ereport(ERROR,
2857  (errcode(ERRCODE_DATATYPE_MISMATCH),
2858  errmsg("column \"%s\" is not of a character type",
2859  trigger->tgargs[i])));
2860 
2862  update_needed = true;
2863 
2864  datum = SPI_getbinval(rettuple, rel->rd_att, numattr, &isnull);
2865  if (isnull)
2866  continue;
2867 
2868  txt = DatumGetTextPP(datum);
2869 
2870  parsetext(cfgId, &prs, VARDATA_ANY(txt), VARSIZE_ANY_EXHDR(txt));
2871 
2872  if (txt != (text *) DatumGetPointer(datum))
2873  pfree(txt);
2874  }
2875 
2876  if (update_needed)
2877  {
2878  /* make tsvector value */
2879  datum = TSVectorGetDatum(make_tsvector(&prs));
2880  isnull = false;
2881 
2882  /* and insert it into tuple */
2883  rettuple = heap_modify_tuple_by_cols(rettuple, rel->rd_att,
2884  1, &tsvector_attr_num,
2885  &datum, &isnull);
2886 
2887  pfree(DatumGetPointer(datum));
2888  }
2889 
2890  return PointerGetDatum(rettuple);
2891 }
#define GETQUERY(x)
Definition: _int.h:157
#define PG_GETARG_ARRAYTYPE_P(n)
Definition: array.h:263
ArrayType * construct_array_builtin(Datum *elems, int nelems, Oid elmtype)
Definition: arrayfuncs.c:3374
void deconstruct_array_builtin(ArrayType *array, Oid elmtype, Datum **elemsp, bool **nullsp, int *nelemsp)
Definition: arrayfuncs.c:3678
int16 AttrNumber
Definition: attnum.h:21
bool bms_is_member(int x, const Bitmapset *a)
Definition: bitmapset.c:510
static Datum values[MAXATTR]
Definition: bootstrap.c:152
int numattr
Definition: bootstrap.c:62
unsigned short uint16
Definition: c.h:505
unsigned int uint32
Definition: c.h:506
signed char int8
Definition: c.h:492
#define Min(x, y)
Definition: c.h:1004
signed int int32
Definition: c.h:494
#define Max(x, y)
Definition: c.h:998
#define VARHDRSZ
Definition: c.h:692
#define Assert(condition)
Definition: c.h:858
#define FLEXIBLE_ARRAY_MEMBER
Definition: c.h:398
#define SHORTALIGN(LEN)
Definition: c.h:807
#define ARRPTR(x)
Definition: cube.c:25
struct cursor * cur
Definition: ecpg.c:28
int errcode(int sqlerrcode)
Definition: elog.c:857
int errmsg(const char *fmt,...)
Definition: elog.c:1070
#define ERROR
Definition: elog.h:39
#define elog(elevel,...)
Definition: elog.h:224
#define ereport(elevel,...)
Definition: elog.h:149
HeapTuple BuildTupleFromCStrings(AttInMetadata *attinmeta, char **values)
Definition: execTuples.c:2222
AttInMetadata * TupleDescGetAttInMetadata(TupleDesc tupdesc)
Definition: execTuples.c:2173
#define palloc0_object(type)
Definition: fe_memutils.h:63
#define PG_FREE_IF_COPY(ptr, n)
Definition: fmgr.h:260
#define PG_GETARG_TEXT_PP(n)
Definition: fmgr.h:309
#define DirectFunctionCall2(func, arg1, arg2)
Definition: fmgr.h:644
#define PG_GETARG_CHAR(n)
Definition: fmgr.h:273
#define DatumGetTextPP(X)
Definition: fmgr.h:292
#define DirectFunctionCall1(func, arg1)
Definition: fmgr.h:642
#define PG_GETARG_DATUM(n)
Definition: fmgr.h:268
#define PG_RETURN_INT32(x)
Definition: fmgr.h:354
#define PG_RETURN_DATUM(x)
Definition: fmgr.h:353
#define PG_RETURN_POINTER(x)
Definition: fmgr.h:361
#define PG_FUNCTION_ARGS
Definition: fmgr.h:193
#define PG_RETURN_BOOL(x)
Definition: fmgr.h:359
TypeFuncClass get_call_result_type(FunctionCallInfo fcinfo, Oid *resultTypeId, TupleDesc *resultTupleDesc)
Definition: funcapi.c:276
#define SRF_IS_FIRSTCALL()
Definition: funcapi.h:304
#define SRF_PERCALL_SETUP()
Definition: funcapi.h:308
@ TYPEFUNC_COMPOSITE
Definition: funcapi.h:149
#define SRF_RETURN_NEXT(_funcctx, _result)
Definition: funcapi.h:310
#define SRF_FIRSTCALL_INIT()
Definition: funcapi.h:306
static Datum HeapTupleGetDatum(const HeapTupleData *tuple)
Definition: funcapi.h:230
#define SRF_RETURN_DONE(_funcctx)
Definition: funcapi.h:328
Datum difference(PG_FUNCTION_ARGS)
HeapTuple heap_modify_tuple_by_cols(HeapTuple tuple, TupleDesc tupleDesc, int nCols, const int *replCols, const Datum *replValues, const bool *replIsnull)
Definition: heaptuple.c:1277
HeapTuple heap_form_tuple(TupleDesc tupleDescriptor, const Datum *values, const bool *isnull)
Definition: heaptuple.c:1116
#define CALCDATASIZE(x, lenstr)
Definition: hstore.h:72
#define STRPTR(x)
Definition: hstore.h:76
#define nitems(x)
Definition: indent.h:31
long val
Definition: informix.c:670
static int pg_cmp_s32(int32 a, int32 b)
Definition: int.h:483
int b
Definition: isn.c:70
int a
Definition: isn.c:69
int j
Definition: isn.c:74
int i
Definition: isn.c:73
if(TABLE==NULL||TABLE_index==NULL)
Definition: isn.c:77
List * lappend(List *list, void *datum)
Definition: list.c:339
List * list_concat(List *list1, const List *list2)
Definition: list.c:561
#define GETOPERAND(x)
Definition: ltree.h:165
int pg_mblen(const char *mbstr)
Definition: mbutils.c:1023
void pfree(void *pointer)
Definition: mcxt.c:1520
void * palloc0(Size size)
Definition: mcxt.c:1346
void * MemoryContextAllocZero(MemoryContext context, Size size)
Definition: mcxt.c:1214
void * repalloc(void *pointer, Size size)
Definition: mcxt.c:1540
void * MemoryContextAlloc(MemoryContext context, Size size)
Definition: mcxt.c:1180
void * palloc(Size size)
Definition: mcxt.c:1316
#define CHECK_FOR_INTERRUPTS()
Definition: miscadmin.h:122
Oid get_ts_config_oid(List *names, bool missing_ok)
Definition: namespace.c:3137
bool IsBinaryCoercible(Oid srctype, Oid targettype)
void * arg
const void size_t len
const void * data
#define lfirst(lc)
Definition: pg_list.h:172
static int list_length(const List *l)
Definition: pg_list.h:152
#define NIL
Definition: pg_list.h:68
#define list_make1(x1)
Definition: pg_list.h:212
#define plan(x)
Definition: pg_regress.c:162
static char * buf
Definition: pg_test_fsync.c:73
#define sprintf
Definition: port.h:240
#define qsort(a, b, c, d)
Definition: port.h:449
void check_stack_depth(void)
Definition: postgres.c:3531
static bool DatumGetBool(Datum X)
Definition: postgres.h:90
static Datum PointerGetDatum(const void *X)
Definition: postgres.h:322
uintptr_t Datum
Definition: postgres.h:64
static Oid DatumGetObjectId(Datum X)
Definition: postgres.h:242
static Datum Int16GetDatum(int16 X)
Definition: postgres.h:172
static Pointer DatumGetPointer(Datum X)
Definition: postgres.h:312
static char DatumGetChar(Datum X)
Definition: postgres.h:112
unsigned int Oid
Definition: postgres_ext.h:31
static size_t qunique(void *array, size_t elements, size_t width, int(*compare)(const void *, const void *))
Definition: qunique.h:21
MemoryContextSwitchTo(old_ctx)
static int cmp(const chr *x, const chr *y, size_t len)
Definition: regc_locale.c:743
List * stringToQualifiedNameList(const char *string, Node *escontext)
Definition: regproc.c:1797
static pg_noinline void Size size
Definition: slab.c:607
int SPI_fnumber(TupleDesc tupdesc, const char *fname)
Definition: spi.c:1172
uint64 SPI_processed
Definition: spi.c:44
Oid SPI_gettypeid(TupleDesc tupdesc, int fnumber)
Definition: spi.c:1305
int SPI_freeplan(SPIPlanPtr plan)
Definition: spi.c:1022
SPITupleTable * SPI_tuptable
Definition: spi.c:45
int SPI_connect(void)
Definition: spi.c:94
void SPI_cursor_fetch(Portal portal, bool forward, long count)
Definition: spi.c:1803
int SPI_finish(void)
Definition: spi.c:182
void SPI_freetuptable(SPITupleTable *tuptable)
Definition: spi.c:1383
Portal SPI_cursor_open(const char *name, SPIPlanPtr plan, Datum *Values, const char *Nulls, bool read_only)
Definition: spi.c:1442
SPIPlanPtr SPI_prepare(const char *src, int nargs, Oid *argtypes)
Definition: spi.c:857
void SPI_cursor_close(Portal portal)
Definition: spi.c:1859
Datum SPI_getbinval(HeapTuple tuple, TupleDesc tupdesc, int fnumber, bool *isnull)
Definition: spi.c:1249
#define SPI_ERROR_NOATTRIBUTE
Definition: spi.h:76
int32 * arrb
Definition: _int_bool.c:226
WordEntry * arre
Definition: tsvector_op.c:39
char * values
Definition: tsvector_op.c:40
char * operand
Definition: ltxtquery_op.c:52
int32 * arre
Definition: _int_bool.c:227
WordEntry * arrb
Definition: tsvector_op.c:38
WordEntryPos * pos
Definition: ts_utils.h:166
void * user_fctx
Definition: funcapi.h:82
uint64 call_cntr
Definition: funcapi.h:65
AttInMetadata * attinmeta
Definition: funcapi.h:91
MemoryContext multi_call_memory_ctx
Definition: funcapi.h:101
TupleDesc tuple_desc
Definition: funcapi.h:112
Definition: pg_list.h:54
int32 pos
Definition: ts_utils.h:107
int32 lenwords
Definition: ts_utils.h:105
int32 curwords
Definition: ts_utils.h:106
ParsedWord * words
Definition: ts_utils.h:104
int16 distance
Definition: ts_type.h:196
uint32 left
Definition: ts_type.h:197
TupleDesc rd_att
Definition: rel.h:112
TupleDesc tupdesc
Definition: spi.h:25
HeapTuple * vals
Definition: spi.h:26
uint32 nentry
Definition: tsvector_op.c:49
struct StatEntry * left
Definition: tsvector_op.c:50
char lexeme[FLEXIBLE_ARRAY_MEMBER]
Definition: tsvector_op.c:53
uint32 lenlexeme
Definition: tsvector_op.c:52
uint32 ndoc
Definition: tsvector_op.c:47
struct StatEntry * right
Definition: tsvector_op.c:51
int32 size
Definition: ts_type.h:221
int32 size
Definition: ts_type.h:93
int32 weight
Definition: tsvector_op.c:60
StatEntry * root
Definition: tsvector_op.c:67
uint32 maxdepth
Definition: tsvector_op.c:62
uint32 stackpos
Definition: tsvector_op.c:65
StatEntry ** stack
Definition: tsvector_op.c:64
Relation tg_relation
Definition: trigger.h:35
const Bitmapset * tg_updatedcols
Definition: trigger.h:43
TriggerEvent tg_event
Definition: trigger.h:34
HeapTuple tg_newtuple
Definition: trigger.h:37
Trigger * tg_trigger
Definition: trigger.h:38
HeapTuple tg_trigtuple
Definition: trigger.h:36
int16 tgnargs
Definition: reltrigger.h:38
char ** tgargs
Definition: reltrigger.h:41
WordEntryPos pos[FLEXIBLE_ARRAY_MEMBER]
Definition: ts_type.h:68
uint32 pos
Definition: ts_type.h:46
uint32 haspos
Definition: ts_type.h:44
uint32 len
Definition: ts_type.h:45
Definition: c.h:687
#define FirstLowInvalidHeapAttributeNumber
Definition: sysattr.h:27
Datum to_tsvector(PG_FUNCTION_ARGS)
Definition: to_tsany.c:270
TSVector make_tsvector(ParsedText *prs)
Definition: to_tsany.c:165
Datum plainto_tsquery(PG_FUNCTION_ARGS)
Definition: to_tsany.c:642
#define TRIGGER_FIRED_BEFORE(event)
Definition: trigger.h:128
#define CALLED_AS_TRIGGER(fcinfo)
Definition: trigger.h:26
#define TRIGGER_FIRED_FOR_ROW(event)
Definition: trigger.h:122
#define TRIGGER_FIRED_BY_INSERT(event)
Definition: trigger.h:110
#define TRIGGER_FIRED_BY_UPDATE(event)
Definition: trigger.h:116
void parsetext(Oid cfgId, ParsedText *prs, char *buf, int buflen)
Definition: ts_parse.c:355
#define PG_GETARG_TSVECTOR(n)
Definition: ts_type.h:135
#define WEP_GETPOS(x)
Definition: ts_type.h:80
#define _POSVECPTR(x, e)
Definition: ts_type.h:109
static TSQuery DatumGetTSQuery(Datum X)
Definition: ts_type.h:249
static TSVector DatumGetTSVector(Datum X)
Definition: ts_type.h:118
#define MAXENTRYPOS
Definition: ts_type.h:85
static Datum TSVectorGetDatum(const TSVectorData *X)
Definition: ts_type.h:130
#define WEP_SETPOS(x, v)
Definition: ts_type.h:83
#define POSDATALEN(x, e)
Definition: ts_type.h:110
#define PG_GETARG_TSQUERY(n)
Definition: ts_type.h:266
uint16 WordEntryPos
Definition: ts_type.h:63
#define MAXNUMPOS
Definition: ts_type.h:86
TSVectorData * TSVector
Definition: ts_type.h:98
#define PG_GETARG_TSVECTOR_COPY(n)
Definition: ts_type.h:136
#define WEP_SETWEIGHT(x, v)
Definition: ts_type.h:82
#define QI_VAL
Definition: ts_type.h:149
static Datum TSQueryGetDatum(const TSQueryData *X)
Definition: ts_type.h:261
#define LIMITPOS(x)
Definition: ts_type.h:87
#define OP_AND
Definition: ts_type.h:180
#define OP_PHRASE
Definition: ts_type.h:182
#define OP_OR
Definition: ts_type.h:181
#define POSDATAPTR(x, e)
Definition: ts_type.h:111
#define OP_NOT
Definition: ts_type.h:179
#define WEP_GETWEIGHT(x)
Definition: ts_type.h:79
#define MAXSTRPOS
Definition: ts_type.h:50
#define TS_EXEC_PHRASE_NO_POS
Definition: ts_utils.h:202
TSTernaryValue
Definition: ts_utils.h:133
@ TS_MAYBE
Definition: ts_utils.h:136
@ TS_NO
Definition: ts_utils.h:134
@ TS_YES
Definition: ts_utils.h:135
#define TS_EXEC_EMPTY
Definition: ts_utils.h:188
#define TS_EXEC_SKIP_NOT
Definition: ts_utils.h:195
TSTernaryValue(* TSExecuteCallback)(void *arg, QueryOperand *val, ExecPhraseData *data)
Definition: ts_utils.h:182
static const float weights[]
Definition: tsrank.c:24
int compareWordEntryPos(const void *a, const void *b)
Definition: tsvector.c:36
Datum tsvector_setweight_by_filter(PG_FUNCTION_ARGS)
Definition: tsvector_op.c:273
#define TSPO_BOTH
Definition: tsvector_op.c:1465
static Datum ts_process_call(FuncCallContext *funcctx)
Definition: tsvector_op.c:2535
static TSTernaryValue checkcondition_str(void *checkval, QueryOperand *val, ExecPhraseData *data)
Definition: tsvector_op.c:1295
bool TS_execute(QueryItem *curitem, void *arg, uint32 flags, TSExecuteCallback chkcond)
Definition: tsvector_op.c:1854
Datum ts_match_vq(PG_FUNCTION_ARGS)
Definition: tsvector_op.c:2214
Datum tsvector_update_trigger_byid(PG_FUNCTION_ARGS)
Definition: tsvector_op.c:2727
static int32 add_pos(TSVector src, WordEntry *srcptr, TSVector dest, WordEntry *destptr, int32 maxpos)
Definition: tsvector_op.c:364
Datum tsvector_delete_arr(PG_FUNCTION_ARGS)
Definition: tsvector_op.c:578
#define TSPO_R_ONLY
Definition: tsvector_op.c:1464
Datum array_to_tsvector(PG_FUNCTION_ARGS)
Definition: tsvector_op.c:747
#define STATENTRYHDRSZ
Definition: tsvector_op.c:56
Datum tsvector_filter(PG_FUNCTION_ARGS)
Definition: tsvector_op.c:819
static TSTernaryValue TS_phrase_output(ExecPhraseData *data, ExecPhraseData *Ldata, ExecPhraseData *Rdata, int emit, int Loffset, int Roffset, int max_npos)
Definition: tsvector_op.c:1468
#define compareEntry(pa, a, pb, b)
Definition: tsvector_op.c:354
Datum tsvector_setweight(PG_FUNCTION_ARGS)
Definition: tsvector_op.c:211
#define TSVECTORCMPFUNC(type, action, ret)
Definition: tsvector_op.c:145
static int check_weight(TSVector txt, WordEntry *wptr, int8 weight)
Definition: tsvector_op.c:2295
Datum tsvector_strip(PG_FUNCTION_ARGS)
Definition: tsvector_op.c:168
struct StatEntry StatEntry
Datum tsvector_length(PG_FUNCTION_ARGS)
Definition: tsvector_op.c:201
Datum tsvector_to_array(PG_FUNCTION_ARGS)
Definition: tsvector_op.c:720
Datum ts_match_tq(PG_FUNCTION_ARGS)
Definition: tsvector_op.c:2266
Datum ts_stat1(PG_FUNCTION_ARGS)
Definition: tsvector_op.c:2664
int32 tsCompareString(char *a, int lena, char *b, int lenb, bool prefix)
Definition: tsvector_op.c:1152
Datum tsvector_delete_str(PG_FUNCTION_ARGS)
Definition: tsvector_op.c:554
#define TSPO_L_ONLY
Definition: tsvector_op.c:1463
static Datum tsvector_update_trigger(PG_FUNCTION_ARGS, bool config_column)
Definition: tsvector_op.c:2739
Datum ts_match_qv(PG_FUNCTION_ARGS)
Definition: tsvector_op.c:2206
static int silly_cmp_tsvector(const TSVector a, const TSVector b)
Definition: tsvector_op.c:86
static int tsvector_bsearch(const TSVector tsv, char *lexeme, int lexeme_len)
Definition: tsvector_op.c:400
bool tsquery_requires_match(QueryItem *curitem)
Definition: tsvector_op.c:2156
Datum tsvector_concat(PG_FUNCTION_ARGS)
Definition: tsvector_op.c:925
Datum tsvector_update_trigger_bycolumn(PG_FUNCTION_ARGS)
Definition: tsvector_op.c:2733
static bool TS_execute_locations_recurse(QueryItem *curitem, void *arg, TSExecuteCallback chkcond, List **locations)
Definition: tsvector_op.c:2025
static TSTernaryValue TS_execute_recurse(QueryItem *curitem, void *arg, uint32 flags, TSExecuteCallback chkcond)
Definition: tsvector_op.c:1883
TSTernaryValue TS_execute_ternary(QueryItem *curitem, void *arg, uint32 flags, TSExecuteCallback chkcond)
Definition: tsvector_op.c:1871
static int compare_int(const void *va, const void *vb)
Definition: tsvector_op.c:433
static StatEntry * walkStatEntryTree(TSVectorStat *stat)
Definition: tsvector_op.c:2489
static void ts_setup_firstcall(FunctionCallInfo fcinfo, FuncCallContext *funcctx, TSVectorStat *stat)
Definition: tsvector_op.c:2448
static void chooseNextStatEntry(MemoryContext persistentContext, TSVectorStat *stat, TSVector txt, uint32 low, uint32 high, uint32 offset)
Definition: tsvector_op.c:2381
Datum ts_match_tt(PG_FUNCTION_ARGS)
Definition: tsvector_op.c:2244
static TSVectorStat * ts_accum(MemoryContext persistentContext, TSVectorStat *stat, Datum data)
Definition: tsvector_op.c:2413
static TSTernaryValue TS_phrase_execute(QueryItem *curitem, void *arg, uint32 flags, TSExecuteCallback chkcond, ExecPhraseData *data)
Definition: tsvector_op.c:1609
static int compare_text_lexemes(const void *va, const void *vb)
Definition: tsvector_op.c:442
static TSTernaryValue checkclass_str(CHKVAL *chkval, WordEntry *entry, QueryOperand *val, ExecPhraseData *data)
Definition: tsvector_op.c:1189
#define compareStatWord(a, e, t)
Definition: tsvector_op.c:2310
List * TS_execute_locations(QueryItem *curitem, void *arg, uint32 flags, TSExecuteCallback chkcond)
Definition: tsvector_op.c:2007
Datum tsvector_unnest(PG_FUNCTION_ARGS)
Definition: tsvector_op.c:632
static TSVectorStat * ts_stat_sql(MemoryContext persistentContext, text *txt, text *ws)
Definition: tsvector_op.c:2575
Datum ts_stat2(PG_FUNCTION_ARGS)
Definition: tsvector_op.c:2689
static void insertStatEntry(MemoryContext persistentContext, TSVectorStat *stat, TSVector txt, uint32 off)
Definition: tsvector_op.c:2316
static TSVector tsvector_delete_by_indices(TSVector tsv, int *indices_to_delete, int indices_count)
Definition: tsvector_op.c:464
TupleDesc CreateTemplateTupleDesc(int natts)
Definition: tupdesc.c:67
void TupleDescInitEntry(TupleDesc desc, AttrNumber attributeNumber, const char *attributeName, Oid oidtypeid, int32 typmod, int attdim)
Definition: tupdesc.c:651
QueryOperator qoperator
Definition: ts_type.h:209
QueryItemType type
Definition: ts_type.h:208
#define VARDATA(PTR)
Definition: varatt.h:278
#define VARDATA_ANY(PTR)
Definition: varatt.h:324
#define SET_VARSIZE(PTR, len)
Definition: varatt.h:305
#define VARSIZE(PTR)
Definition: varatt.h:279
#define VARSIZE_ANY_EXHDR(PTR)
Definition: varatt.h:317
char * text_to_cstring(const text *t)
Definition: varlena.c:217
text * cstring_to_text_with_len(const char *s, int len)
Definition: varlena.c:196
#define stat
Definition: win32_port.h:284