PostgreSQL Source Code  git master
varlena.h File Reference
#include "nodes/pg_list.h"
#include "utils/sortsupport.h"
Include dependency graph for varlena.h:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Functions

int varstr_cmp (const char *arg1, int len1, const char *arg2, int len2, Oid collid)
 
void varstr_sortsupport (SortSupport ssup, Oid collid, bool bpchar)
 
int varstr_levenshtein (const char *source, int slen, const char *target, int tlen, int ins_c, int del_c, int sub_c, bool trusted)
 
int varstr_levenshtein_less_equal (const char *source, int slen, const char *target, int tlen, int ins_c, int del_c, int sub_c, int max_d, bool trusted)
 
ListtextToQualifiedNameList (text *textval)
 
bool SplitIdentifierString (char *rawstring, char separator, List **namelist)
 
bool SplitDirectoriesString (char *rawstring, char separator, List **namelist)
 
textreplace_text_regexp (text *src_text, void *regexp, text *replace_text, bool glob)
 

Function Documentation

◆ replace_text_regexp()

text* replace_text_regexp ( text src_text,
void *  regexp,
text replace_text,
bool  glob 
)

Definition at line 3938 of file varlena.c.

References appendBinaryStringInfo(), appendStringInfoRegexpSubstr(), appendStringInfoText(), buf, charlen_to_bytelen(), CHECK_FOR_INTERRUPTS, check_replace_text_has_escape_char(), cstring_to_text_with_len(), StringInfoData::data, ereport, errcode(), errmsg(), ERROR, initStringInfo(), StringInfoData::len, palloc(), pfree(), pg_mb2wchar_with_len(), pg_regerror(), pg_regexec(), REG_NOMATCH, REG_OKAY, REGEXP_REPLACE_BACKREF_CNT, regmatch_t::rm_eo, regmatch_t::rm_so, VARDATA_ANY, VARSIZE_ANY, and VARSIZE_ANY_EXHDR.

Referenced by textregexreplace(), and textregexreplace_noopt().

3940 {
3941  text *ret_text;
3942  regex_t *re = (regex_t *) regexp;
3943  int src_text_len = VARSIZE_ANY_EXHDR(src_text);
3946  pg_wchar *data;
3947  size_t data_len;
3948  int search_start;
3949  int data_pos;
3950  char *start_ptr;
3951  bool have_escape;
3952 
3953  initStringInfo(&buf);
3954 
3955  /* Convert data string to wide characters. */
3956  data = (pg_wchar *) palloc((src_text_len + 1) * sizeof(pg_wchar));
3957  data_len = pg_mb2wchar_with_len(VARDATA_ANY(src_text), data, src_text_len);
3958 
3959  /* Check whether replace_text has escape char. */
3960  have_escape = check_replace_text_has_escape_char(replace_text);
3961 
3962  /* start_ptr points to the data_pos'th character of src_text */
3963  start_ptr = (char *) VARDATA_ANY(src_text);
3964  data_pos = 0;
3965 
3966  search_start = 0;
3967  while (search_start <= data_len)
3968  {
3969  int regexec_result;
3970 
3972 
3973  regexec_result = pg_regexec(re,
3974  data,
3975  data_len,
3976  search_start,
3977  NULL, /* no details */
3979  pmatch,
3980  0);
3981 
3982  if (regexec_result == REG_NOMATCH)
3983  break;
3984 
3985  if (regexec_result != REG_OKAY)
3986  {
3987  char errMsg[100];
3988 
3990  pg_regerror(regexec_result, re, errMsg, sizeof(errMsg));
3991  ereport(ERROR,
3992  (errcode(ERRCODE_INVALID_REGULAR_EXPRESSION),
3993  errmsg("regular expression failed: %s", errMsg)));
3994  }
3995 
3996  /*
3997  * Copy the text to the left of the match position. Note we are given
3998  * character not byte indexes.
3999  */
4000  if (pmatch[0].rm_so - data_pos > 0)
4001  {
4002  int chunk_len;
4003 
4004  chunk_len = charlen_to_bytelen(start_ptr,
4005  pmatch[0].rm_so - data_pos);
4006  appendBinaryStringInfo(&buf, start_ptr, chunk_len);
4007 
4008  /*
4009  * Advance start_ptr over that text, to avoid multiple rescans of
4010  * it if the replace_text contains multiple back-references.
4011  */
4012  start_ptr += chunk_len;
4013  data_pos = pmatch[0].rm_so;
4014  }
4015 
4016  /*
4017  * Copy the replace_text. Process back references when the
4018  * replace_text has escape characters.
4019  */
4020  if (have_escape)
4021  appendStringInfoRegexpSubstr(&buf, replace_text, pmatch,
4022  start_ptr, data_pos);
4023  else
4024  appendStringInfoText(&buf, replace_text);
4025 
4026  /* Advance start_ptr and data_pos over the matched text. */
4027  start_ptr += charlen_to_bytelen(start_ptr,
4028  pmatch[0].rm_eo - data_pos);
4029  data_pos = pmatch[0].rm_eo;
4030 
4031  /*
4032  * When global option is off, replace the first instance only.
4033  */
4034  if (!glob)
4035  break;
4036 
4037  /*
4038  * Advance search position. Normally we start the next search at the
4039  * end of the previous match; but if the match was of zero length, we
4040  * have to advance by one character, or we'd just find the same match
4041  * again.
4042  */
4043  search_start = data_pos;
4044  if (pmatch[0].rm_so == pmatch[0].rm_eo)
4045  search_start++;
4046  }
4047 
4048  /*
4049  * Copy the text to the right of the last match.
4050  */
4051  if (data_pos < data_len)
4052  {
4053  int chunk_len;
4054 
4055  chunk_len = ((char *) src_text + VARSIZE_ANY(src_text)) - start_ptr;
4056  appendBinaryStringInfo(&buf, start_ptr, chunk_len);
4057  }
4058 
4059  ret_text = cstring_to_text_with_len(buf.data, buf.len);
4060  pfree(buf.data);
4061  pfree(data);
4062 
4063  return ret_text;
4064 }
#define VARDATA_ANY(PTR)
Definition: postgres.h:346
regoff_t rm_so
Definition: regex.h:85
int errcode(int sqlerrcode)
Definition: elog.c:575
regoff_t rm_eo
Definition: regex.h:86
void pfree(void *pointer)
Definition: mcxt.c:1031
#define REG_OKAY
Definition: regex.h:137
#define ERROR
Definition: elog.h:43
static bool check_replace_text_has_escape_char(const text *replace_text)
Definition: varlena.c:3800
static int charlen_to_bytelen(const char *p, int n)
Definition: varlena.c:735
static void appendStringInfoText(StringInfo str, const text *t)
Definition: varlena.c:3703
static char * buf
Definition: pg_test_fsync.c:67
text * cstring_to_text_with_len(const char *s, int len)
Definition: varlena.c:161
size_t pg_regerror(int errcode, const regex_t *preg, char *errbuf, size_t errbuf_size)
Definition: regerror.c:60
#define ereport(elevel, rest)
Definition: elog.h:122
unsigned int pg_wchar
Definition: mbprint.c:31
void initStringInfo(StringInfo str)
Definition: stringinfo.c:46
#define REGEXP_REPLACE_BACKREF_CNT
Definition: varlena.c:3927
#define VARSIZE_ANY(PTR)
Definition: postgres.h:333
int pg_mb2wchar_with_len(const char *from, pg_wchar *to, int len)
Definition: mbutils.c:723
static void appendStringInfoRegexpSubstr(StringInfo str, text *replace_text, regmatch_t *pmatch, char *start_ptr, int data_pos)
Definition: varlena.c:3833
int pg_regexec(regex_t *re, const chr *string, size_t len, size_t search_start, rm_detail_t *details, size_t nmatch, regmatch_t pmatch[], int flags)
Definition: regexec.c:172
#define VARSIZE_ANY_EXHDR(PTR)
Definition: postgres.h:339
void * palloc(Size size)
Definition: mcxt.c:924
int errmsg(const char *fmt,...)
Definition: elog.c:797
#define REG_NOMATCH
Definition: regex.h:138
Definition: c.h:516
#define CHECK_FOR_INTERRUPTS()
Definition: miscadmin.h:98
void appendBinaryStringInfo(StringInfo str, const char *data, int datalen)
Definition: stringinfo.c:208
Definition: regex.h:55

