#include "postgres.h"
#include "btree_gist.h"
#include "btree_utils_num.h"

Include dependency graph for btree_oid.c:

Data Structures
struct	oidKEY
Functions
	PG_FUNCTION_INFO_V1 (gbt_oid_compress)
	PG_FUNCTION_INFO_V1 (gbt_oid_union)
	PG_FUNCTION_INFO_V1 (gbt_oid_picksplit)
	PG_FUNCTION_INFO_V1 (gbt_oid_consistent)
	PG_FUNCTION_INFO_V1 (gbt_oid_distance)
	PG_FUNCTION_INFO_V1 (gbt_oid_penalty)
	PG_FUNCTION_INFO_V1 (gbt_oid_same)
Datum	gbt_oid_compress (PG_FUNCTION_ARGS)
Datum	gbt_oid_union (PG_FUNCTION_ARGS)
Datum	gbt_oid_picksplit (PG_FUNCTION_ARGS)
Datum	gbt_oid_consistent (PG_FUNCTION_ARGS)
Datum	gbt_oid_distance (PG_FUNCTION_ARGS)
Datum	gbt_oid_penalty (PG_FUNCTION_ARGS)
Datum	gbt_oid_same (PG_FUNCTION_ARGS)
static bool	gbt_oidgt (const void a, const void b)
static bool	gbt_oidge (const void a, const void b)
static bool	gbt_oideq (const void a, const void b)
static bool	gbt_oidle (const void a, const void b)
static bool	gbt_oidlt (const void a, const void b)
static int	gbt_oidkey_cmp (const void a, const void b)
static float8	gbt_oid_dist (const void a, const void b)
	PG_FUNCTION_INFO_V1 (oid_dist)
Datum	oid_dist (PG_FUNCTION_ARGS)
Variables
static const gbtree_ninfo	tinfo

Function Documentation

Datum gbt_oid_compress ( PG_FUNCTION_ARGS )

Definition at line 128 of file btree_oid.c.

References gbt_num_compress(), PG_GETARG_POINTER, and PG_RETURN_POINTER.

{
    GISTENTRY  *entry = (GISTENTRY *) PG_GETARG_POINTER(0);
    GISTENTRY  *retval = NULL;

    PG_RETURN_POINTER(gbt_num_compress(retval, entry, &tinfo));
}

Datum gbt_oid_consistent ( PG_FUNCTION_ARGS )

Definition at line 138 of file btree_oid.c.

References DatumGetPointer, gbt_num_consistent(), GIST_LEAF, GISTENTRY::key, oidKEY::lower, GBT_NUMKEY_R::lower, PG_GETARG_OID, PG_GETARG_POINTER, PG_GETARG_UINT16, PG_RETURN_BOOL, oidKEY::upper, and GBT_NUMKEY_R::upper.

{
    GISTENTRY  *entry = (GISTENTRY *) PG_GETARG_POINTER(0);
    Oid         query = PG_GETARG_OID(1);
    StrategyNumber strategy = (StrategyNumber) PG_GETARG_UINT16(2);

    /* Oid      subtype = PG_GETARG_OID(3); */
    bool       *recheck = (bool *) PG_GETARG_POINTER(4);
    oidKEY     *kkk = (oidKEY *) 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, (void *) &query, &strategy, GIST_LEAF(entry), &tinfo)
        );
}

static float8 gbt_oid_dist	(	const void *	a,
		const void *	b
	)			`[static]`

Definition at line 79 of file btree_oid.c.

{
    Oid         aa = *(const Oid *) a;
    Oid         bb = *(const Oid *) b;

    if (aa < bb)
        return (float8) (bb - aa);
    else
        return (float8) (aa - bb);
}

Datum gbt_oid_distance ( PG_FUNCTION_ARGS )

Definition at line 162 of file btree_oid.c.

References DatumGetPointer, gbt_num_distance(), GIST_LEAF, GISTENTRY::key, oidKEY::lower, GBT_NUMKEY_R::lower, PG_GETARG_OID, PG_GETARG_POINTER, PG_RETURN_FLOAT8, oidKEY::upper, and GBT_NUMKEY_R::upper.

{
    GISTENTRY  *entry = (GISTENTRY *) PG_GETARG_POINTER(0);
    Oid         query = PG_GETARG_OID(1);

    /* Oid      subtype = PG_GETARG_OID(3); */
    oidKEY     *kkk = (oidKEY *) DatumGetPointer(entry->key);
    GBT_NUMKEY_R key;

    key.lower = (GBT_NUMKEY *) &kkk->lower;
    key.upper = (GBT_NUMKEY *) &kkk->upper;

    PG_RETURN_FLOAT8(
            gbt_num_distance(&key, (void *) &query, GIST_LEAF(entry), &tinfo)
        );
}

Datum gbt_oid_penalty ( PG_FUNCTION_ARGS )

Definition at line 192 of file btree_oid.c.

References DatumGetPointer, oidKEY::lower, penalty_num, PG_GETARG_POINTER, PG_RETURN_POINTER, and oidKEY::upper.

