PostgreSQL Source Code  git master
to_tsany.c
Go to the documentation of this file.
1 /*-------------------------------------------------------------------------
2  *
3  * to_tsany.c
4  * to_ts* function definitions
5  *
6  * Portions Copyright (c) 1996-2022, PostgreSQL Global Development Group
7  *
8  *
9  * IDENTIFICATION
10  * src/backend/tsearch/to_tsany.c
11  *
12  *-------------------------------------------------------------------------
13  */
14 #include "postgres.h"
15 
16 #include "common/jsonapi.h"
17 #include "tsearch/ts_cache.h"
18 #include "tsearch/ts_utils.h"
19 #include "utils/builtins.h"
20 #include "utils/jsonfuncs.h"
21 
22 
23 /*
24  * Opaque data structure, which is passed by parse_tsquery() to pushval_morph().
25  */
26 typedef struct MorphOpaque
27 {
29 
30  /*
31  * Single tsquery morph could be parsed into multiple words. When these
32  * words reside in adjacent positions, they are connected using this
33  * operator. Usually, that is OP_PHRASE, which requires word positions of
34  * a complex morph to exactly match the tsvector.
35  */
36  int qoperator;
38 
39 typedef struct TSVectorBuildState
40 {
44 
45 static void add_to_tsvector(void *_state, char *elem_value, int elem_len);
46 
47 
48 Datum
50 {
52 }
53 
54 /*
55  * to_tsvector
56  */
57 static int
58 compareWORD(const void *a, const void *b)
59 {
60  int res;
61 
62  res = tsCompareString(((const ParsedWord *) a)->word, ((const ParsedWord *) a)->len,
63  ((const ParsedWord *) b)->word, ((const ParsedWord *) b)->len,
64  false);
65 
66  if (res == 0)
67  {
68  if (((const ParsedWord *) a)->pos.pos == ((const ParsedWord *) b)->pos.pos)
69  return 0;
70 
71  res = (((const ParsedWord *) a)->pos.pos > ((const ParsedWord *) b)->pos.pos) ? 1 : -1;
72  }
73 
74  return res;
75 }
76 
77 static int
79 {
80  ParsedWord *ptr,
81  *res;
82  int tmppos;
83 
84  if (l == 1)
85  {
86  tmppos = LIMITPOS(a->pos.pos);
87  a->alen = 2;
88  a->pos.apos = (uint16 *) palloc(sizeof(uint16) * a->alen);
89  a->pos.apos[0] = 1;
90  a->pos.apos[1] = tmppos;
91  return l;
92  }
93 
94  res = a;
95  ptr = a + 1;
96 
97  /*
98  * Sort words with its positions
99  */
100  qsort((void *) a, l, sizeof(ParsedWord), compareWORD);
101 
102  /*
103  * Initialize first word and its first position
104  */
105  tmppos = LIMITPOS(a->pos.pos);
106  a->alen = 2;
107  a->pos.apos = (uint16 *) palloc(sizeof(uint16) * a->alen);
108  a->pos.apos[0] = 1;
109  a->pos.apos[1] = tmppos;
110 
111  /*
112  * Summarize position information for each word
113  */
114  while (ptr - a < l)
115  {
116  if (!(ptr->len == res->len &&
117  strncmp(ptr->word, res->word, res->len) == 0))
118  {
119  /*
120  * Got a new word, so put it in result
121  */
122  res++;
123  res->len = ptr->len;
124  res->word = ptr->word;
125  tmppos = LIMITPOS(ptr->pos.pos);
126  res->alen = 2;
127  res->pos.apos = (uint16 *) palloc(sizeof(uint16) * res->alen);
128  res->pos.apos[0] = 1;
129  res->pos.apos[1] = tmppos;
130  }
131  else
132  {
133  /*
134  * The word already exists, so adjust position information. But
135  * before we should check size of position's array, max allowed
136  * value for position and uniqueness of position
137  */
138  pfree(ptr->word);
139  if (res->pos.apos[0] < MAXNUMPOS - 1 && res->pos.apos[res->pos.apos[0]] != MAXENTRYPOS - 1 &&
140  res->pos.apos[res->pos.apos[0]] != LIMITPOS(ptr->pos.pos))
141  {
142  if (res->pos.apos[0] + 1 >= res->alen)
143  {
144  res->alen *= 2;
145  res->pos.apos = (uint16 *) repalloc(res->pos.apos, sizeof(uint16) * res->alen);
146  }
147  if (res->pos.apos[0] == 0 || res->pos.apos[res->pos.apos[0]] != LIMITPOS(ptr->pos.pos))
148  {
149  res->pos.apos[res->pos.apos[0] + 1] = LIMITPOS(ptr->pos.pos);
150  res->pos.apos[0]++;
151  }
152  }
153  }
154  ptr++;
155  }
156 
157  return res + 1 - a;
158 }
159 
160 /*
161  * make value of tsvector, given parsed text
162  *
163  * Note: frees prs->words and subsidiary data.
164  */
165 TSVector
167 {
168  int i,
169  j,
170  lenstr = 0,
171  totallen;
172  TSVector in;
173  WordEntry *ptr;
174  char *str;
175  int stroff;
176 
177  /* Merge duplicate words */
178  if (prs->curwords > 0)
179  prs->curwords = uniqueWORD(prs->words, prs->curwords);
180 
181  /* Determine space needed */
182  for (i = 0; i < prs->curwords; i++)
183  {
184  lenstr += prs->words[i].len;
185  if (prs->words[i].alen)
186  {
187  lenstr = SHORTALIGN(lenstr);
188  lenstr += sizeof(uint16) + prs->words[i].pos.apos[0] * sizeof(WordEntryPos);
189  }
190  }
191 
192  if (lenstr > MAXSTRPOS)
193  ereport(ERROR,
194  (errcode(ERRCODE_PROGRAM_LIMIT_EXCEEDED),
195  errmsg("string is too long for tsvector (%d bytes, max %d bytes)", lenstr, MAXSTRPOS)));
196 
197  totallen = CALCDATASIZE(prs->curwords, lenstr);
198  in = (TSVector) palloc0(totallen);
199  SET_VARSIZE(in, totallen);
200  in->size = prs->curwords;
201 
202  ptr = ARRPTR(in);
203  str = STRPTR(in);
204  stroff = 0;
205  for (i = 0; i < prs->curwords; i++)
206  {
207  ptr->len = prs->words[i].len;
208  ptr->pos = stroff;
209  memcpy(str + stroff, prs->words[i].word, prs->words[i].len);
210  stroff += prs->words[i].len;
211  pfree(prs->words[i].word);
212  if (prs->words[i].alen)
213  {
214  int k = prs->words[i].pos.apos[0];
215  WordEntryPos *wptr;
216 
217  if (k > 0xFFFF)
218  elog(ERROR, "positions array too long");
219 
220  ptr->haspos = 1;
221  stroff = SHORTALIGN(stroff);
222  *(uint16 *) (str + stroff) = (uint16) k;
223  wptr = POSDATAPTR(in, ptr);
224  for (j = 0; j < k; j++)
225  {
226  WEP_SETWEIGHT(wptr[j], 0);
227  WEP_SETPOS(wptr[j], prs->words[i].pos.apos[j + 1]);
228  }
229  stroff += sizeof(uint16) + k * sizeof(WordEntryPos);
230  pfree(prs->words[i].pos.apos);
231  }
232  else
233  ptr->haspos = 0;
234  ptr++;
235  }
236 
237  if (prs->words)
238  pfree(prs->words);
239 
240  return in;
241 }
242 
243 Datum
245 {
246  Oid cfgId = PG_GETARG_OID(0);
247  text *in = PG_GETARG_TEXT_PP(1);
248  ParsedText prs;
249  TSVector out;
250 
251  prs.lenwords = VARSIZE_ANY_EXHDR(in) / 6; /* just estimation of word's
252  * number */
253  if (prs.lenwords < 2)
254  prs.lenwords = 2;
255  prs.curwords = 0;
256  prs.pos = 0;
257  prs.words = (ParsedWord *) palloc(sizeof(ParsedWord) * prs.lenwords);
258 
259  parsetext(cfgId, &prs, VARDATA_ANY(in), VARSIZE_ANY_EXHDR(in));
260 
261  PG_FREE_IF_COPY(in, 1);
262 
263  out = make_tsvector(&prs);
264 
265  PG_RETURN_TSVECTOR(out);
266 }
267 
268 Datum
270 {
271  text *in = PG_GETARG_TEXT_PP(0);
272  Oid cfgId;
273 
274  cfgId = getTSCurrentConfig(true);
276  ObjectIdGetDatum(cfgId),
277  PointerGetDatum(in)));
278 }
279 
280 /*
281  * Worker function for jsonb(_string)_to_tsvector(_byid)
282  */
283 static TSVector
285 {
287  ParsedText prs;
288 
289  prs.words = NULL;
290  prs.curwords = 0;
291  state.prs = &prs;
292  state.cfgId = cfgId;
293 
295 
296  return make_tsvector(&prs);
297 }
298 
299 Datum
301 {
302  Oid cfgId = PG_GETARG_OID(0);
303  Jsonb *jb = PG_GETARG_JSONB_P(1);
304  TSVector result;
305 
306  result = jsonb_to_tsvector_worker(cfgId, jb, jtiString);
307  PG_FREE_IF_COPY(jb, 1);
308 
309  PG_RETURN_TSVECTOR(result);
310 }
311 
312 Datum
314 {
315  Jsonb *jb = PG_GETARG_JSONB_P(0);
316  Oid cfgId;
317  TSVector result;
318 
319  cfgId = getTSCurrentConfig(true);
320  result = jsonb_to_tsvector_worker(cfgId, jb, jtiString);
321  PG_FREE_IF_COPY(jb, 0);
322 
323  PG_RETURN_TSVECTOR(result);
324 }
325 
326 Datum
328 {
329  Oid cfgId = PG_GETARG_OID(0);
330  Jsonb *jb = PG_GETARG_JSONB_P(1);
331  Jsonb *jbFlags = PG_GETARG_JSONB_P(2);
332  TSVector result;
333  uint32 flags = parse_jsonb_index_flags(jbFlags);
334 
335  result = jsonb_to_tsvector_worker(cfgId, jb, flags);
336  PG_FREE_IF_COPY(jb, 1);
337  PG_FREE_IF_COPY(jbFlags, 2);
338 
339  PG_RETURN_TSVECTOR(result);
340 }
341 
342 Datum
344 {
345  Jsonb *jb = PG_GETARG_JSONB_P(0);
346  Jsonb *jbFlags = PG_GETARG_JSONB_P(1);
347  Oid cfgId;
348  TSVector result;
349  uint32 flags = parse_jsonb_index_flags(jbFlags);
350 
351  cfgId = getTSCurrentConfig(true);
352  result = jsonb_to_tsvector_worker(cfgId, jb, flags);
353  PG_FREE_IF_COPY(jb, 0);
354  PG_FREE_IF_COPY(jbFlags, 1);
355 
356  PG_RETURN_TSVECTOR(result);
357 }
358 
359 /*
360  * Worker function for json(_string)_to_tsvector(_byid)
361  */
362 static TSVector
364 {
366  ParsedText prs;
367 
368  prs.words = NULL;
369  prs.curwords = 0;
370  state.prs = &prs;
371  state.cfgId = cfgId;
372 
373  iterate_json_values(json, flags, &state, add_to_tsvector);
374 
375  return make_tsvector(&prs);
376 }
377 
378 Datum
380 {
381  Oid cfgId = PG_GETARG_OID(0);
382  text *json = PG_GETARG_TEXT_P(1);
383  TSVector result;
384 
385  result = json_to_tsvector_worker(cfgId, json, jtiString);
386  PG_FREE_IF_COPY(json, 1);
387 
388  PG_RETURN_TSVECTOR(result);
389 }
390 
391 Datum
393 {
394  text *json = PG_GETARG_TEXT_P(0);
395  Oid cfgId;
396  TSVector result;
397 
398  cfgId = getTSCurrentConfig(true);
399  result = json_to_tsvector_worker(cfgId, json, jtiString);
400  PG_FREE_IF_COPY(json, 0);
401 
402  PG_RETURN_TSVECTOR(result);
403 }
404 
405 Datum
407 {
408  Oid cfgId = PG_GETARG_OID(0);
409  text *json = PG_GETARG_TEXT_P(1);
410  Jsonb *jbFlags = PG_GETARG_JSONB_P(2);
411  TSVector result;
412  uint32 flags = parse_jsonb_index_flags(jbFlags);
413 
414  result = json_to_tsvector_worker(cfgId, json, flags);
415  PG_FREE_IF_COPY(json, 1);
416  PG_FREE_IF_COPY(jbFlags, 2);
417 
418  PG_RETURN_TSVECTOR(result);
419 }
420 
421 Datum
423 {
424  text *json = PG_GETARG_TEXT_P(0);
425  Jsonb *jbFlags = PG_GETARG_JSONB_P(1);
426  Oid cfgId;
427  TSVector result;
428  uint32 flags = parse_jsonb_index_flags(jbFlags);
429 
430  cfgId = getTSCurrentConfig(true);
431  result = json_to_tsvector_worker(cfgId, json, flags);
432  PG_FREE_IF_COPY(json, 0);
433  PG_FREE_IF_COPY(jbFlags, 1);
434 
435  PG_RETURN_TSVECTOR(result);
436 }
437 
438 /*
439  * Parse lexemes in an element of a json(b) value, add to TSVectorBuildState.
440  */
441 static void
442 add_to_tsvector(void *_state, char *elem_value, int elem_len)
443 {
445  ParsedText *prs = state->prs;
446  int32 prevwords;
447 
448  if (prs->words == NULL)
449  {
450  /*
451  * First time through: initialize words array to a reasonable size.
452  * (parsetext() will realloc it bigger as needed.)
453  */
454  prs->lenwords = 16;
455  prs->words = (ParsedWord *) palloc(sizeof(ParsedWord) * prs->lenwords);
456  prs->curwords = 0;
457  prs->pos = 0;
458  }
459 
460  prevwords = prs->curwords;
461 
462  parsetext(state->cfgId, prs, elem_value, elem_len);
463 
464  /*
465  * If we extracted any words from this JSON element, advance pos to create
466  * an artificial break between elements. This is because we don't want
467  * phrase searches to think that the last word in this element is adjacent
468  * to the first word in the next one.
469  */
470  if (prs->curwords > prevwords)
471  prs->pos += 1;
472 }
473 
474 
475 /*
476  * to_tsquery
477  */
478 
479 
480 /*
481  * This function is used for morph parsing.
482  *
483  * The value is passed to parsetext which will call the right dictionary to
484  * lexize the word. If it turns out to be a stopword, we push a QI_VALSTOP
485  * to the stack.
486  *
487  * All words belonging to the same variant are pushed as an ANDed list,
488  * and different variants are ORed together.
489  */
490 static void
491 pushval_morph(Datum opaque, TSQueryParserState state, char *strval, int lenval, int16 weight, bool prefix)
492 {
493  int32 count = 0;
494  ParsedText prs;
495  uint32 variant,
496  pos = 0,
497  cntvar = 0,
498  cntpos = 0,
499  cnt = 0;
501 
502  prs.lenwords = 4;
503  prs.curwords = 0;
504  prs.pos = 0;
505  prs.words = (ParsedWord *) palloc(sizeof(ParsedWord) * prs.lenwords);
506 
507  parsetext(data->cfg_id, &prs, strval, lenval);
508 
509  if (prs.curwords > 0)
510  {
511  while (count < prs.curwords)
512  {
513  /*
514  * Were any stop words removed? If so, fill empty positions with
515  * placeholders linked by an appropriate operator.
516  */
517  if (pos > 0 && pos + 1 < prs.words[count].pos.pos)
518  {
519  while (pos + 1 < prs.words[count].pos.pos)
520  {
521  /* put placeholders for each missing stop word */
522  pushStop(state);
523  if (cntpos)
524  pushOperator(state, data->qoperator, 1);
525  cntpos++;
526  pos++;
527  }
528  }
529 
530  /* save current word's position */
531  pos = prs.words[count].pos.pos;
532 
533  /* Go through all variants obtained from this token */
534  cntvar = 0;
535  while (count < prs.curwords && pos == prs.words[count].pos.pos)
536  {
537  variant = prs.words[count].nvariant;
538 
539  /* Push all words belonging to the same variant */
540  cnt = 0;
541  while (count < prs.curwords &&
542  pos == prs.words[count].pos.pos &&
543  variant == prs.words[count].nvariant)
544  {
546  prs.words[count].word,
547  prs.words[count].len,
548  weight,
549  ((prs.words[count].flags & TSL_PREFIX) || prefix));
550  pfree(prs.words[count].word);
551  if (cnt)
553  cnt++;
554  count++;
555  }
556 
557  if (cntvar)
558  pushOperator(state, OP_OR, 0);
559  cntvar++;
560  }
561 
562  if (cntpos)
563  {
564  /* distance may be useful */
565  pushOperator(state, data->qoperator, 1);
566  }
567 
568  cntpos++;
569  }
570 
571  pfree(prs.words);
572  }
573  else
574  pushStop(state);
575 }
576 
577 Datum
579 {
580  text *in = PG_GETARG_TEXT_PP(1);
581  TSQuery query;
583 
584  data.cfg_id = PG_GETARG_OID(0);
585 
586  /*
587  * Passing OP_PHRASE as a qoperator makes tsquery require matching of word
588  * positions of a complex morph exactly match the tsvector. Also, when
589  * the complex morphs are connected with OP_PHRASE operator, we connect
590  * all their words into the OP_PHRASE sequence.
591  */
592  data.qoperator = OP_PHRASE;
593 
594  query = parse_tsquery(text_to_cstring(in),
597  0);
598 
599  PG_RETURN_TSQUERY(query);
600 }
601 
602 Datum
604 {
605  text *in = PG_GETARG_TEXT_PP(0);
606  Oid cfgId;
607 
608  cfgId = getTSCurrentConfig(true);
610  ObjectIdGetDatum(cfgId),
611  PointerGetDatum(in)));
612 }
613 
614 Datum
616 {
617  text *in = PG_GETARG_TEXT_PP(1);
618  TSQuery query;
620 
621  data.cfg_id = PG_GETARG_OID(0);
622 
623  /*
624  * parse_tsquery() with P_TSQ_PLAIN flag takes the whole input text as a
625  * single morph. Passing OP_PHRASE as a qoperator makes tsquery require
626  * matching of all words independently on their positions.
627  */
628  data.qoperator = OP_AND;
629 
630  query = parse_tsquery(text_to_cstring(in),
633  P_TSQ_PLAIN);
634 
635  PG_RETURN_POINTER(query);
636 }
637 
638 Datum
640 {
641  text *in = PG_GETARG_TEXT_PP(0);
642  Oid cfgId;
643 
644  cfgId = getTSCurrentConfig(true);
646  ObjectIdGetDatum(cfgId),
647  PointerGetDatum(in)));
648 }
649 
650 
651 Datum
653 {
654  text *in = PG_GETARG_TEXT_PP(1);
655  TSQuery query;
657 
658  data.cfg_id = PG_GETARG_OID(0);
659 
660  /*
661  * parse_tsquery() with P_TSQ_PLAIN flag takes the whole input text as a
662  * single morph. Passing OP_PHRASE as a qoperator makes tsquery require
663  * matching of word positions.
664  */
665  data.qoperator = OP_PHRASE;
666 
667  query = parse_tsquery(text_to_cstring(in),
670  P_TSQ_PLAIN);
671 
672  PG_RETURN_TSQUERY(query);
673 }
674 
675 Datum
677 {
678  text *in = PG_GETARG_TEXT_PP(0);
679  Oid cfgId;
680 
681  cfgId = getTSCurrentConfig(true);
683  ObjectIdGetDatum(cfgId),
684  PointerGetDatum(in)));
685 }
686 
687 Datum
689 {
690  text *in = PG_GETARG_TEXT_PP(1);
692  TSQuery query = NULL;
693 
694  data.cfg_id = PG_GETARG_OID(0);
695 
696  /*
697  * Passing OP_PHRASE as a qoperator makes tsquery require matching of word
698  * positions of a complex morph exactly match the tsvector. Also, when
699  * the complex morphs are given in quotes, we connect all their words into
700  * the OP_PHRASE sequence.
701  */
702  data.qoperator = OP_PHRASE;
703 
704  query = parse_tsquery(text_to_cstring(in),
707  P_TSQ_WEB);
708 
709  PG_RETURN_TSQUERY(query);
710 }
711 
712 Datum
714 {
715  text *in = PG_GETARG_TEXT_PP(0);
716  Oid cfgId;
717 
718  cfgId = getTSCurrentConfig(true);
720  ObjectIdGetDatum(cfgId),
721  PointerGetDatum(in)));
722 }
unsigned short uint16
Definition: c.h:440
unsigned int uint32
Definition: c.h:441
signed short int16
Definition: c.h:428
signed int int32
Definition: c.h:429
#define SHORTALIGN(LEN)
Definition: c.h:753
#define ARRPTR(x)
Definition: cube.c:25
int errcode(int sqlerrcode)
Definition: elog.c:693
int errmsg(const char *fmt,...)
Definition: elog.c:904
#define ERROR
Definition: elog.h:33
#define elog(elevel,...)
Definition: elog.h:218
#define ereport(elevel,...)
Definition: elog.h:143
#define PG_FREE_IF_COPY(ptr, n)
Definition: fmgr.h:260
#define PG_GETARG_OID(n)
Definition: fmgr.h:275
#define PG_GETARG_TEXT_PP(n)
Definition: fmgr.h:309
#define DirectFunctionCall2(func, arg1, arg2)
Definition: fmgr.h:633
#define PG_RETURN_DATUM(x)
Definition: fmgr.h:353
#define PG_RETURN_POINTER(x)
Definition: fmgr.h:361
#define PG_RETURN_OID(x)
Definition: fmgr.h:360
#define PG_FUNCTION_ARGS
Definition: fmgr.h:193
#define PG_GETARG_TEXT_P(n)
Definition: fmgr.h:336
#define CALCDATASIZE(x, lenstr)
Definition: hstore.h:72
#define STRPTR(x)
Definition: hstore.h:76
int b
Definition: isn.c:70
int a
Definition: isn.c:69
int j
Definition: isn.c:74
int i
Definition: isn.c:73
#define PG_GETARG_JSONB_P(x)
Definition: jsonb.h:74
uint32 parse_jsonb_index_flags(Jsonb *jb)
Definition: jsonfuncs.c:5222
void iterate_jsonb_values(Jsonb *jb, uint32 flags, void *state, JsonIterateStringValuesAction action)
Definition: jsonfuncs.c:5290
void iterate_json_values(text *json, uint32 flags, void *action_state, JsonIterateStringValuesAction action)
Definition: jsonfuncs.c:5358
@ jtiString
Definition: jsonfuncs.h:27
void pfree(void *pointer)
Definition: mcxt.c:1175
void * palloc0(Size size)
Definition: mcxt.c:1099
void * repalloc(void *pointer, Size size)
Definition: mcxt.c:1188
void * palloc(Size size)
Definition: mcxt.c:1068
const void size_t len
const void * data
#define qsort(a, b, c, d)
Definition: port.h:495
uintptr_t Datum
Definition: postgres.h:411
#define DatumGetPointer(X)
Definition: postgres.h:593
#define ObjectIdGetDatum(X)
Definition: postgres.h:551
#define VARDATA_ANY(PTR)
Definition: postgres.h:361
#define SET_VARSIZE(PTR, len)
Definition: postgres.h:342
#define PointerGetDatum(X)
Definition: postgres.h:600
#define VARSIZE_ANY_EXHDR(PTR)
Definition: postgres.h:354
unsigned int Oid
Definition: postgres_ext.h:31
static void word(struct vars *, int, struct state *, struct state *)
Definition: regcomp.c:1432
Definition: jsonb.h:221
int qoperator
Definition: to_tsany.c:36
Oid cfg_id
Definition: to_tsany.c:28
int32 pos
Definition: ts_utils.h:103
int32 lenwords
Definition: ts_utils.h:101
int32 curwords
Definition: ts_utils.h:102
ParsedWord * words
Definition: ts_utils.h:100
uint16 flags
Definition: ts_utils.h:93
uint16 nvariant
Definition: ts_utils.h:81
uint16 len
Definition: ts_utils.h:80
uint16 pos
Definition: ts_utils.h:84
uint32 alen
Definition: ts_utils.h:95
char * word
Definition: ts_utils.h:94
ParsedText * prs
Definition: to_tsany.c:41
int32 size
Definition: ts_type.h:93
uint32 pos
Definition: ts_type.h:46
uint32 haspos
Definition: ts_type.h:44
uint32 len
Definition: ts_type.h:45
Definition: regguts.h:318
Definition: c.h:622
static TSVector json_to_tsvector_worker(Oid cfgId, text *json, uint32 flags)
Definition: to_tsany.c:363
static void add_to_tsvector(void *_state, char *elem_value, int elem_len)
Definition: to_tsany.c:442
Datum phraseto_tsquery(PG_FUNCTION_ARGS)
Definition: to_tsany.c:676
Datum to_tsvector(PG_FUNCTION_ARGS)
Definition: to_tsany.c:269
static int compareWORD(const void *a, const void *b)
Definition: to_tsany.c:58
Datum plainto_tsquery_byid(PG_FUNCTION_ARGS)
Definition: to_tsany.c:615
struct TSVectorBuildState TSVectorBuildState
Datum to_tsquery(PG_FUNCTION_ARGS)
Definition: to_tsany.c:603
static TSVector jsonb_to_tsvector_worker(Oid cfgId, Jsonb *jb, uint32 flags)
Definition: to_tsany.c:284
Datum json_string_to_tsvector(PG_FUNCTION_ARGS)
Definition: to_tsany.c:392
Datum jsonb_to_tsvector_byid(PG_FUNCTION_ARGS)
Definition: to_tsany.c:327
Datum json_to_tsvector(PG_FUNCTION_ARGS)
Definition: to_tsany.c:422
Datum json_to_tsvector_byid(PG_FUNCTION_ARGS)
Definition: to_tsany.c:406
Datum jsonb_string_to_tsvector_byid(PG_FUNCTION_ARGS)
Definition: to_tsany.c:300
Datum phraseto_tsquery_byid(PG_FUNCTION_ARGS)
Definition: to_tsany.c:652
Datum to_tsvector_byid(PG_FUNCTION_ARGS)
Definition: to_tsany.c:244
struct MorphOpaque MorphOpaque
Datum jsonb_to_tsvector(PG_FUNCTION_ARGS)
Definition: to_tsany.c:343
TSVector make_tsvector(ParsedText *prs)
Definition: to_tsany.c:166
static void pushval_morph(Datum opaque, TSQueryParserState state, char *strval, int lenval, int16 weight, bool prefix)
Definition: to_tsany.c:491
Datum get_current_ts_config(PG_FUNCTION_ARGS)
Definition: to_tsany.c:49
Datum websearch_to_tsquery(PG_FUNCTION_ARGS)
Definition: to_tsany.c:713
Datum to_tsquery_byid(PG_FUNCTION_ARGS)
Definition: to_tsany.c:578
Datum json_string_to_tsvector_byid(PG_FUNCTION_ARGS)
Definition: to_tsany.c:379
Datum jsonb_string_to_tsvector(PG_FUNCTION_ARGS)
Definition: to_tsany.c:313
static int uniqueWORD(ParsedWord *a, int32 l)
Definition: to_tsany.c:78
Datum websearch_to_tsquery_byid(PG_FUNCTION_ARGS)
Definition: to_tsany.c:688
Datum plainto_tsquery(PG_FUNCTION_ARGS)
Definition: to_tsany.c:639
Oid getTSCurrentConfig(bool emitError)
Definition: ts_cache.c:556
void parsetext(Oid cfgId, ParsedText *prs, char *buf, int buflen)
Definition: ts_parse.c:354
#define TSL_PREFIX
Definition: ts_public.h:116
#define PG_RETURN_TSVECTOR(x)
Definition: ts_type.h:122
#define MAXENTRYPOS
Definition: ts_type.h:85
#define WEP_SETPOS(x, v)
Definition: ts_type.h:83
uint16 WordEntryPos
Definition: ts_type.h:63
#define PG_RETURN_TSQUERY(x)
Definition: ts_type.h:238
#define MAXNUMPOS
Definition: ts_type.h:86
TSVectorData * TSVector
Definition: ts_type.h:98
#define WEP_SETWEIGHT(x, v)
Definition: ts_type.h:82
#define LIMITPOS(x)
Definition: ts_type.h:87
#define OP_AND
Definition: ts_type.h:165
#define OP_PHRASE
Definition: ts_type.h:167
#define OP_OR
Definition: ts_type.h:166
#define POSDATAPTR(x, e)
Definition: ts_type.h:111
#define MAXSTRPOS
Definition: ts_type.h:50
#define P_TSQ_PLAIN
Definition: ts_utils.h:61
#define P_TSQ_WEB
Definition: ts_utils.h:62
void pushValue(TSQueryParserState state, char *strval, int lenval, int16 weight, bool prefix)
Definition: tsquery.c:560
void pushOperator(TSQueryParserState state, int8 oper, int16 distance)
Definition: tsquery.c:511
void pushStop(TSQueryParserState state)
Definition: tsquery.c:596
TSQuery parse_tsquery(char *buf, PushFunction pushval, Datum opaque, int flags)
Definition: tsquery.c:783
int32 tsCompareString(char *a, int lena, char *b, int lenb, bool prefix)
Definition: tsvector_op.c:1153
char * text_to_cstring(const text *t)
Definition: varlena.c:221