mirror of
https://github.com/postgres/postgres.git
synced 2025-07-27 12:41:57 +03:00
Add sortsupport for gist_btree opclasses, for faster index builds.
Commit 16fa9b2b30
introduced a faster way to build GiST indexes, by
sorting all the data. This commit adds the sortsupport functions needed
to make use of that feature for btree_gist.
Author: Andrey Borodin
Discussion: https://www.postgresql.org/message-id/2F3F7265-0D22-44DB-AD71-8554C743D943@yandex-team.ru
This commit is contained in:
@ -25,6 +25,7 @@ PG_FUNCTION_INFO_V1(gbt_uuid_picksplit);
|
||||
PG_FUNCTION_INFO_V1(gbt_uuid_consistent);
|
||||
PG_FUNCTION_INFO_V1(gbt_uuid_penalty);
|
||||
PG_FUNCTION_INFO_V1(gbt_uuid_same);
|
||||
PG_FUNCTION_INFO_V1(gbt_uuid_sortsupport);
|
||||
|
||||
|
||||
static int
|
||||
@ -233,3 +234,27 @@ gbt_uuid_same(PG_FUNCTION_ARGS)
|
||||
*result = gbt_num_same((void *) b1, (void *) b2, &tinfo, fcinfo->flinfo);
|
||||
PG_RETURN_POINTER(result);
|
||||
}
|
||||
|
||||
static int
|
||||
gbt_uuid_sort_build_cmp(Datum a, Datum b, SortSupport ssup)
|
||||
{
|
||||
uuidKEY *ua = (uuidKEY *) DatumGetPointer(a);
|
||||
uuidKEY *ub = (uuidKEY *) DatumGetPointer(b);
|
||||
|
||||
return uuid_internal_cmp(&ua->lower, &ub->lower);
|
||||
}
|
||||
|
||||
/*
|
||||
* Sort support routine for fast GiST index build by sorting.
|
||||
*/
|
||||
Datum
|
||||
gbt_uuid_sortsupport(PG_FUNCTION_ARGS)
|
||||
{
|
||||
SortSupport ssup = (SortSupport) PG_GETARG_POINTER(0);
|
||||
|
||||
ssup->comparator = gbt_uuid_sort_build_cmp;
|
||||
ssup->abbrev_converter = NULL;
|
||||
ssup->abbrev_abort = NULL;
|
||||
ssup->abbrev_full_comparator = NULL;
|
||||
PG_RETURN_VOID();
|
||||
}
|
||||
|
Reference in New Issue
Block a user