btree_utils_var.c File Reference

#include "postgres.h"
#include <limits.h>
#include <float.h>
#include "btree_gist.h"
#include "btree_utils_var.h"
#include "utils/rel.h"
#include "varatt.h"

Include dependency graph for btree_utils_var.c:

Go to the source code of this file.

Data Structures
struct	Vsrt
struct	gbt_vsrt_arg

Macros
#define	lower_is_below_query()    (tinfo->f_cmp(key->lower, query, collation, flinfo) <= 0)
#define	upper_is_above_query()

Functions
	PG_FUNCTION_INFO_V1 (gbt_var_decompress)
	PG_FUNCTION_INFO_V1 (gbt_var_fetch)
Datum	gbt_var_decompress (PG_FUNCTION_ARGS)
GBT_VARKEY_R	gbt_var_key_readable (const GBT_VARKEY *k)
static GBT_VARKEY *	gbt_var_key_from_datum (const varlena *u)
GBT_VARKEY *	gbt_var_key_copy (const GBT_VARKEY_R *u)
static GBT_VARKEY *	gbt_var_leaf2node (GBT_VARKEY *leaf, const gbtree_vinfo *tinfo, FmgrInfo *flinfo)
static int32	gbt_var_node_cp_len (const GBT_VARKEY *node, const gbtree_vinfo *tinfo)
static bool	gbt_bytea_pf_match (const bytea *pf, const bytea *query, const gbtree_vinfo *tinfo)
static bool	gbt_var_node_pf_match (const GBT_VARKEY_R *node, const bytea *query, const gbtree_vinfo *tinfo)
static GBT_VARKEY *	gbt_var_node_truncate (const GBT_VARKEY *node, int32 cpf_length, const gbtree_vinfo *tinfo)
void	gbt_var_bin_union (Datum *u, GBT_VARKEY *e, Oid collation, const gbtree_vinfo *tinfo, FmgrInfo *flinfo)
GISTENTRY *	gbt_var_compress (GISTENTRY *entry, const gbtree_vinfo *tinfo)
Datum	gbt_var_fetch (PG_FUNCTION_ARGS)
GBT_VARKEY *	gbt_var_union (const GistEntryVector *entryvec, int32 *size, Oid collation, const gbtree_vinfo *tinfo, FmgrInfo *flinfo)
bool	gbt_var_same (Datum d1, Datum d2, Oid collation, const gbtree_vinfo *tinfo, FmgrInfo *flinfo)
float *	gbt_var_penalty (float *res, const GISTENTRY *o, const GISTENTRY *n, Oid collation, const gbtree_vinfo *tinfo, FmgrInfo *flinfo)
static int	gbt_vsrt_cmp (const void *a, const void *b, void *arg)
GIST_SPLITVEC *	gbt_var_picksplit (const GistEntryVector *entryvec, GIST_SPLITVEC *v, Oid collation, const gbtree_vinfo *tinfo, FmgrInfo *flinfo)
bool	gbt_var_consistent (const GBT_VARKEY_R *key, const void *query, StrategyNumber strategy, Oid collation, bool is_leaf, const gbtree_vinfo *tinfo, FmgrInfo *flinfo)

Macro Definition Documentation

lower_is_below_query

#define lower_is_below_query

(

)

(tinfo->f_cmp(key->lower, query, collation, flinfo) <= 0)

upper_is_above_query

#define upper_is_above_query

(

)

Value:

    (tinfo->f_cmp(key->upper, query, collation, flinfo) >= 0 || \
	 gbt_var_node_pf_match(key, query, tinfo))

Function Documentation

gbt_bytea_pf_match()

static bool gbt_bytea_pf_match ( const bytea *  pf, const bytea *  query, const gbtree_vinfo *  tinfo  )

static

Definition at line 167 of file btree_utils_var.c.

{
    bool        out = false;
    int32       qlen = VARSIZE(query) - VARHDRSZ;
    int32       nlen = VARSIZE(pf) - VARHDRSZ;
 
    if (nlen <= qlen)
    {
        char       *q = VARDATA(query);
        char       *n = VARDATA(pf);
 
        out = (memcmp(q, n, nlen) == 0);
    }
 
    return out;
}

