btree_uuid.c File Reference

#include "postgres.h"
#include "btree_gist.h"
#include "btree_utils_num.h"
#include "port/pg_bswap.h"
#include "utils/rel.h"
#include "utils/sortsupport.h"
#include "utils/uuid.h"

Include dependency graph for btree_uuid.c:

Go to the source code of this file.

Data Structures
struct	uuidKEY

Functions
	PG_FUNCTION_INFO_V1 (gbt_uuid_compress)
	PG_FUNCTION_INFO_V1 (gbt_uuid_fetch)
	PG_FUNCTION_INFO_V1 (gbt_uuid_union)
	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	uuid_internal_cmp (const pg_uuid_t *arg1, const pg_uuid_t *arg2)
static bool	gbt_uuidgt (const void *a, const void *b, FmgrInfo *flinfo)
static bool	gbt_uuidge (const void *a, const void *b, FmgrInfo *flinfo)
static bool	gbt_uuideq (const void *a, const void *b, FmgrInfo *flinfo)
static bool	gbt_uuidle (const void *a, const void *b, FmgrInfo *flinfo)
static bool	gbt_uuidlt (const void *a, const void *b, FmgrInfo *flinfo)
static int	gbt_uuidkey_cmp (const void *a, const void *b, FmgrInfo *flinfo)
Datum	gbt_uuid_compress (PG_FUNCTION_ARGS)
Datum	gbt_uuid_fetch (PG_FUNCTION_ARGS)
Datum	gbt_uuid_consistent (PG_FUNCTION_ARGS)
Datum	gbt_uuid_union (PG_FUNCTION_ARGS)
static double	uuid_2_double (const pg_uuid_t *u)
Datum	gbt_uuid_penalty (PG_FUNCTION_ARGS)
Datum	gbt_uuid_picksplit (PG_FUNCTION_ARGS)
Datum	gbt_uuid_same (PG_FUNCTION_ARGS)
static int	gbt_uuid_ssup_cmp (Datum x, Datum y, SortSupport ssup)
Datum	gbt_uuid_sortsupport (PG_FUNCTION_ARGS)

Variables
static const gbtree_ninfo	tinfo

Function Documentation

gbt_uuid_compress()

Datum gbt_uuid_compress

(

PG_FUNCTION_ARGS

)

Definition at line 101 of file btree_uuid.c.

{
    GISTENTRY  *entry = (GISTENTRY *) PG_GETARG_POINTER(0);
    GISTENTRY  *retval;
 
    if (entry->leafkey)
    {
        char       *r = (char *) palloc(2 * UUID_LEN);
        pg_uuid_t  *key = DatumGetUUIDP(entry->key);
 
        retval = palloc(sizeof(GISTENTRY));
 
        memcpy(r, key, UUID_LEN);
        memcpy(r + UUID_LEN, key, UUID_LEN);
        gistentryinit(*retval, PointerGetDatum(r),
                      entry->rel, entry->page,
                      entry->offset, false);
    }
    else
        retval = entry;
 
    PG_RETURN_POINTER(retval);
}

References DatumGetUUIDP(), gistentryinit, GISTENTRY::key, sort-test::key, GISTENTRY::leafkey, GISTENTRY::offset, GISTENTRY::page, palloc(), PG_GETARG_POINTER, PG_RETURN_POINTER, PointerGetDatum(), GISTENTRY::rel, and UUID_LEN.

gbt_uuid_consistent()

Datum gbt_uuid_consistent

(

PG_FUNCTION_ARGS

)

Definition at line 134 of file btree_uuid.c.

