btree_inet.c File Reference

#include "postgres.h"
#include "btree_gist.h"
#include "btree_utils_num.h"
#include "catalog/pg_type.h"
#include "utils/builtins.h"
#include "utils/sortsupport.h"

Include dependency graph for btree_inet.c:

Go to the source code of this file.

Data Structures
struct	inetkey

Typedefs
typedef struct inetkey	inetKEY

Functions
	PG_FUNCTION_INFO_V1 (gbt_inet_compress)
	PG_FUNCTION_INFO_V1 (gbt_inet_union)
	PG_FUNCTION_INFO_V1 (gbt_inet_picksplit)
	PG_FUNCTION_INFO_V1 (gbt_inet_consistent)
	PG_FUNCTION_INFO_V1 (gbt_inet_penalty)
	PG_FUNCTION_INFO_V1 (gbt_inet_same)
	PG_FUNCTION_INFO_V1 (gbt_inet_sortsupport)
static bool	gbt_inetgt (const void *a, const void *b, FmgrInfo *flinfo)
static bool	gbt_inetge (const void *a, const void *b, FmgrInfo *flinfo)
static bool	gbt_ineteq (const void *a, const void *b, FmgrInfo *flinfo)
static bool	gbt_inetle (const void *a, const void *b, FmgrInfo *flinfo)
static bool	gbt_inetlt (const void *a, const void *b, FmgrInfo *flinfo)
static int	gbt_inetkey_cmp (const void *a, const void *b, FmgrInfo *flinfo)
Datum	gbt_inet_compress (PG_FUNCTION_ARGS)
Datum	gbt_inet_consistent (PG_FUNCTION_ARGS)
Datum	gbt_inet_union (PG_FUNCTION_ARGS)
Datum	gbt_inet_penalty (PG_FUNCTION_ARGS)
Datum	gbt_inet_picksplit (PG_FUNCTION_ARGS)
Datum	gbt_inet_same (PG_FUNCTION_ARGS)
static int	gbt_inet_ssup_cmp (Datum x, Datum y, SortSupport ssup)
Datum	gbt_inet_sortsupport (PG_FUNCTION_ARGS)

Variables
static const gbtree_ninfo	tinfo

Typedef Documentation

inetKEY

typedef struct inetkey inetKEY

Function Documentation

gbt_inet_compress()

Datum gbt_inet_compress

(

PG_FUNCTION_ARGS

)

Definition at line 92 of file btree_inet.c.

{
    GISTENTRY  *entry = (GISTENTRY *) PG_GETARG_POINTER(0);
    GISTENTRY  *retval;
 
    if (entry->leafkey)
    {
        inetKEY    *r = (inetKEY *) palloc(sizeof(inetKEY));
        bool        failure = false;
 
        retval = palloc(sizeof(GISTENTRY));
        r->lower = convert_network_to_scalar(entry->key, INETOID, &failure);
        Assert(!failure);
        r->upper = r->lower;
        gistentryinit(*retval, PointerGetDatum(r),
                      entry->rel, entry->page,
                      entry->offset, false);
    }
    else
        retval = entry;
 
    PG_RETURN_POINTER(retval);
}

References Assert(), convert_network_to_scalar(), gistentryinit, GISTENTRY::key, GISTENTRY::leafkey, inetkey::lower, GISTENTRY::offset, GISTENTRY::page, palloc(), PG_GETARG_POINTER, PG_RETURN_POINTER, PointerGetDatum(), GISTENTRY::rel, and inetkey::upper.

gbt_inet_consistent()

Datum gbt_inet_consistent

(

PG_FUNCTION_ARGS

)

Definition at line 117 of file btree_inet.c.

{
    GISTENTRY  *entry = (GISTENTRY *) PG_GETARG_POINTER(0);
    Datum       dquery = PG_GETARG_DATUM(1);
    StrategyNumber strategy = (StrategyNumber) PG_GETARG_UINT16(2);
 
    /* Oid      subtype = PG_GETARG_OID(3); */
    bool       *recheck = (bool *) PG_GETARG_POINTER(4);
    inetKEY    *kkk = (inetKEY *) DatumGetPointer(entry->key);
    GBT_NUMKEY_R key;
    double      query;
    bool        failure = false;
 
    query = convert_network_to_scalar(dquery, INETOID, &failure);
    Assert(!failure);
 
    /* All cases served by this function are inexact */
    *recheck = true;
 
    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 Assert(), convert_network_to_scalar(), DatumGetPointer(), gbt_num_consistent(), GIST_LEAF, GISTENTRY::key, sort-test::key, inetkey::lower, PG_GETARG_DATUM, PG_GETARG_POINTER, PG_GETARG_UINT16, PG_RETURN_BOOL, tinfo, and inetkey::upper.

gbt_inet_penalty()

Datum gbt_inet_penalty

(

PG_FUNCTION_ARGS

)

Definition at line 154 of file btree_inet.c.

{
    inetKEY    *origentry = (inetKEY *) DatumGetPointer(((GISTENTRY *) PG_GETARG_POINTER(0))->key);
    inetKEY    *newentry = (inetKEY *) 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);
}

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