References fb(), VARDATA(), VARHDRSZ, and VARSIZE().

Referenced by gbt_var_node_pf_match(), and gbt_var_penalty().

gbt_var_bin_union()

void gbt_var_bin_union	(	Datum *	u,
		GBT_VARKEY *	e,
		Oid	collation,
		const gbtree_vinfo *	tinfo,
		FmgrInfo *	flinfo
	)

Definition at line 239 of file btree_utils_var.c.

{
    GBT_VARKEY_R eo = gbt_var_key_readable(e);
    GBT_VARKEY_R nr;
 
    if (eo.lower == eo.upper)   /* if leaf, convert to internal form */
    {
        GBT_VARKEY *tmp;
 
        tmp = gbt_var_leaf2node(e, tinfo, flinfo);
        if (tmp != e)
            eo = gbt_var_key_readable(tmp);
    }
 
    if (DatumGetPointer(*u))
    {
        GBT_VARKEY_R ro = gbt_var_key_readable((GBT_VARKEY *) DatumGetPointer(*u));
        bool        update = false;
 
        nr.lower = ro.lower;
        nr.upper = ro.upper;
 
        if (tinfo->f_cmp(ro.lower, eo.lower, collation, flinfo) > 0)
        {
            nr.lower = eo.lower;
            update = true;
        }
 
        if (tinfo->f_cmp(ro.upper, eo.upper, collation, flinfo) < 0)
        {
            nr.upper = eo.upper;
            update = true;
        }
 
        if (update)
            *u = PointerGetDatum(gbt_var_key_copy(&nr));
    }
    else
    {
        nr.lower = eo.lower;
        nr.upper = eo.upper;
        *u = PointerGetDatum(gbt_var_key_copy(&nr));
    }
}

References DatumGetPointer(), gbtree_vinfo::f_cmp, fb(), gbt_var_key_copy(), gbt_var_key_readable(), gbt_var_leaf2node(), PointerGetDatum, and tinfo.

Referenced by gbt_numeric_penalty(), gbt_var_penalty(), gbt_var_picksplit(), and gbt_var_union().

gbt_var_compress()

GISTENTRY * gbt_var_compress	(	GISTENTRY *	entry,
		const gbtree_vinfo *	tinfo
	)

Definition at line 287 of file btree_utils_var.c.

{
    GISTENTRY  *retval;
 
    if (entry->leafkey)
    {
        varlena    *leaf = PG_DETOAST_DATUM(entry->key);
        GBT_VARKEY *r;
 
        r = gbt_var_key_from_datum(leaf);
 
        retval = palloc_object(GISTENTRY);
        gistentryinit(*retval, PointerGetDatum(r),
                      entry->rel, entry->page,
                      entry->offset, true);
    }
    else
        retval = entry;
 
    return retval;
}

References fb(), gbt_var_key_from_datum(), gistentryinit, GISTENTRY::key, GISTENTRY::leafkey, GISTENTRY::offset, GISTENTRY::page, palloc_object, PG_DETOAST_DATUM, PointerGetDatum, and GISTENTRY::rel.

Referenced by gbt_bit_compress(), gbt_bytea_compress(), gbt_numeric_compress(), and gbt_text_compress().

gbt_var_consistent()

bool gbt_var_consistent	(	const GBT_VARKEY_R *	key,
		const void *	query,
		StrategyNumber	strategy,
		Oid	collation,
		bool	is_leaf,
		const gbtree_vinfo *	tinfo,
		FmgrInfo *	flinfo
	)

Definition at line 560 of file btree_utils_var.c.