{
    GISTENTRY  *entry = (GISTENTRY *) PG_GETARG_POINTER(0);
    pg_uuid_t  *query = PG_GETARG_UUID_P(1);
    StrategyNumber strategy = (StrategyNumber) PG_GETARG_UINT16(2);
 
    /* Oid      subtype = PG_GETARG_OID(3); */
    bool       *recheck = (bool *) PG_GETARG_POINTER(4);
    uuidKEY    *kkk = (uuidKEY *) DatumGetPointer(entry->key);
    GBT_NUMKEY_R key;
 
    /* All cases served by this function are exact */
    *recheck = false;
 
    key.lower = (GBT_NUMKEY *) &kkk->lower;
    key.upper = (GBT_NUMKEY *) &kkk->upper;
 
    PG_RETURN_BOOL(gbt_num_consistent(&key, query, &strategy,
                                      GIST_LEAF(entry), &tinfo,
                                      fcinfo->flinfo));
}

References DatumGetPointer(), gbt_num_consistent(), GIST_LEAF, GISTENTRY::key, sort-test::key, uuidKEY::lower, PG_GETARG_POINTER, PG_GETARG_UINT16, PG_GETARG_UUID_P, PG_RETURN_BOOL, tinfo, and uuidKEY::upper.

gbt_uuid_fetch()

Datum gbt_uuid_fetch

(

PG_FUNCTION_ARGS

)

Definition at line 126 of file btree_uuid.c.

{
    GISTENTRY  *entry = (GISTENTRY *) PG_GETARG_POINTER(0);
 
    PG_RETURN_POINTER(gbt_num_fetch(entry, &tinfo));
}

References gbt_num_fetch(), PG_GETARG_POINTER, PG_RETURN_POINTER, and tinfo.

gbt_uuid_penalty()

Datum gbt_uuid_penalty

(

PG_FUNCTION_ARGS

)

Definition at line 198 of file btree_uuid.c.

{
    uuidKEY    *origentry = (uuidKEY *) DatumGetPointer(((GISTENTRY *) PG_GETARG_POINTER(0))->key);
    uuidKEY    *newentry = (uuidKEY *) DatumGetPointer(((GISTENTRY *) PG_GETARG_POINTER(1))->key);
    float      *result = (float *) PG_GETARG_POINTER(2);
    double      olower,
                oupper,
                nlower,
                nupper;
 
    olower = uuid_2_double(&origentry->lower);
    oupper = uuid_2_double(&origentry->upper);
    nlower = uuid_2_double(&newentry->lower);
    nupper = uuid_2_double(&newentry->upper);
 
    penalty_num(result, olower, oupper, nlower, nupper);
 
    PG_RETURN_POINTER(result);
}

References DatumGetPointer(), sort-test::key, uuidKEY::lower, penalty_num, PG_GETARG_POINTER, PG_RETURN_POINTER, uuidKEY::upper, and uuid_2_double().

gbt_uuid_picksplit()

Datum gbt_uuid_picksplit

(

PG_FUNCTION_ARGS

)

Definition at line 219 of file btree_uuid.c.

{
    PG_RETURN_POINTER(gbt_num_picksplit((GistEntryVector *) PG_GETARG_POINTER(0),
                                        (GIST_SPLITVEC *) PG_GETARG_POINTER(1),
                                        &tinfo, fcinfo->flinfo));
}

References gbt_num_picksplit(), PG_GETARG_POINTER, PG_RETURN_POINTER, and tinfo.

gbt_uuid_same()

Datum gbt_uuid_same

(

PG_FUNCTION_ARGS

)

Definition at line 227 of file btree_uuid.c.

{
    uuidKEY    *b1 = (uuidKEY *) PG_GETARG_POINTER(0);
    uuidKEY    *b2 = (uuidKEY *) PG_GETARG_POINTER(1);
    bool       *result = (bool *) PG_GETARG_POINTER(2);
 
    *result = gbt_num_same((void *) b1, (void *) b2, &tinfo, fcinfo->flinfo);
    PG_RETURN_POINTER(result);
}

References gbt_num_same(), PG_GETARG_POINTER, PG_RETURN_POINTER, and tinfo.

gbt_uuid_sortsupport()

Datum gbt_uuid_sortsupport