◆ SplitDirectoriesString()

bool SplitDirectoriesString ( char *  rawstring,
char  separator,
List **  namelist 
)

Definition at line 3417 of file varlena.c.

References canonicalize_path(), lappend(), MAXPGPATH, memmove, NIL, pstrdup(), and scanner_isspace().

Referenced by load_libraries(), and PostmasterMain().

3419 {
3420  char *nextp = rawstring;
3421  bool done = false;
3422 
3423  *namelist = NIL;
3424 
3425  while (scanner_isspace(*nextp))
3426  nextp++; /* skip leading whitespace */
3427 
3428  if (*nextp == '\0')
3429  return true; /* allow empty string */
3430 
3431  /* At the top of the loop, we are at start of a new directory. */
3432  do
3433  {
3434  char *curname;
3435  char *endp;
3436 
3437  if (*nextp == '"')
3438  {
3439  /* Quoted name --- collapse quote-quote pairs */
3440  curname = nextp + 1;
3441  for (;;)
3442  {
3443  endp = strchr(nextp + 1, '"');
3444  if (endp == NULL)
3445  return false; /* mismatched quotes */
3446  if (endp[1] != '"')
3447  break; /* found end of quoted name */
3448  /* Collapse adjacent quotes into one quote, and look again */
3449  memmove(endp, endp + 1, strlen(endp));
3450  nextp = endp;
3451  }
3452  /* endp now points at the terminating quote */
3453  nextp = endp + 1;
3454  }
3455  else
3456  {
3457  /* Unquoted name --- extends to separator or end of string */
3458  curname = endp = nextp;
3459  while (*nextp && *nextp != separator)
3460  {
3461  /* trailing whitespace should not be included in name */
3462  if (!scanner_isspace(*nextp))
3463  endp = nextp + 1;
3464  nextp++;
3465  }
3466  if (curname == endp)
3467  return false; /* empty unquoted name not allowed */
3468  }
3469 
3470  while (scanner_isspace(*nextp))
3471  nextp++; /* skip trailing whitespace */
3472 
3473  if (*nextp == separator)
3474  {
3475  nextp++;
3476  while (scanner_isspace(*nextp))
3477  nextp++; /* skip leading whitespace for next */
3478  /* we expect another name, so done remains false */
3479  }
3480  else if (*nextp == '\0')
3481  done = true;
3482  else
3483  return false; /* invalid syntax */
3484 
3485  /* Now safe to overwrite separator with a null */
3486  *endp = '\0';
3487 
3488  /* Truncate path if it's overlength */
3489  if (strlen(curname) >= MAXPGPATH)
3490  curname[MAXPGPATH - 1] = '\0';
3491 
3492  /*
3493  * Finished isolating current name --- add it to list
3494  */
3495  curname = pstrdup(curname);
3496  canonicalize_path(curname);
3497  *namelist = lappend(*namelist, curname);
3498 
3499  /* Loop back if we didn't reach end of string */
3500  } while (!done);
3501 
3502  return true;
3503 }
#define NIL
Definition: pg_list.h:69
char * pstrdup(const char *in)
Definition: mcxt.c:1161
void canonicalize_path(char *path)
Definition: path.c:254
#define MAXPGPATH
#define memmove(d, s, c)
Definition: c.h:1100
List * lappend(List *list, void *datum)
Definition: list.c:128
bool scanner_isspace(char ch)
Definition: scansup.c:221

◆ SplitIdentifierString()

bool SplitIdentifierString ( char *  rawstring,
char  separator,
List **  namelist 
)

Definition at line 3290 of file varlena.c.

References Assert, downcase_truncate_identifier(), lappend(), memmove, NIL, pfree(), scanner_isspace(), and truncate_identifier().

Referenced by check_datestyle(), check_log_destination(), check_search_path(), check_temp_tablespaces(), check_wal_consistency_checking(), ExtractExtensionList(), parse_extension_control_file(), parse_hba_auth_opt(), parse_output_parameters(), parse_publication_options(), plpgsql_extra_checks_check_hook(), PostmasterMain(), PrepareTempTablespaces(), recomputeNamespacePath(), stringToQualifiedNameList(), and textToQualifiedNameList().