{
    bool        retval;
 
    /*
     * On leaf pages we directly apply the check "key->lower OP query"; we
     * need not consider key->upper since it will be equal to key->lower.
     *
     * On internal pages we mostly need to check "is lower bound below query?"
     * and/or "is upper bound above query?", where we must allow equality in
     * both cases.  When checking against the upper bound we have to allow a
     * gbt_var_node_pf_match too.
     *
     * Remember that f_cmp is for internal pages, f_eq etc for leaf pages.
     */
#define lower_is_below_query() \
    (tinfo->f_cmp(key->lower, query, collation, flinfo) <= 0)
#define upper_is_above_query() \
    (tinfo->f_cmp(key->upper, query, collation, flinfo) >= 0 || \
     gbt_var_node_pf_match(key, query, tinfo))
 
    switch (strategy)
    {
        case BTLessEqualStrategyNumber:
            if (is_leaf)
                retval = tinfo->f_le(key->lower, query, collation, flinfo);
            else
                retval = lower_is_below_query();
            break;
        case BTLessStrategyNumber:
            if (is_leaf)
                retval = tinfo->f_lt(key->lower, query, collation, flinfo);
            else
                retval = lower_is_below_query();
            break;
        case BTEqualStrategyNumber:
            if (is_leaf)
                retval = tinfo->f_eq(key->lower, query, collation, flinfo);
            else
                retval = lower_is_below_query() && upper_is_above_query();
            break;
        case BTGreaterStrategyNumber:
            if (is_leaf)
                retval = tinfo->f_gt(key->lower, query, collation, flinfo);
            else
                retval = upper_is_above_query();
            break;
        case BTGreaterEqualStrategyNumber:
            if (is_leaf)
                retval = tinfo->f_ge(key->lower, query, collation, flinfo);
            else
                retval = upper_is_above_query();
            break;
        case BtreeGistNotEqualStrategyNumber:
            if (is_leaf)
                retval = !(tinfo->f_eq(key->lower, query, collation, flinfo));
            else
            {
                /*
                 * If the upper/lower bounds are equal and not truncated, then
                 * all entries below this node must have exactly that value.
                 * So we can avoid descending if the query equals both bounds.
                 * In all other cases, we must descend.
                 */
                retval = tinfo->trnc ||
                    !(tinfo->f_cmp(key->lower, query, collation, flinfo) == 0 &&
                      tinfo->f_cmp(key->upper, query, collation, flinfo) == 0);
            }
            break;
        default:
            retval = false;
    }
 
#undef lower_is_below_query
#undef upper_is_above_query
 
    return retval;
}

References BTEqualStrategyNumber, BTGreaterEqualStrategyNumber, BTGreaterStrategyNumber, BTLessEqualStrategyNumber, BTLessStrategyNumber, BtreeGistNotEqualStrategyNumber, gbtree_vinfo::f_cmp, gbtree_vinfo::f_eq, gbtree_vinfo::f_ge, gbtree_vinfo::f_gt, gbtree_vinfo::f_le, gbtree_vinfo::f_lt, lower_is_below_query, tinfo, gbtree_vinfo::trnc, and upper_is_above_query.

Referenced by gbt_bit_consistent(), gbt_bpchar_consistent(), gbt_bytea_consistent(), gbt_numeric_consistent(), and gbt_text_consistent().

gbt_var_decompress()

Datum gbt_var_decompress

(

PG_FUNCTION_ARGS

)

Definition at line 36 of file btree_utils_var.c.

{
    GISTENTRY  *entry = (GISTENTRY *) PG_GETARG_POINTER(0);
    GBT_VARKEY *key = (GBT_VARKEY *) PG_DETOAST_DATUM(entry->key);
 
    /* We only need a new GISTENTRY if detoasting did something */
    if (key != (GBT_VARKEY *) DatumGetPointer(entry->key))
    {
        GISTENTRY  *retval = palloc_object(GISTENTRY);
 
        gistentryinit(*retval, PointerGetDatum(key),
                      entry->rel, entry->page,
                      entry->offset, false);
 
        PG_RETURN_POINTER(retval);
    }
 
    PG_RETURN_POINTER(entry);
}

References DatumGetPointer(), gistentryinit, GISTENTRY::key, GISTENTRY::offset, GISTENTRY::page, palloc_object, PG_DETOAST_DATUM, PG_GETARG_POINTER, PG_RETURN_POINTER, PointerGetDatum, and GISTENTRY::rel.

gbt_var_fetch()

Datum gbt_var_fetch

(

PG_FUNCTION_ARGS

)

Definition at line 311 of file btree_utils_var.c.