(

PG_FUNCTION_ARGS

)

Definition at line 248 of file btree_uuid.c.

{
    SortSupport ssup = (SortSupport) PG_GETARG_POINTER(0);
 
    ssup->comparator = gbt_uuid_ssup_cmp;
    ssup->ssup_extra = NULL;
 
    PG_RETURN_VOID();
}

References SortSupportData::comparator, gbt_uuid_ssup_cmp(), PG_GETARG_POINTER, PG_RETURN_VOID, and SortSupportData::ssup_extra.

gbt_uuid_ssup_cmp()

static int gbt_uuid_ssup_cmp ( Datum  x, Datum  y, SortSupport  ssup  )

static

Definition at line 238 of file btree_uuid.c.

{
    uuidKEY    *arg1 = (uuidKEY *) DatumGetPointer(x);
    uuidKEY    *arg2 = (uuidKEY *) DatumGetPointer(y);
 
    /* for leaf items we expect lower == upper, so only compare lower */
    return uuid_internal_cmp(&arg1->lower, &arg2->lower);
}

References DatumGetPointer(), uuidKEY::lower, uuid_internal_cmp(), x, and y.

Referenced by gbt_uuid_sortsupport().

gbt_uuid_union()

Datum gbt_uuid_union

(

PG_FUNCTION_ARGS

)

Definition at line 157 of file btree_uuid.c.

{
    GistEntryVector *entryvec = (GistEntryVector *) PG_GETARG_POINTER(0);
    void       *out = palloc(sizeof(uuidKEY));
 
    *(int *) PG_GETARG_POINTER(1) = sizeof(uuidKEY);
    PG_RETURN_POINTER(gbt_num_union(out, entryvec, &tinfo, fcinfo->flinfo));
}

References gbt_num_union(), palloc(), PG_GETARG_POINTER, PG_RETURN_POINTER, and tinfo.

gbt_uuideq()

static bool gbt_uuideq ( const void *  a, const void *  b, FmgrInfo *  flinfo  )

static

Definition at line 50 of file btree_uuid.c.

{
    return uuid_internal_cmp((const pg_uuid_t *) a, (const pg_uuid_t *) b) == 0;
}

References a, b, and uuid_internal_cmp().

gbt_uuidge()

static bool gbt_uuidge ( const void *  a, const void *  b, FmgrInfo *  flinfo  )

static

Definition at line 44 of file btree_uuid.c.

{
    return uuid_internal_cmp((const pg_uuid_t *) a, (const pg_uuid_t *) b) >= 0;
}

References a, b, and uuid_internal_cmp().

gbt_uuidgt()

static bool gbt_uuidgt ( const void *  a, const void *  b, FmgrInfo *  flinfo  )

static

Definition at line 38 of file btree_uuid.c.

{
    return uuid_internal_cmp((const pg_uuid_t *) a, (const pg_uuid_t *) b) > 0;
}

References a, b, and uuid_internal_cmp().

gbt_uuidkey_cmp()

static int gbt_uuidkey_cmp ( const void *  a, const void *  b, FmgrInfo *  flinfo  )

static

Definition at line 68 of file btree_uuid.c.

{
    uuidKEY    *ia = (uuidKEY *) (((const Nsrt *) a)->t);
    uuidKEY    *ib = (uuidKEY *) (((const Nsrt *) b)->t);
    int         res;
 
    res = uuid_internal_cmp(&ia->lower, &ib->lower);
    if (res == 0)
        res = uuid_internal_cmp(&ia->upper, &ib->upper);
    return res;
}

References a, b, uuidKEY::lower, uuidKEY::upper, and uuid_internal_cmp().

gbt_uuidle()

static bool gbt_uuidle ( const void *  a, const void *  b, FmgrInfo *  flinfo  )

static

Definition at line 56 of file btree_uuid.c.

{
    return uuid_internal_cmp((const pg_uuid_t *) a, (const pg_uuid_t *) b) <= 0;
}