3292 {
3293  char *nextp = rawstring;
3294  bool done = false;
3295 
3296  *namelist = NIL;
3297 
3298  while (scanner_isspace(*nextp))
3299  nextp++; /* skip leading whitespace */
3300 
3301  if (*nextp == '\0')
3302  return true; /* allow empty string */
3303 
3304  /* At the top of the loop, we are at start of a new identifier. */
3305  do
3306  {
3307  char *curname;
3308  char *endp;
3309 
3310  if (*nextp == '"')
3311  {
3312  /* Quoted name --- collapse quote-quote pairs, no downcasing */
3313  curname = nextp + 1;
3314  for (;;)
3315  {
3316  endp = strchr(nextp + 1, '"');
3317  if (endp == NULL)
3318  return false; /* mismatched quotes */
3319  if (endp[1] != '"')
3320  break; /* found end of quoted name */
3321  /* Collapse adjacent quotes into one quote, and look again */
3322  memmove(endp, endp + 1, strlen(endp));
3323  nextp = endp;
3324  }
3325  /* endp now points at the terminating quote */
3326  nextp = endp + 1;
3327  }
3328  else
3329  {
3330  /* Unquoted name --- extends to separator or whitespace */
3331  char *downname;
3332  int len;
3333 
3334  curname = nextp;
3335  while (*nextp && *nextp != separator &&
3336  !scanner_isspace(*nextp))
3337  nextp++;
3338  endp = nextp;
3339  if (curname == nextp)
3340  return false; /* empty unquoted name not allowed */
3341 
3342  /*
3343  * Downcase the identifier, using same code as main lexer does.
3344  *
3345  * XXX because we want to overwrite the input in-place, we cannot
3346  * support a downcasing transformation that increases the string
3347  * length. This is not a problem given the current implementation
3348  * of downcase_truncate_identifier, but we'll probably have to do
3349  * something about this someday.
3350  */
3351  len = endp - curname;
3352  downname = downcase_truncate_identifier(curname, len, false);
3353  Assert(strlen(downname) <= len);
3354  strncpy(curname, downname, len); /* strncpy is required here */
3355  pfree(downname);
3356  }
3357 
3358  while (scanner_isspace(*nextp))
3359  nextp++; /* skip trailing whitespace */
3360 
3361  if (*nextp == separator)
3362  {
3363  nextp++;
3364  while (scanner_isspace(*nextp))
3365  nextp++; /* skip leading whitespace for next */
3366  /* we expect another name, so done remains false */
3367  }
3368  else if (*nextp == '\0')
3369  done = true;
3370  else
3371  return false; /* invalid syntax */
3372 
3373  /* Now safe to overwrite separator with a null */
3374  *endp = '\0';
3375 
3376  /* Truncate name if it's overlength */
3377  truncate_identifier(curname, strlen(curname), false);
3378 
3379  /*
3380  * Finished isolating current name --- add it to list
3381  */
3382  *namelist = lappend(*namelist, curname);
3383 
3384  /* Loop back if we didn't reach end of string */
3385  } while (!done);
3386 
3387  return true;
3388 }
#define NIL
Definition: pg_list.h:69
char * downcase_truncate_identifier(const char *ident, int len, bool warn)
Definition: scansup.c:131
void truncate_identifier(char *ident, int len, bool warn)
Definition: scansup.c:187
void pfree(void *pointer)
Definition: mcxt.c:1031
#define memmove(d, s, c)
Definition: c.h:1100
List * lappend(List *list, void *datum)
Definition: list.c:128
bool scanner_isspace(char ch)
Definition: scansup.c:221
#define Assert(condition)
Definition: c.h:699

◆ textToQualifiedNameList()

List* textToQualifiedNameList ( text textval)

Definition at line 3232 of file varlena.c.

References ereport, errcode(), errmsg(), ERROR, lappend(), lfirst, list_free(), makeString(), NIL, pfree(), pstrdup(), SplitIdentifierString(), and text_to_cstring().

Referenced by bt_metap(), bt_page_items(), bt_page_stats(), convert_table_name(), currtid_byrelname(), get_raw_page_internal(), get_rel_from_relname(), nextval(), pg_get_serial_sequence(), pg_get_viewdef_name(), pg_get_viewdef_name_ext(), pg_relpages(), pg_relpages_v1_5(), pgrowlocks(), pgstatindex(), pgstatindex_v1_5(), pgstattuple(), pgstattuple_v1_5(), row_security_active_name(), text_regclass(), ts_parse_byname(), and ts_token_type_byname().

3233 {
3234  char *rawname;
3235  List *result = NIL;
3236  List *namelist;
3237  ListCell *l;
3238 
3239  /* Convert to C string (handles possible detoasting). */
3240  /* Note we rely on being able to modify rawname below. */
3241  rawname = text_to_cstring(textval);
3242 
3243  if (!SplitIdentifierString(rawname, '.', &namelist))
3244  ereport(ERROR,
3245  (errcode(ERRCODE_INVALID_NAME),
3246  errmsg("invalid name syntax")));
3247 
3248  if (namelist == NIL)
3249  ereport(ERROR,
3250  (errcode(ERRCODE_INVALID_NAME),
3251  errmsg("invalid name syntax")));
3252 
3253  foreach(l, namelist)
3254  {
3255  char *curname = (char *) lfirst(l);
3256 
3257  result = lappend(result, makeString(pstrdup(curname)));
3258  }
3259 
3260  pfree(rawname);
3261  list_free(namelist);
3262 
3263  return result;
3264 }
Value * makeString(char *str)
Definition: value.c:53
#define NIL
Definition: pg_list.h:69
char * pstrdup(const char *in)
Definition: mcxt.c:1161
int errcode(int sqlerrcode)
Definition: elog.c:575
void pfree(void *pointer)
Definition: mcxt.c:1031
#define ERROR
Definition: elog.h:43
bool SplitIdentifierString(char *rawstring, char separator, List **namelist)
Definition: varlena.c:3290
#define ereport(elevel, rest)
Definition: elog.h:122
List * lappend(List *list, void *datum)
Definition: list.c:128
#define lfirst(lc)
Definition: pg_list.h:106
char * text_to_cstring(const text *t)
Definition: varlena.c:182
int errmsg(const char *fmt,...)
Definition: elog.c:797
void list_free(List *list)
Definition: list.c:1133
Definition: pg_list.h:45

◆ varstr_cmp()

int varstr_cmp ( const char *  arg1,
int  len1,
const char *  arg2,
int  len2,
Oid  collid 
)

Definition at line 1381 of file varlena.c.

References elog, ereport, errcode(), errhint(), errmsg(), ERROR, GetDatabaseEncoding(), pg_locale_struct::info, lc_collate_is_c(), Min, OidIsValid, palloc(), pfree(), pg_newlocale_from_collation(), PG_UTF8, pg_locale_struct::provider, status(), strcoll_l, TEXTBUFLEN, and wcscoll_l.