gbt_inet_picksplit()

Datum gbt_inet_picksplit

(

PG_FUNCTION_ARGS

)

Definition at line 166 of file btree_inet.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_inet_same()

Datum gbt_inet_same

(

PG_FUNCTION_ARGS

)

Definition at line 174 of file btree_inet.c.

{
    inetKEY    *b1 = (inetKEY *) PG_GETARG_POINTER(0);
    inetKEY    *b2 = (inetKEY *) 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_inet_sortsupport()

Datum gbt_inet_sortsupport

(

PG_FUNCTION_ARGS

)

Definition at line 200 of file btree_inet.c.

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

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

gbt_inet_ssup_cmp()

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

static

Definition at line 185 of file btree_inet.c.

{
    inetKEY    *arg1 = (inetKEY *) DatumGetPointer(x);
    inetKEY    *arg2 = (inetKEY *) DatumGetPointer(y);
 
    /* for leaf items we expect lower == upper, so only compare lower */
    if (arg1->lower < arg2->lower)
        return -1;
    else if (arg1->lower > arg2->lower)
        return 1;
    else
        return 0;
}

References DatumGetPointer(), inetkey::lower, x, and y.

Referenced by gbt_inet_sortsupport().

gbt_inet_union()

Datum gbt_inet_union

(

PG_FUNCTION_ARGS

)

Definition at line 144 of file btree_inet.c.

{
    GistEntryVector *entryvec = (GistEntryVector *) PG_GETARG_POINTER(0);
    void       *out = palloc(sizeof(inetKEY));
 
    *(int *) PG_GETARG_POINTER(1) = sizeof(inetKEY);
    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_ineteq()

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

static

Definition at line 39 of file btree_inet.c.

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

References a, and b.

gbt_inetge()

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

static

Definition at line 34 of file btree_inet.c.

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

References a, and b.

gbt_inetgt()

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

static

Definition at line 29 of file btree_inet.c.

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

References a, and b.

gbt_inetkey_cmp()

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

static

Definition at line 55 of file btree_inet.c.

{
    inetKEY    *ia = (inetKEY *) (((const Nsrt *) a)->t);
    inetKEY    *ib = (inetKEY *) (((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;
}

References a, b, inetkey::lower, and inetkey::upper.

gbt_inetle()

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

static

Definition at line 44 of file btree_inet.c.

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

References a, and b.

gbt_inetlt()

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

static

Definition at line 49 of file btree_inet.c.

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

References a, and b.

PG_FUNCTION_INFO_V1() [1/7]

PG_FUNCTION_INFO_V1

(

gbt_inet_compress

)

PG_FUNCTION_INFO_V1() [2/7]

PG_FUNCTION_INFO_V1

(

gbt_inet_consistent

)

PG_FUNCTION_INFO_V1() [3/7]

PG_FUNCTION_INFO_V1

(

gbt_inet_penalty

)

PG_FUNCTION_INFO_V1() [4/7]

PG_FUNCTION_INFO_V1

(

gbt_inet_picksplit

)

PG_FUNCTION_INFO_V1() [5/7]

PG_FUNCTION_INFO_V1

(

gbt_inet_same

)

PG_FUNCTION_INFO_V1() [6/7]

PG_FUNCTION_INFO_V1

(

gbt_inet_sortsupport

)

PG_FUNCTION_INFO_V1() [7/7]

PG_FUNCTION_INFO_V1

(

gbt_inet_union

)

Variable Documentation

tinfo

const gbtree_ninfo tinfo

static

Initial value:

=
{
    gbt_t_inet,
    sizeof(double),
    16,                         
    gbt_inetgt,
    gbt_inetge,
    gbt_ineteq,
    gbt_inetle,
    gbt_inetlt,
    gbt_inetkey_cmp,
    NULL
}

Definition at line 72 of file btree_inet.c.

Referenced by gbt_inet_consistent(), gbt_inet_picksplit(), gbt_inet_same(), and gbt_inet_union().