{
    GISTENTRY  *entry = (GISTENTRY *) PG_GETARG_POINTER(0);
    GBT_VARKEY *key = (GBT_VARKEY *) PG_DETOAST_DATUM(entry->key);
    GBT_VARKEY_R r = gbt_var_key_readable(key);
    GISTENTRY  *retval;
 
    retval = palloc_object(GISTENTRY);
    gistentryinit(*retval, PointerGetDatum(r.lower),
                  entry->rel, entry->page,
                  entry->offset, true);
 
    PG_RETURN_POINTER(retval);
}

References gbt_var_key_readable(), gistentryinit, GISTENTRY::key, GBT_VARKEY_R::lower, GISTENTRY::offset, GISTENTRY::page, palloc_object, PG_DETOAST_DATUM, PG_GETARG_POINTER, PG_RETURN_POINTER, PointerGetDatum, and GISTENTRY::rel.

gbt_var_key_copy()

GBT_VARKEY * gbt_var_key_copy

(

const GBT_VARKEY_R *

u

)

Definition at line 97 of file btree_utils_var.c.

{
    int32       lowersize = VARSIZE(u->lower);
    int32       uppersize = VARSIZE(u->upper);
    GBT_VARKEY *r;
 
    r = (GBT_VARKEY *) palloc0(INTALIGN(lowersize) + uppersize + VARHDRSZ);
    memcpy(VARDATA(r), u->lower, lowersize);
    memcpy(VARDATA(r) + INTALIGN(lowersize), u->upper, uppersize);
    SET_VARSIZE(r, INTALIGN(lowersize) + uppersize + VARHDRSZ);
 
    return r;
}

References fb(), INTALIGN, GBT_VARKEY_R::lower, memcpy(), palloc0(), SET_VARSIZE(), GBT_VARKEY_R::upper, VARDATA(), VARHDRSZ, and VARSIZE().

Referenced by gbt_bit_l2n(), gbt_numeric_penalty(), gbt_var_bin_union(), and gbt_var_union().

gbt_var_key_from_datum()

static GBT_VARKEY * gbt_var_key_from_datum ( const varlena *  u )

static

Definition at line 78 of file btree_utils_var.c.

{
    int32       lowersize = VARSIZE(u);
    GBT_VARKEY *r;
 
    r = (GBT_VARKEY *) palloc(lowersize + VARHDRSZ);
    memcpy(VARDATA(r), u, lowersize);
    SET_VARSIZE(r, lowersize + VARHDRSZ);
 
    return r;
}

References fb(), memcpy(), palloc(), SET_VARSIZE(), VARDATA(), VARHDRSZ, and VARSIZE().

Referenced by gbt_var_compress().

gbt_var_key_readable()

GBT_VARKEY_R gbt_var_key_readable

(

const GBT_VARKEY *

k

)

Definition at line 61 of file btree_utils_var.c.

{
    GBT_VARKEY_R r;
 
    r.lower = (bytea *) &(((char *) k)[VARHDRSZ]);
    if (VARSIZE(k) > (VARHDRSZ + (VARSIZE(r.lower))))
        r.upper = (bytea *) &(((char *) k)[VARHDRSZ + INTALIGN(VARSIZE(r.lower))]);
    else
        r.upper = r.lower;
    return r;
}

References INTALIGN, GBT_VARKEY_R::lower, GBT_VARKEY_R::upper, VARHDRSZ, and VARSIZE().

Referenced by gbt_bit_consistent(), gbt_bit_l2n(), gbt_bit_ssup_cmp(), gbt_bpchar_consistent(), gbt_bpchar_ssup_cmp(), gbt_bytea_consistent(), gbt_bytea_ssup_cmp(), gbt_numeric_consistent(), gbt_numeric_penalty(), gbt_numeric_ssup_cmp(), gbt_text_consistent(), gbt_text_ssup_cmp(), gbt_var_bin_union(), gbt_var_fetch(), gbt_var_node_cp_len(), gbt_var_node_truncate(), gbt_var_penalty(), gbt_var_picksplit(), gbt_var_same(), gbt_var_union(), and gbt_vsrt_cmp().

gbt_var_leaf2node()