Referenced by bpchar_larger(), bpchar_smaller(), bpcharcmp(), bpcharge(), bpchargt(), bpcharle(), bpcharlt(), citextcmp(), compareJsonbScalarValue(), gin_compare_jsonb(), make_greater_string(), spg_text_leaf_consistent(), and text_cmp().

1382 {
1383  int result;
1384 
1385  /*
1386  * Unfortunately, there is no strncoll(), so in the non-C locale case we
1387  * have to do some memory copying. This turns out to be significantly
1388  * slower, so we optimize the case where LC_COLLATE is C. We also try to
1389  * optimize relatively-short strings by avoiding palloc/pfree overhead.
1390  */
1391  if (lc_collate_is_c(collid))
1392  {
1393  result = memcmp(arg1, arg2, Min(len1, len2));
1394  if ((result == 0) && (len1 != len2))
1395  result = (len1 < len2) ? -1 : 1;
1396  }
1397  else
1398  {
1399  char a1buf[TEXTBUFLEN];
1400  char a2buf[TEXTBUFLEN];
1401  char *a1p,
1402  *a2p;
1403  pg_locale_t mylocale = 0;
1404 
1405  if (collid != DEFAULT_COLLATION_OID)
1406  {
1407  if (!OidIsValid(collid))
1408  {
1409  /*
1410  * This typically means that the parser could not resolve a
1411  * conflict of implicit collations, so report it that way.
1412  */
1413  ereport(ERROR,
1414  (errcode(ERRCODE_INDETERMINATE_COLLATION),
1415  errmsg("could not determine which collation to use for string comparison"),
1416  errhint("Use the COLLATE clause to set the collation explicitly.")));
1417  }
1418  mylocale = pg_newlocale_from_collation(collid);
1419  }
1420 
1421  /*
1422  * memcmp() can't tell us which of two unequal strings sorts first,
1423  * but it's a cheap way to tell if they're equal. Testing shows that
1424  * memcmp() followed by strcoll() is only trivially slower than
1425  * strcoll() by itself, so we don't lose much if this doesn't work out
1426  * very often, and if it does - for example, because there are many
1427  * equal strings in the input - then we win big by avoiding expensive
1428  * collation-aware comparisons.
1429  */
1430  if (len1 == len2 && memcmp(arg1, arg2, len1) == 0)
1431  return 0;
1432 
1433 #ifdef WIN32
1434  /* Win32 does not have UTF-8, so we need to map to UTF-16 */
1435  if (GetDatabaseEncoding() == PG_UTF8
1436  && (!mylocale || mylocale->provider == COLLPROVIDER_LIBC))
1437  {
1438  int a1len;
1439  int a2len;
1440  int r;
1441 
1442  if (len1 >= TEXTBUFLEN / 2)
1443  {
1444  a1len = len1 * 2 + 2;
1445  a1p = palloc(a1len);
1446  }
1447  else
1448  {
1449  a1len = TEXTBUFLEN;
1450  a1p = a1buf;
1451  }
1452  if (len2 >= TEXTBUFLEN / 2)
1453  {
1454  a2len = len2 * 2 + 2;
1455  a2p = palloc(a2len);
1456  }
1457  else
1458  {
1459  a2len = TEXTBUFLEN;
1460  a2p = a2buf;
1461  }
1462 
1463  /* stupid Microsloth API does not work for zero-length input */
1464  if (len1 == 0)
1465  r = 0;
1466  else
1467  {
1468  r = MultiByteToWideChar(CP_UTF8, 0, arg1, len1,
1469  (LPWSTR) a1p, a1len / 2);
1470  if (!r)
1471  ereport(ERROR,
1472  (errmsg("could not convert string to UTF-16: error code %lu",
1473  GetLastError())));
1474  }
1475  ((LPWSTR) a1p)[r] = 0;
1476 
1477  if (len2 == 0)
1478  r = 0;
1479  else
1480  {
1481  r = MultiByteToWideChar(CP_UTF8, 0, arg2, len2,
1482  (LPWSTR) a2p, a2len / 2);
1483  if (!r)
1484  ereport(ERROR,
1485  (errmsg("could not convert string to UTF-16: error code %lu",
1486  GetLastError())));
1487  }
1488  ((LPWSTR) a2p)[r] = 0;
1489 
1490  errno = 0;
1491 #ifdef HAVE_LOCALE_T
1492  if (mylocale)
1493  result = wcscoll_l((LPWSTR) a1p, (LPWSTR) a2p, mylocale->info.lt);
1494  else
1495 #endif
1496  result = wcscoll((LPWSTR) a1p, (LPWSTR) a2p);
1497  if (result == 2147483647) /* _NLSCMPERROR; missing from mingw
1498  * headers */
1499  ereport(ERROR,
1500  (errmsg("could not compare Unicode strings: %m")));
1501 
1502  /*
1503  * In some locales wcscoll() can claim that nonidentical strings
1504  * are equal. Believing that would be bad news for a number of
1505  * reasons, so we follow Perl's lead and sort "equal" strings
1506  * according to strcmp (on the UTF-8 representation).
1507  */
1508  if (result == 0)
1509  {
1510  result = memcmp(arg1, arg2, Min(len1, len2));
1511  if ((result == 0) && (len1 != len2))
1512  result = (len1 < len2) ? -1 : 1;
1513  }
1514 
1515  if (a1p != a1buf)
1516  pfree(a1p);
1517  if (a2p != a2buf)
1518  pfree(a2p);
1519 
1520  return result;
1521  }
1522 #endif /* WIN32 */
1523 
1524  if (len1 >= TEXTBUFLEN)
1525  a1p = (char *) palloc(len1 + 1);
1526  else
1527  a1p = a1buf;
1528  if (len2 >= TEXTBUFLEN)
1529  a2p = (char *) palloc(len2 + 1);
1530  else
1531  a2p = a2buf;
1532 
1533  memcpy(a1p, arg1, len1);
1534  a1p[len1] = '\0';
1535  memcpy(a2p, arg2, len2);
1536  a2p[len2] = '\0';
1537 
1538  if (mylocale)
1539  {
1540  if (mylocale->provider == COLLPROVIDER_ICU)
1541  {
1542 #ifdef USE_ICU
1543 #ifdef HAVE_UCOL_STRCOLLUTF8
1544  if (GetDatabaseEncoding() == PG_UTF8)
1545  {
1546  UErrorCode status;
1547 
1548  status = U_ZERO_ERROR;
1549  result = ucol_strcollUTF8(mylocale->info.icu.ucol,
1550  arg1, len1,
1551  arg2, len2,
1552  &status);
1553  if (U_FAILURE(status))
1554  ereport(ERROR,
1555  (errmsg("collation failed: %s", u_errorName(status))));
1556  }
1557  else
1558 #endif
1559  {
1560  int32_t ulen1,
1561  ulen2;
1562  UChar *uchar1,
1563  *uchar2;
1564 
1565  ulen1 = icu_to_uchar(&uchar1, arg1, len1);
1566  ulen2 = icu_to_uchar(&uchar2, arg2, len2);
1567 
1568  result = ucol_strcoll(mylocale->info.icu.ucol,
1569  uchar1, ulen1,
1570  uchar2, ulen2);
1571 
1572  pfree(uchar1);
1573  pfree(uchar2);
1574  }
1575 #else /* not USE_ICU */
1576  /* shouldn't happen */
1577  elog(ERROR, "unsupported collprovider: %c", mylocale->provider);
1578 #endif /* not USE_ICU */
1579  }
1580  else
1581  {
1582 #ifdef HAVE_LOCALE_T
1583  result = strcoll_l(a1p, a2p, mylocale->info.lt);
1584 #else
1585  /* shouldn't happen */
1586  elog(ERROR, "unsupported collprovider: %c", mylocale->provider);
1587 #endif
1588  }
1589  }
1590  else
1591  result = strcoll(a1p, a2p);
1592 
1593  /*
1594  * In some locales strcoll() can claim that nonidentical strings are
1595  * equal. Believing that would be bad news for a number of reasons,
1596  * so we follow Perl's lead and sort "equal" strings according to
1597  * strcmp().
1598  */
1599  if (result == 0)
1600  result = strcmp(a1p, a2p);
1601 
1602  if (a1p != a1buf)
1603  pfree(a1p);
1604  if (a2p != a2buf)
1605  pfree(a2p);
1606  }
1607 
1608  return result;
1609 }
union pg_locale_struct::@130 info
int errhint(const char *fmt,...)
Definition: elog.c:987
#define Min(x, y)
Definition: c.h:857
int errcode(int sqlerrcode)
Definition: elog.c:575
#define OidIsValid(objectId)
Definition: c.h:605
void pfree(void *pointer)
Definition: mcxt.c:1031
#define ERROR
Definition: elog.h:43
bool lc_collate_is_c(Oid collation)
Definition: pg_locale.c:1128
#define strcoll_l
Definition: win32_port.h:397
#define ereport(elevel, rest)
Definition: elog.h:122
pg_locale_t pg_newlocale_from_collation(Oid collid)
Definition: pg_locale.c:1275
int GetDatabaseEncoding(void)
Definition: mbutils.c:1004
#define wcscoll_l
Definition: win32_port.h:399
#define TEXTBUFLEN
Definition: varlena.c:83
void * palloc(Size size)
Definition: mcxt.c:924
int errmsg(const char *fmt,...)
Definition: elog.c:797
int int32_t
Definition: crypt.c:108
#define elog
Definition: elog.h:219
static void static void status(const char *fmt,...) pg_attribute_printf(1
Definition: pg_regress.c:225

◆ varstr_levenshtein()

int varstr_levenshtein ( const char *  source,
int  slen,
const char *  target,
int  tlen,
int  ins_c,
int  del_c,
int  sub_c,
bool  trusted 
)

Definition at line 73 of file levenshtein.c.

References ereport, errcode(), errmsg(), ERROR, i, MAX_LEVENSHTEIN_STRLEN, Min, palloc(), pg_mblen(), pg_mbstrlen_with_len(), rest_of_char_same(), START_COLUMN, and STOP_COLUMN.

Referenced by levenshtein(), and levenshtein_with_costs().

78 {
79  int m,
80  n;
81  int *prev;
82  int *curr;
83  int *s_char_len = NULL;
84  int i,
85  j;
86  const char *y;
87 
88  /*
89  * For varstr_levenshtein_less_equal, we have real variables called
90  * start_column and stop_column; otherwise it's just short-hand for 0 and
91  * m.
92  */
93 #ifdef LEVENSHTEIN_LESS_EQUAL
94  int start_column,
95  stop_column;
96 
97 #undef START_COLUMN
98 #undef STOP_COLUMN
99 #define START_COLUMN start_column
100 #define STOP_COLUMN stop_column
101 #else
102 #undef START_COLUMN
103 #undef STOP_COLUMN
104 #define START_COLUMN 0
105 #define STOP_COLUMN m
106 #endif
107 
108  /* Convert string lengths (in bytes) to lengths in characters */
109  m = pg_mbstrlen_with_len(source, slen);
110  n = pg_mbstrlen_with_len(target, tlen);
111 
112  /*
113  * We can transform an empty s into t with n insertions, or a non-empty t
114  * into an empty s with m deletions.
115  */
116  if (!m)
117  return n * ins_c;
118  if (!n)
119  return m * del_c;
120 
121  /*
122  * For security concerns, restrict excessive CPU+RAM usage. (This
123  * implementation uses O(m) memory and has O(mn) complexity.) If
124  * "trusted" is true, caller is responsible for not making excessive
125  * requests, typically by using a small max_d along with strings that are
126  * bounded, though not necessarily to MAX_LEVENSHTEIN_STRLEN exactly.
127  */
128  if (!trusted &&
129  (m > MAX_LEVENSHTEIN_STRLEN ||
131  ereport(ERROR,
132  (errcode(ERRCODE_INVALID_PARAMETER_VALUE),
133  errmsg("levenshtein argument exceeds maximum length of %d characters",
135 
136 #ifdef LEVENSHTEIN_LESS_EQUAL
137  /* Initialize start and stop columns. */
138  start_column = 0;
139  stop_column = m + 1;
140 
141  /*
142  * If max_d >= 0, determine whether the bound is impossibly tight. If so,
143  * return max_d + 1 immediately. Otherwise, determine whether it's tight
144  * enough to limit the computation we must perform. If so, figure out
145  * initial stop column.
146  */
147  if (max_d >= 0)
148  {
149  int min_theo_d; /* Theoretical minimum distance. */
150  int max_theo_d; /* Theoretical maximum distance. */
151  int net_inserts = n - m;
152 
153  min_theo_d = net_inserts < 0 ?
154  -net_inserts * del_c : net_inserts * ins_c;
155  if (min_theo_d > max_d)
156  return max_d + 1;
157  if (ins_c + del_c < sub_c)
158  sub_c = ins_c + del_c;
159  max_theo_d = min_theo_d + sub_c * Min(m, n);
160  if (max_d >= max_theo_d)
161  max_d = -1;
162  else if (ins_c + del_c > 0)
163  {
164  /*
165  * Figure out how much of the first row of the notional matrix we
166  * need to fill in. If the string is growing, the theoretical
167  * minimum distance already incorporates the cost of deleting the
168  * number of characters necessary to make the two strings equal in
169  * length. Each additional deletion forces another insertion, so
170  * the best-case total cost increases by ins_c + del_c. If the
171  * string is shrinking, the minimum theoretical cost assumes no
172  * excess deletions; that is, we're starting no further right than
173  * column n - m. If we do start further right, the best-case
174  * total cost increases by ins_c + del_c for each move right.
175  */
176  int slack_d = max_d - min_theo_d;
177  int best_column = net_inserts < 0 ? -net_inserts : 0;
178 
179  stop_column = best_column + (slack_d / (ins_c + del_c)) + 1;
180  if (stop_column > m)
181  stop_column = m + 1;
182  }
183  }
184 #endif
185 
186  /*
187  * In order to avoid calling pg_mblen() repeatedly on each character in s,
188  * we cache all the lengths before starting the main loop -- but if all
189  * the characters in both strings are single byte, then we skip this and
190  * use a fast-path in the main loop. If only one string contains
191  * multi-byte characters, we still build the array, so that the fast-path
192  * needn't deal with the case where the array hasn't been initialized.
193  */
194  if (m != slen || n != tlen)
195  {
196  int i;
197  const char *cp = source;
198 
199  s_char_len = (int *) palloc((m + 1) * sizeof(int));
200  for (i = 0; i < m; ++i)
201  {
202  s_char_len[i] = pg_mblen(cp);
203  cp += s_char_len[i];
204  }
205  s_char_len[i] = 0;
206  }
207 
208  /* One more cell for initialization column and row. */
209  ++m;
210  ++n;
211 
212  /* Previous and current rows of notional array. */
213  prev = (int *) palloc(2 * m * sizeof(int));
214  curr = prev + m;
215 
216  /*
217  * To transform the first i characters of s into the first 0 characters of
218  * t, we must perform i deletions.
219  */
220  for (i = START_COLUMN; i < STOP_COLUMN; i++)
221  prev[i] = i * del_c;
222 
223  /* Loop through rows of the notional array */
224  for (y = target, j = 1; j < n; j++)
225  {
226  int *temp;
227  const char *x = source;
228  int y_char_len = n != tlen + 1 ? pg_mblen(y) : 1;
229 
230 #ifdef LEVENSHTEIN_LESS_EQUAL
231 
232  /*
233  * In the best case, values percolate down the diagonal unchanged, so
234  * we must increment stop_column unless it's already on the right end
235  * of the array. The inner loop will read prev[stop_column], so we
236  * have to initialize it even though it shouldn't affect the result.
237  */
238  if (stop_column < m)
239  {
240  prev[stop_column] = max_d + 1;
241  ++stop_column;
242  }
243 
244  /*
245  * The main loop fills in curr, but curr[0] needs a special case: to
246  * transform the first 0 characters of s into the first j characters
247  * of t, we must perform j insertions. However, if start_column > 0,
248  * this special case does not apply.
249  */
250  if (start_column == 0)
251  {
252  curr[0] = j * ins_c;
253  i = 1;
254  }
255  else
256  i = start_column;
257 #else
258  curr[0] = j * ins_c;
259  i = 1;
260 #endif
261 
262  /*
263  * This inner loop is critical to performance, so we include a
264  * fast-path to handle the (fairly common) case where no multibyte
265  * characters are in the mix. The fast-path is entitled to assume
266  * that if s_char_len is not initialized then BOTH strings contain
267  * only single-byte characters.
268  */
269  if (s_char_len != NULL)
270  {
271  for (; i < STOP_COLUMN; i++)
272  {
273  int ins;
274  int del;
275  int sub;
276  int x_char_len = s_char_len[i - 1];
277 
278  /*
279  * Calculate costs for insertion, deletion, and substitution.
280  *
281  * When calculating cost for substitution, we compare the last
282  * character of each possibly-multibyte character first,
283  * because that's enough to rule out most mis-matches. If we
284  * get past that test, then we compare the lengths and the
285  * remaining bytes.
286  */
287  ins = prev[i] + ins_c;
288  del = curr[i - 1] + del_c;
289  if (x[x_char_len - 1] == y[y_char_len - 1]
290  && x_char_len == y_char_len &&
291  (x_char_len == 1 || rest_of_char_same(x, y, x_char_len)))
292  sub = prev[i - 1];
293  else
294  sub = prev[i - 1] + sub_c;
295 
296  /* Take the one with minimum cost. */
297  curr[i] = Min(ins, del);
298  curr[i] = Min(curr[i], sub);
299 
300  /* Point to next character. */
301  x += x_char_len;
302  }
303  }
304  else
305  {
306  for (; i < STOP_COLUMN; i++)
307  {
308  int ins;
309  int del;
310  int sub;
311 
312  /* Calculate costs for insertion, deletion, and substitution. */
313  ins = prev[i] + ins_c;
314  del = curr[i - 1] + del_c;
315  sub = prev[i - 1] + ((*x == *y) ? 0 : sub_c);
316 
317  /* Take the one with minimum cost. */
318  curr[i] = Min(ins, del);
319  curr[i] = Min(curr[i], sub);
320 
321  /* Point to next character. */
322  x++;
323  }
324  }
325 
326  /* Swap current row with previous row. */
327  temp = curr;
328  curr = prev;
329  prev = temp;
330 
331  /* Point to next character. */
332  y += y_char_len;
333 
334 #ifdef LEVENSHTEIN_LESS_EQUAL
335 
336  /*
337  * This chunk of code represents a significant performance hit if used
338  * in the case where there is no max_d bound. This is probably not
339  * because the max_d >= 0 test itself is expensive, but rather because
340  * the possibility of needing to execute this code prevents tight
341  * optimization of the loop as a whole.
342  */
343  if (max_d >= 0)
344  {
345  /*
346  * The "zero point" is the column of the current row where the
347  * remaining portions of the strings are of equal length. There
348  * are (n - 1) characters in the target string, of which j have
349  * been transformed. There are (m - 1) characters in the source
350  * string, so we want to find the value for zp where (n - 1) - j =
351  * (m - 1) - zp.
352  */
353  int zp = j - (n - m);
354 
355  /* Check whether the stop column can slide left. */
356  while (stop_column > 0)
357  {
358  int ii = stop_column - 1;
359  int net_inserts = ii - zp;
360 
361  if (prev[ii] + (net_inserts > 0 ? net_inserts * ins_c :
362  -net_inserts * del_c) <= max_d)
363  break;
364  stop_column--;
365  }
366 
367  /* Check whether the start column can slide right. */
368  while (start_column < stop_column)
369  {
370  int net_inserts = start_column - zp;
371 
372  if (prev[start_column] +
373  (net_inserts > 0 ? net_inserts * ins_c :
374  -net_inserts * del_c) <= max_d)
375  break;
376 
377  /*
378  * We'll never again update these values, so we must make sure
379  * there's nothing here that could confuse any future
380  * iteration of the outer loop.
381  */
382  prev[start_column] = max_d + 1;
383  curr[start_column] = max_d + 1;
384  if (start_column != 0)
385  source += (s_char_len != NULL) ? s_char_len[start_column - 1] : 1;
386  start_column++;
387  }
388 
389  /* If they cross, we're going to exceed the bound. */
390  if (start_column >= stop_column)
391  return max_d + 1;
392  }
393 #endif
394  }
395 
396  /*
397  * Because the final value was swapped from the previous row to the
398  * current row, that's where we'll find it.
399  */
400  return prev[m - 1];
401 }
#define Min(x, y)
Definition: c.h:857
int errcode(int sqlerrcode)
Definition: elog.c:575
int pg_mbstrlen_with_len(const char *mbstr, int limit)
Definition: mbutils.c:794
#define STOP_COLUMN
#define ERROR
Definition: elog.h:43
#define START_COLUMN
#define ereport(elevel, rest)
Definition: elog.h:122
#define MAX_LEVENSHTEIN_STRLEN
Definition: levenshtein.c:26
static bool rest_of_char_same(const char *s1, const char *s2, int len)
Definition: varlena.c:5490
int pg_mblen(const char *mbstr)
Definition: mbutils.c:760
void * palloc(Size size)
Definition: mcxt.c:924
int errmsg(const char *fmt,...)
Definition: elog.c:797
int i

◆ varstr_levenshtein_less_equal()

int varstr_levenshtein_less_equal ( const char *  source,
int  slen,
const char *  target,
int  tlen,
int  ins_c,
int  del_c,
int  sub_c,
int  max_d,
bool  trusted 
)

◆ varstr_sortsupport()

void varstr_sortsupport ( SortSupport  ssup,
Oid  collid,
bool  bpchar 
)

Definition at line 1835 of file varlena.c.

References VarStringSortSupport::abbr_card, SortSupportData::abbrev_abort, SortSupportData::abbrev_converter, SortSupportData::abbrev_full_comparator, SortSupportData::abbreviate, VarStringSortSupport::bpchar, bpchar(), bpcharfastcmp_c(), VarStringSortSupport::buf1, VarStringSortSupport::buf2, VarStringSortSupport::buflen1, VarStringSortSupport::buflen2, VarStringSortSupport::cache_blob, VarStringSortSupport::collate_c, SortSupportData::comparator, ereport, errcode(), errhint(), errmsg(), ERROR, VarStringSortSupport::full_card, GetDatabaseEncoding(), initHyperLogLog(), VarStringSortSupport::last_len1, VarStringSortSupport::last_len2, VarStringSortSupport::last_returned, lc_collate_is_c(), VarStringSortSupport::locale, locale, OidIsValid, palloc(), pg_newlocale_from_collation(), PG_UTF8, VarStringSortSupport::prop_card, pg_locale_struct::provider, SortSupportData::ssup_extra, TEXTBUFLEN, varstr_abbrev_abort(), varstr_abbrev_convert(), varstrcmp_abbrev(), varstrfastcmp_c(), and varstrfastcmp_locale().

Referenced by bpchar_sortsupport(), btbpchar_pattern_sortsupport(), bttext_pattern_sortsupport(), bttextsortsupport(), and bytea_sortsupport().

1836 {
1837  bool abbreviate = ssup->abbreviate;
1838  bool collate_c = false;
1839  VarStringSortSupport *sss;
1840  pg_locale_t locale = 0;
1841 
1842  /*
1843  * If possible, set ssup->comparator to a function which can be used to
1844  * directly compare two datums. If we can do this, we'll avoid the
1845  * overhead of a trip through the fmgr layer for every comparison, which
1846  * can be substantial.
1847  *
1848  * Most typically, we'll set the comparator to varstrfastcmp_locale, which
1849  * uses strcoll() to perform comparisons and knows about the special
1850  * requirements of BpChar callers. However, if LC_COLLATE = C, we can
1851  * make things quite a bit faster with varstrfastcmp_c or bpcharfastcmp_c,
1852  * both of which use memcmp() rather than strcoll().
1853  */
1854  if (lc_collate_is_c(collid))
1855  {
1856  if (!bpchar)
1857  ssup->comparator = varstrfastcmp_c;
1858  else
1859  ssup->comparator = bpcharfastcmp_c;
1860 
1861  collate_c = true;
1862  }
1863  else
1864  {
1865  /*
1866  * We need a collation-sensitive comparison. To make things faster,
1867  * we'll figure out the collation based on the locale id and cache the
1868  * result.
1869  */
1870  if (collid != DEFAULT_COLLATION_OID)
1871  {
1872  if (!OidIsValid(collid))
1873  {
1874  /*
1875  * This typically means that the parser could not resolve a
1876  * conflict of implicit collations, so report it that way.
1877  */
1878  ereport(ERROR,
1879  (errcode(ERRCODE_INDETERMINATE_COLLATION),
1880  errmsg("could not determine which collation to use for string comparison"),
1881  errhint("Use the COLLATE clause to set the collation explicitly.")));
1882  }
1883  locale = pg_newlocale_from_collation(collid);
1884  }
1885 
1886  /*
1887  * There is a further exception on Windows. When the database
1888  * encoding is UTF-8 and we are not using the C collation, complex
1889  * hacks are required. We don't currently have a comparator that
1890  * handles that case, so we fall back on the slow method of having the
1891  * sort code invoke bttextcmp() (in the case of text) via the fmgr
1892  * trampoline. ICU locales work just the same on Windows, however.
1893  */
1894 #ifdef WIN32
1895  if (GetDatabaseEncoding() == PG_UTF8 &&
1896  !(locale && locale->provider == COLLPROVIDER_ICU))
1897  return;
1898 #endif
1899 
1901  }
1902 
1903  /*
1904  * Unfortunately, it seems that abbreviation for non-C collations is
1905  * broken on many common platforms; testing of multiple versions of glibc
1906  * reveals that, for many locales, strcoll() and strxfrm() do not return
1907  * consistent results, which is fatal to this optimization. While no
1908  * other libc other than Cygwin has so far been shown to have a problem,
1909  * we take the conservative course of action for right now and disable
1910  * this categorically. (Users who are certain this isn't a problem on
1911  * their system can define TRUST_STRXFRM.)
1912  *
1913  * Even apart from the risk of broken locales, it's possible that there
1914  * are platforms where the use of abbreviated keys should be disabled at
1915  * compile time. Having only 4 byte datums could make worst-case
1916  * performance drastically more likely, for example. Moreover, macOS's
1917  * strxfrm() implementation is known to not effectively concentrate a
1918  * significant amount of entropy from the original string in earlier
1919  * transformed blobs. It's possible that other supported platforms are
1920  * similarly encumbered. So, if we ever get past disabling this
1921  * categorically, we may still want or need to disable it for particular
1922  * platforms.
1923  */
1924 #ifndef TRUST_STRXFRM
1925  if (!collate_c && !(locale && locale->provider == COLLPROVIDER_ICU))
1926  abbreviate = false;
1927 #endif
1928 
1929  /*
1930  * If we're using abbreviated keys, or if we're using a locale-aware
1931  * comparison, we need to initialize a StringSortSupport object. Both
1932  * cases will make use of the temporary buffers we initialize here for
1933  * scratch space (and to detect requirement for BpChar semantics from
1934  * caller), and the abbreviation case requires additional state.
1935  */
1936  if (abbreviate || !collate_c)
1937  {
1938  sss = palloc(sizeof(VarStringSortSupport));
1939  sss->buf1 = palloc(TEXTBUFLEN);
1940  sss->buflen1 = TEXTBUFLEN;
1941  sss->buf2 = palloc(TEXTBUFLEN);
1942  sss->buflen2 = TEXTBUFLEN;
1943  /* Start with invalid values */
1944  sss->last_len1 = -1;
1945  sss->last_len2 = -1;
1946  /* Initialize */
1947  sss->last_returned = 0;
1948  sss->locale = locale;
1949 
1950  /*
1951  * To avoid somehow confusing a strxfrm() blob and an original string,
1952  * constantly keep track of the variety of data that buf1 and buf2
1953  * currently contain.
1954  *
1955  * Comparisons may be interleaved with conversion calls. Frequently,
1956  * conversions and comparisons are batched into two distinct phases,
1957  * but the correctness of caching cannot hinge upon this. For
1958  * comparison caching, buffer state is only trusted if cache_blob is
1959  * found set to false, whereas strxfrm() caching only trusts the state
1960  * when cache_blob is found set to true.
1961  *
1962  * Arbitrarily initialize cache_blob to true.
1963  */
1964  sss->cache_blob = true;
1965  sss->collate_c = collate_c;
1966  sss->bpchar = bpchar;
1967  ssup->ssup_extra = sss;
1968 
1969  /*
1970  * If possible, plan to use the abbreviated keys optimization. The
1971  * core code may switch back to authoritative comparator should
1972  * abbreviation be aborted.
1973  */
1974  if (abbreviate)
1975  {
1976  sss->prop_card = 0.20;
1977  initHyperLogLog(&sss->abbr_card, 10);
1978  initHyperLogLog(&sss->full_card, 10);
1979  ssup->abbrev_full_comparator = ssup->comparator;
1980  ssup->comparator = varstrcmp_abbrev;
1983  }
1984  }
1985 }
static int varstrfastcmp_locale(Datum x, Datum y, SortSupport ssup)
Definition: varlena.c:2061
static int bpcharfastcmp_c(Datum x, Datum y, SortSupport ssup)
Definition: varlena.c:2028
int errhint(const char *fmt,...)
Definition: elog.c:987
static Datum varstr_abbrev_convert(Datum original, SortSupport ssup)
Definition: varlena.c:2264
static int varstrcmp_abbrev(Datum x, Datum y, SortSupport ssup)
Definition: varlena.c:2239
int errcode(int sqlerrcode)
Definition: elog.c:575
#define OidIsValid(objectId)
Definition: c.h:605
static int varstrfastcmp_c(Datum x, Datum y, SortSupport ssup)
Definition: varlena.c:1991
void initHyperLogLog(hyperLogLogState *cState, uint8 bwidth)
Definition: hyperloglog.c:65
#define ERROR
Definition: elog.h:43
bool lc_collate_is_c(Oid collation)
Definition: pg_locale.c:1128
int(* comparator)(Datum x, Datum y, SortSupport ssup)
Definition: sortsupport.h:107
hyperLogLogState abbr_card
Definition: varlena.c:73
pg_locale_t locale
Definition: varlena.c:76
int(* abbrev_full_comparator)(Datum x, Datum y, SortSupport ssup)
Definition: sortsupport.h:192
Datum(* abbrev_converter)(Datum original, SortSupport ssup)
Definition: sortsupport.h:173
void * ssup_extra
Definition: sortsupport.h:87
#define ereport(elevel, rest)
Definition: elog.h:122
pg_locale_t pg_newlocale_from_collation(Oid collid)
Definition: pg_locale.c:1275
int GetDatabaseEncoding(void)
Definition: mbutils.c:1004
hyperLogLogState full_card
Definition: varlena.c:74
bool(* abbrev_abort)(int memtupcount, SortSupport ssup)
Definition: sortsupport.h:183
static bool varstr_abbrev_abort(int memtupcount, SortSupport ssup)
Definition: varlena.c:2504
#define TEXTBUFLEN
Definition: varlena.c:83
void * palloc(Size size)
Definition: mcxt.c:924
int errmsg(const char *fmt,...)
Definition: elog.c:797
static char * locale
Definition: initdb.c:124
Datum bpchar(PG_FUNCTION_ARGS)
Definition: varchar.c:267