{
    oidKEY     *origentry = (oidKEY *) DatumGetPointer(((GISTENTRY *) PG_GETARG_POINTER(0))->key);
    oidKEY     *newentry = (oidKEY *) DatumGetPointer(((GISTENTRY *) PG_GETARG_POINTER(1))->key);
    float      *result = (float *) PG_GETARG_POINTER(2);

    penalty_num(result, origentry->lower, origentry->upper, newentry->lower, newentry->upper);

    PG_RETURN_POINTER(result);
}

Datum gbt_oid_picksplit ( PG_FUNCTION_ARGS )

Definition at line 204 of file btree_oid.c.

References gbt_num_picksplit(), PG_GETARG_POINTER, and PG_RETURN_POINTER.

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

Datum gbt_oid_same ( PG_FUNCTION_ARGS )

Definition at line 214 of file btree_oid.c.

References gbt_num_same(), PG_GETARG_POINTER, and PG_RETURN_POINTER.

{
    oidKEY     *b1 = (oidKEY *) PG_GETARG_POINTER(0);
    oidKEY     *b2 = (oidKEY *) PG_GETARG_POINTER(1);
    bool       *result = (bool *) PG_GETARG_POINTER(2);

    *result = gbt_num_same((void *) b1, (void *) b2, &tinfo);
    PG_RETURN_POINTER(result);
}

Datum gbt_oid_union ( PG_FUNCTION_ARGS )

Definition at line 181 of file btree_oid.c.

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

{
    GistEntryVector *entryvec = (GistEntryVector *) PG_GETARG_POINTER(0);
    void       *out = palloc(sizeof(oidKEY));

    *(int *) PG_GETARG_POINTER(1) = sizeof(oidKEY);
    PG_RETURN_POINTER(gbt_num_union((void *) out, entryvec, &tinfo));
}

static bool gbt_oideq	(	const void *	a,
		const void *	b
	)			`[static]`

Definition at line 46 of file btree_oid.c.

{
    return (*((const Oid *) a) == *((const Oid *) b));
}

static bool gbt_oidge	(	const void *	a,
		const void *	b
	)			`[static]`

Definition at line 41 of file btree_oid.c.

{
    return (*((const Oid *) a) >= *((const Oid *) b));
}

static bool gbt_oidgt	(	const void *	a,
		const void *	b
	)			`[static]`

Definition at line 36 of file btree_oid.c.

{
    return (*((const Oid *) a) > *((const Oid *) b));
}

static int gbt_oidkey_cmp	(	const void *	a,
		const void *	b
	)			`[static]`

Definition at line 62 of file btree_oid.c.

References oidKEY::lower, and oidKEY::upper.

{
    oidKEY     *ia = (oidKEY *) (((const Nsrt *) a)->t);
    oidKEY     *ib = (oidKEY *) (((const Nsrt *) b)->t);

    if (ia->lower == ib->lower)
    {
        if (ia->upper == ib->upper)
            return 0;

        return (ia->upper > ib->upper) ? 1 : -1;
    }

    return (ia->lower > ib->lower) ? 1 : -1;
}

static bool gbt_oidle	(	const void *	a,
		const void *	b
	)			`[static]`

Definition at line 51 of file btree_oid.c.

{
    return (*((const Oid *) a) <= *((const Oid *) b));
}

static bool gbt_oidlt	(	const void *	a,
		const void *	b
	)			`[static]`

Definition at line 56 of file btree_oid.c.

{
    return (*((const Oid *) a) < *((const Oid *) b));
}

Datum oid_dist ( PG_FUNCTION_ARGS )

Definition at line 108 of file btree_oid.c.

References PG_GETARG_OID, and PG_RETURN_OID.

{
    Oid         a = PG_GETARG_OID(0);
    Oid         b = PG_GETARG_OID(1);
    Oid         res;

    if (a < b)
        res = b - a;
    else
        res = a - b;
    PG_RETURN_OID(res);
}

PG_FUNCTION_INFO_V1 ( gbt_oid_consistent )

PG_FUNCTION_INFO_V1 ( gbt_oid_compress )

PG_FUNCTION_INFO_V1 ( gbt_oid_union )

PG_FUNCTION_INFO_V1 ( gbt_oid_same )

PG_FUNCTION_INFO_V1 ( gbt_oid_penalty )

PG_FUNCTION_INFO_V1 ( gbt_oid_picksplit )

PG_FUNCTION_INFO_V1 ( gbt_oid_distance )

PG_FUNCTION_INFO_V1 ( oid_dist )

Variable Documentation

const gbtree_ninfo tinfo [static]

Initial value:

{
    gbt_t_oid,
    sizeof(Oid),
    gbt_oidgt,
    gbt_oidge,
    gbt_oideq,
    gbt_oidle,
    gbt_oidlt,
    gbt_oidkey_cmp,
    gbt_oid_dist
}

Definition at line 91 of file btree_oid.c.

Header And Logo

btree_oid.c File Reference

Data Structures

Functions

Variables

Function Documentation

Variable Documentation