static GBT_VARKEY * gbt_var_leaf2node ( GBT_VARKEY *  leaf, const gbtree_vinfo *  tinfo, FmgrInfo *  flinfo  )

static

Definition at line 116 of file btree_utils_var.c.

{
    if (tinfo->f_l2n)
        return tinfo->f_l2n(leaf, flinfo);
    else
        return leaf;
}

References gbtree_vinfo::f_l2n, fb(), and tinfo.

Referenced by gbt_var_bin_union(), gbt_var_penalty(), and gbt_var_picksplit().

gbt_var_node_cp_len()

static int32 gbt_var_node_cp_len ( const GBT_VARKEY *  node, const gbtree_vinfo *  tinfo  )

static

Definition at line 135 of file btree_utils_var.c.

{
    GBT_VARKEY_R r = gbt_var_key_readable(node);
    int32       i = 0;
    int32       t1len = VARSIZE(r.lower) - VARHDRSZ;
    int32       t2len = VARSIZE(r.upper) - VARHDRSZ;
    int32       ml = Min(t1len, t2len);
    char       *p1 = VARDATA(r.lower);
    char       *p2 = VARDATA(r.upper);
 
    if (ml == 0)
        return 0;
 
    while (i < ml)
    {
        if (*p1 != *p2)
            return i;
        p1++;
        p2++;
        i++;
    }
    return ml;                  /* lower == upper */
}

References fb(), gbt_var_key_readable(), i, GBT_VARKEY_R::lower, Min, GBT_VARKEY_R::upper, VARDATA(), VARHDRSZ, and VARSIZE().

Referenced by gbt_var_penalty(), gbt_var_picksplit(), and gbt_var_union().

gbt_var_node_pf_match()

static bool gbt_var_node_pf_match ( const GBT_VARKEY_R *  node, const bytea *  query, const gbtree_vinfo *  tinfo  )

static

Definition at line 195 of file btree_utils_var.c.

{
    return (tinfo->trnc &&
            gbt_bytea_pf_match(node->upper, query, tinfo));
}

References gbt_bytea_pf_match(), tinfo, gbtree_vinfo::trnc, and GBT_VARKEY_R::upper.

gbt_var_node_truncate()

static GBT_VARKEY * gbt_var_node_truncate ( const GBT_VARKEY *  node, int32  cpf_length, const gbtree_vinfo *  tinfo  )

static

Definition at line 210 of file btree_utils_var.c.

{
    GBT_VARKEY *out;
    GBT_VARKEY_R r = gbt_var_key_readable(node);
    int32       len1 = VARSIZE(r.lower) - VARHDRSZ;
    int32       len2 = VARSIZE(r.upper) - VARHDRSZ;
    int32       si;
    char       *out2;
 
    len1 = Min(len1, (cpf_length + 1));
    len2 = Min(len2, (cpf_length + 1));
 
    si = 2 * VARHDRSZ + INTALIGN(len1 + VARHDRSZ) + len2;
    out = (GBT_VARKEY *) palloc0(si);
    SET_VARSIZE(out, si);
 
    memcpy(VARDATA(out), r.lower, len1 + VARHDRSZ);
    SET_VARSIZE(VARDATA(out), len1 + VARHDRSZ);
 
    out2 = VARDATA(out) + INTALIGN(len1 + VARHDRSZ);
    memcpy(out2, r.upper, len2 + VARHDRSZ);
    SET_VARSIZE(out2, len2 + VARHDRSZ);
 
    return out;
}

References fb(), gbt_var_key_readable(), INTALIGN, GBT_VARKEY_R::lower, memcpy(), Min, palloc0(), SET_VARSIZE(), GBT_VARKEY_R::upper, VARDATA(), VARHDRSZ, and VARSIZE().

Referenced by gbt_var_picksplit(), and gbt_var_union().

gbt_var_penalty()

float * gbt_var_penalty	(	float *	res,
		const GISTENTRY *	o,
		const GISTENTRY *	n,
		Oid	collation,
		const gbtree_vinfo *	tinfo,
		FmgrInfo *	flinfo
	)

Definition at line 384 of file btree_utils_var.c.