References a, b, and uuid_internal_cmp().

gbt_uuidlt()

static bool gbt_uuidlt ( const void *  a, const void *  b, FmgrInfo *  flinfo  )

static

Definition at line 62 of file btree_uuid.c.

{
    return uuid_internal_cmp((const pg_uuid_t *) a, (const pg_uuid_t *) b) < 0;
}

References a, b, and uuid_internal_cmp().

PG_FUNCTION_INFO_V1() [1/8]

PG_FUNCTION_INFO_V1

(

gbt_uuid_compress

)

PG_FUNCTION_INFO_V1() [2/8]

PG_FUNCTION_INFO_V1

(

gbt_uuid_consistent

)

PG_FUNCTION_INFO_V1() [3/8]

PG_FUNCTION_INFO_V1

(

gbt_uuid_fetch

)

PG_FUNCTION_INFO_V1() [4/8]

PG_FUNCTION_INFO_V1

(

gbt_uuid_penalty

)

PG_FUNCTION_INFO_V1() [5/8]

PG_FUNCTION_INFO_V1

(

gbt_uuid_picksplit

)

PG_FUNCTION_INFO_V1() [6/8]

PG_FUNCTION_INFO_V1

(

gbt_uuid_same

)

PG_FUNCTION_INFO_V1() [7/8]

PG_FUNCTION_INFO_V1

(

gbt_uuid_sortsupport

)

PG_FUNCTION_INFO_V1() [8/8]

PG_FUNCTION_INFO_V1

(

gbt_uuid_union

)

uuid_2_double()

static double uuid_2_double ( const pg_uuid_t *  u )

static

Definition at line 170 of file btree_uuid.c.

{
    uint64      uu[2];
    const double two64 = 18446744073709551616.0;    /* 2^64 */
 
    /* Source data may not be suitably aligned, so copy */
    memcpy(uu, u->data, UUID_LEN);
 
    /*
     * uuid values should be considered as big-endian numbers, since that
     * corresponds to how memcmp will compare them.  On a little-endian
     * machine, byte-swap each half so we can use native uint64 arithmetic.
     */
#ifndef WORDS_BIGENDIAN
    uu[0] = pg_bswap64(uu[0]);
    uu[1] = pg_bswap64(uu[1]);
#endif
 
    /*
     * 2^128 is about 3.4e38, which in theory could exceed the range of
     * "double" (POSIX only requires 1e37).  To avoid any risk of overflow,
     * put the decimal point between the two halves rather than treating the
     * uuid value as a 128-bit integer.
     */
    return (double) uu[0] + (double) uu[1] / two64;
}

References pg_uuid_t::data, pg_bswap64(), and UUID_LEN.

Referenced by gbt_uuid_penalty().

uuid_internal_cmp()

static int uuid_internal_cmp ( const pg_uuid_t *  arg1, const pg_uuid_t *  arg2  )

static

Definition at line 32 of file btree_uuid.c.

{
    return memcmp(arg1->data, arg2->data, UUID_LEN);
}

References pg_uuid_t::data, and UUID_LEN.

Referenced by gbt_uuid_ssup_cmp(), gbt_uuideq(), gbt_uuidge(), gbt_uuidgt(), gbt_uuidkey_cmp(), gbt_uuidle(), and gbt_uuidlt().

Variable Documentation

tinfo

const gbtree_ninfo tinfo

static

Initial value:

=
{
    gbt_t_uuid,
    UUID_LEN,
    32,                         
    gbt_uuidgt,
    gbt_uuidge,
    gbt_uuideq,
    gbt_uuidle,
    gbt_uuidlt,
    gbt_uuidkey_cmp,
    NULL
}

Definition at line 81 of file btree_uuid.c.

Referenced by gbt_uuid_consistent(), gbt_uuid_fetch(), gbt_uuid_picksplit(), gbt_uuid_same(), and gbt_uuid_union().