{
    GBT_VARKEY *orge = (GBT_VARKEY *) DatumGetPointer(o->key);
    GBT_VARKEY *newe = (GBT_VARKEY *) DatumGetPointer(n->key);
    GBT_VARKEY_R ok,
                nk;
 
    *res = 0.0;
 
    nk = gbt_var_key_readable(newe);
    if (nk.lower == nk.upper)   /* if leaf, convert to internal form */
    {
        GBT_VARKEY *tmp;
 
        tmp = gbt_var_leaf2node(newe, tinfo, flinfo);
        if (tmp != newe)
            nk = gbt_var_key_readable(tmp);
    }
    ok = gbt_var_key_readable(orge);
 
    if ((VARSIZE(ok.lower) - VARHDRSZ) == 0 && (VARSIZE(ok.upper) - VARHDRSZ) == 0)
        *res = 0.0;
    else if (!((tinfo->f_cmp(nk.lower, ok.lower, collation, flinfo) >= 0 ||
                gbt_bytea_pf_match(ok.lower, nk.lower, tinfo)) &&
               (tinfo->f_cmp(nk.upper, ok.upper, collation, flinfo) <= 0 ||
                gbt_bytea_pf_match(ok.upper, nk.upper, tinfo))))
    {
        Datum       d = PointerGetDatum(0);
        double      dres;
        int32       ol,
                    ul;
 
        gbt_var_bin_union(&d, orge, collation, tinfo, flinfo);
        ol = gbt_var_node_cp_len((GBT_VARKEY *) DatumGetPointer(d), tinfo);
        gbt_var_bin_union(&d, newe, collation, tinfo, flinfo);
        ul = gbt_var_node_cp_len((GBT_VARKEY *) DatumGetPointer(d), tinfo);
 
        if (ul < ol)
        {
            dres = (ol - ul);   /* reduction of common prefix len */
        }
        else
        {
            GBT_VARKEY_R uk = gbt_var_key_readable((GBT_VARKEY *) DatumGetPointer(d));
            unsigned char tmp[4];
 
            tmp[0] = (unsigned char) (((VARSIZE(ok.lower) - VARHDRSZ) <= ul) ? 0 : (VARDATA(ok.lower)[ul]));
            tmp[1] = (unsigned char) (((VARSIZE(uk.lower) - VARHDRSZ) <= ul) ? 0 : (VARDATA(uk.lower)[ul]));
            tmp[2] = (unsigned char) (((VARSIZE(ok.upper) - VARHDRSZ) <= ul) ? 0 : (VARDATA(ok.upper)[ul]));
            tmp[3] = (unsigned char) (((VARSIZE(uk.upper) - VARHDRSZ) <= ul) ? 0 : (VARDATA(uk.upper)[ul]));
            dres = abs(tmp[0] - tmp[1]) + abs(tmp[3] - tmp[2]);
            dres /= 256.0;
        }
 
        *res += FLT_MIN;
        *res += (float) (dres / ((double) (ol + 1)));
        *res *= (FLT_MAX / (o->rel->rd_att->natts + 1));
    }
 
    return res;
}

References DatumGetPointer(), gbtree_vinfo::f_cmp, fb(), gbt_bytea_pf_match(), gbt_var_bin_union(), gbt_var_key_readable(), gbt_var_leaf2node(), gbt_var_node_cp_len(), GISTENTRY::key, PointerGetDatum, tinfo, VARDATA(), VARHDRSZ, and VARSIZE().

Referenced by gbt_bit_penalty(), gbt_bytea_penalty(), and gbt_text_penalty().

gbt_var_picksplit()

GIST_SPLITVEC * gbt_var_picksplit	(	const GistEntryVector *	entryvec,
		GIST_SPLITVEC *	v,
		Oid	collation,
		const gbtree_vinfo *	tinfo,
		FmgrInfo *	flinfo
	)

Definition at line 464 of file btree_utils_var.c.

{
    OffsetNumber i,
                maxoff = entryvec->n - 1;
    Vsrt       *arr;
    int         svcntr = 0,
                nbytes;
    char       *cur;
    GBT_VARKEY **sv = NULL;
    gbt_vsrt_arg varg;
 
    arr = palloc_array(Vsrt, maxoff + 1);
    nbytes = (maxoff + 2) * sizeof(OffsetNumber);
    v->spl_left = (OffsetNumber *) palloc(nbytes);
    v->spl_right = (OffsetNumber *) palloc(nbytes);
    v->spl_ldatum = PointerGetDatum(0);
    v->spl_rdatum = PointerGetDatum(0);
    v->spl_nleft = 0;
    v->spl_nright = 0;
 
    sv = palloc_array(GBT_VARKEY *, maxoff + 1);
 
    /* Sort entries */
 
    for (i = FirstOffsetNumber; i <= maxoff; i = OffsetNumberNext(i))
    {
        GBT_VARKEY_R ro;
 
        cur = (char *) DatumGetPointer(entryvec->vector[i].key);
        ro = gbt_var_key_readable((GBT_VARKEY *) cur);
        if (ro.lower == ro.upper)   /* leaf */
        {
            sv[svcntr] = gbt_var_leaf2node((GBT_VARKEY *) cur, tinfo, flinfo);
            arr[i].t = sv[svcntr];
            if (sv[svcntr] != (GBT_VARKEY *) cur)
                svcntr++;
        }
        else
            arr[i].t = (GBT_VARKEY *) cur;
        arr[i].i = i;
    }
 
    /* sort */
    varg.tinfo = tinfo;
    varg.collation = collation;
    varg.flinfo = flinfo;
    qsort_arg(&arr[FirstOffsetNumber],
              maxoff - FirstOffsetNumber + 1,
              sizeof(Vsrt),
              gbt_vsrt_cmp,
              &varg);
 
    /* We do simply create two parts */
 
    for (i = FirstOffsetNumber; i <= maxoff; i = OffsetNumberNext(i))
    {
        if (i <= (maxoff - FirstOffsetNumber + 1) / 2)
        {
            gbt_var_bin_union(&v->spl_ldatum, arr[i].t, collation, tinfo, flinfo);
            v->spl_left[v->spl_nleft] = arr[i].i;
            v->spl_nleft++;
        }
        else
        {
            gbt_var_bin_union(&v->spl_rdatum, arr[i].t, collation, tinfo, flinfo);
            v->spl_right[v->spl_nright] = arr[i].i;
            v->spl_nright++;
        }
    }
 
    /* Truncate (=compress) key */
    if (tinfo->trnc)
    {
        int32       ll = gbt_var_node_cp_len((GBT_VARKEY *) DatumGetPointer(v->spl_ldatum), tinfo);
        int32       lr = gbt_var_node_cp_len((GBT_VARKEY *) DatumGetPointer(v->spl_rdatum), tinfo);
        GBT_VARKEY *dl;
        GBT_VARKEY *dr;
 
        ll = Max(ll, lr);
        ll++;
 
        dl = gbt_var_node_truncate((GBT_VARKEY *) DatumGetPointer(v->spl_ldatum), ll, tinfo);
        dr = gbt_var_node_truncate((GBT_VARKEY *) DatumGetPointer(v->spl_rdatum), ll, tinfo);
        v->spl_ldatum = PointerGetDatum(dl);
        v->spl_rdatum = PointerGetDatum(dr);
    }
 
    return v;
}

References cur, DatumGetPointer(), fb(), FirstOffsetNumber, gbt_var_bin_union(), gbt_var_key_readable(), gbt_var_leaf2node(), gbt_var_node_cp_len(), gbt_var_node_truncate(), gbt_vsrt_cmp(), Vsrt::i, i, Max, OffsetNumberNext, palloc(), palloc_array, PointerGetDatum, qsort_arg(), GIST_SPLITVEC::spl_ldatum, GIST_SPLITVEC::spl_left, GIST_SPLITVEC::spl_nleft, GIST_SPLITVEC::spl_nright, GIST_SPLITVEC::spl_rdatum, GIST_SPLITVEC::spl_right, Vsrt::t, tinfo, and gbtree_vinfo::trnc.

Referenced by gbt_bit_picksplit(), gbt_bytea_picksplit(), gbt_numeric_picksplit(), and gbt_text_picksplit().

gbt_var_same()

bool gbt_var_same	(	Datum	d1,
		Datum	d2,
		Oid	collation,
		const gbtree_vinfo *	tinfo,
		FmgrInfo *	flinfo
	)

Definition at line 367 of file btree_utils_var.c.

{
    GBT_VARKEY *t1 = (GBT_VARKEY *) DatumGetPointer(d1);
    GBT_VARKEY *t2 = (GBT_VARKEY *) DatumGetPointer(d2);
    GBT_VARKEY_R r1,
                r2;
 
    r1 = gbt_var_key_readable(t1);
    r2 = gbt_var_key_readable(t2);
 
    return (tinfo->f_cmp(r1.lower, r2.lower, collation, flinfo) == 0 &&
            tinfo->f_cmp(r1.upper, r2.upper, collation, flinfo) == 0);
}

References DatumGetPointer(), gbtree_vinfo::f_cmp, fb(), gbt_var_key_readable(), and tinfo.

Referenced by gbt_bit_same(), gbt_bytea_same(), gbt_numeric_same(), and gbt_text_same().

gbt_var_union()

GBT_VARKEY * gbt_var_union	(	const GistEntryVector *	entryvec,
		int32 *	size,
		Oid	collation,
		const gbtree_vinfo *	tinfo,
		FmgrInfo *	flinfo
	)

Definition at line 328 of file btree_utils_var.c.

{
    int         i = 0,
                numranges = entryvec->n;
    GBT_VARKEY *cur;
    Datum       out;
    GBT_VARKEY_R rk;
 
    *size = sizeof(GBT_VARKEY);
 
    cur = (GBT_VARKEY *) DatumGetPointer(entryvec->vector[0].key);
    rk = gbt_var_key_readable(cur);
    out = PointerGetDatum(gbt_var_key_copy(&rk));
 
    for (i = 1; i < numranges; i++)
    {
        cur = (GBT_VARKEY *) DatumGetPointer(entryvec->vector[i].key);
        gbt_var_bin_union(&out, cur, collation, tinfo, flinfo);
    }
 
 
    /* Truncate (=compress) key */
    if (tinfo->trnc)
    {
        int32       plen;
        GBT_VARKEY *trc;
 
        plen = gbt_var_node_cp_len((GBT_VARKEY *) DatumGetPointer(out), tinfo);
        trc = gbt_var_node_truncate((GBT_VARKEY *) DatumGetPointer(out), plen + 1, tinfo);
 
        out = PointerGetDatum(trc);
    }
 
    return ((GBT_VARKEY *) DatumGetPointer(out));
}

References cur, DatumGetPointer(), fb(), gbt_var_bin_union(), gbt_var_key_copy(), gbt_var_key_readable(), gbt_var_node_cp_len(), gbt_var_node_truncate(), i, PointerGetDatum, tinfo, and gbtree_vinfo::trnc.

Referenced by gbt_bit_union(), gbt_bytea_union(), gbt_numeric_union(), and gbt_text_union().

gbt_vsrt_cmp()

static int gbt_vsrt_cmp ( const void *  a, const void *  b, void *  arg  )

static

Definition at line 449 of file btree_utils_var.c.

{
    GBT_VARKEY_R ar = gbt_var_key_readable(((const Vsrt *) a)->t);
    GBT_VARKEY_R br = gbt_var_key_readable(((const Vsrt *) b)->t);
    const gbt_vsrt_arg *varg = (const gbt_vsrt_arg *) arg;
    int         res;
 
    res = varg->tinfo->f_cmp(ar.lower, br.lower, varg->collation, varg->flinfo);
    if (res == 0)
        return varg->tinfo->f_cmp(ar.upper, br.upper, varg->collation, varg->flinfo);
 
    return res;
}

References a, arg, b, gbtree_vinfo::f_cmp, fb(), gbt_var_key_readable(), and gbt_vsrt_arg::tinfo.

Referenced by gbt_var_picksplit().

PG_FUNCTION_INFO_V1() [1/2]

PG_FUNCTION_INFO_V1

(

gbt_var_decompress

)

PG_FUNCTION_INFO_V1() [2/2]

PG_FUNCTION_INFO_V1

(

gbt_var_fetch

)