#include "postgres.h"#include "btree_gist.h"#include "btree_utils_num.h"
Go to the source code of this file.
Data Structures | |
| struct | int16key |
Typedefs | |
| typedef struct int16key | int16KEY |
Functions | |
| PG_FUNCTION_INFO_V1 (gbt_int2_compress) | |
| PG_FUNCTION_INFO_V1 (gbt_int2_union) | |
| PG_FUNCTION_INFO_V1 (gbt_int2_picksplit) | |
| PG_FUNCTION_INFO_V1 (gbt_int2_consistent) | |
| PG_FUNCTION_INFO_V1 (gbt_int2_distance) | |
| PG_FUNCTION_INFO_V1 (gbt_int2_penalty) | |
| PG_FUNCTION_INFO_V1 (gbt_int2_same) | |
| Datum | gbt_int2_compress (PG_FUNCTION_ARGS) |
| Datum | gbt_int2_union (PG_FUNCTION_ARGS) |
| Datum | gbt_int2_picksplit (PG_FUNCTION_ARGS) |
| Datum | gbt_int2_consistent (PG_FUNCTION_ARGS) |
| Datum | gbt_int2_distance (PG_FUNCTION_ARGS) |
| Datum | gbt_int2_penalty (PG_FUNCTION_ARGS) |
| Datum | gbt_int2_same (PG_FUNCTION_ARGS) |
| static bool | gbt_int2gt (const void *a, const void *b) |
| static bool | gbt_int2ge (const void *a, const void *b) |
| static bool | gbt_int2eq (const void *a, const void *b) |
| static bool | gbt_int2le (const void *a, const void *b) |
| static bool | gbt_int2lt (const void *a, const void *b) |
| static int | gbt_int2key_cmp (const void *a, const void *b) |
| static float8 | gbt_int2_dist (const void *a, const void *b) |
| PG_FUNCTION_INFO_V1 (int2_dist) | |
| Datum | int2_dist (PG_FUNCTION_ARGS) |
Variables | |
| static const gbtree_ninfo | tinfo |
| Datum gbt_int2_compress | ( | PG_FUNCTION_ARGS | ) |
Definition at line 127 of file btree_int2.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_int2_consistent | ( | PG_FUNCTION_ARGS | ) |
Definition at line 137 of file btree_int2.c.
References DatumGetPointer, gbt_num_consistent(), GIST_LEAF, GISTENTRY::key, int16key::lower, GBT_NUMKEY_R::lower, PG_GETARG_INT16, PG_GETARG_POINTER, PG_GETARG_UINT16, PG_RETURN_BOOL, int16key::upper, and GBT_NUMKEY_R::upper.
{
GISTENTRY *entry = (GISTENTRY *) PG_GETARG_POINTER(0);
int16 query = PG_GETARG_INT16(1);
StrategyNumber strategy = (StrategyNumber) PG_GETARG_UINT16(2);
/* Oid subtype = PG_GETARG_OID(3); */
bool *recheck = (bool *) PG_GETARG_POINTER(4);
int16KEY *kkk = (int16KEY *) 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_int2_dist | ( | const void * | a, | |
| const void * | b | |||
| ) | [static] |
Definition at line 78 of file btree_int2.c.
References GET_FLOAT_DISTANCE.
{
return GET_FLOAT_DISTANCE(int16, a, b);
}
| Datum gbt_int2_distance | ( | PG_FUNCTION_ARGS | ) |
Definition at line 161 of file btree_int2.c.
References DatumGetPointer, gbt_num_distance(), GIST_LEAF, GISTENTRY::key, int16key::lower, GBT_NUMKEY_R::lower, PG_GETARG_INT16, PG_GETARG_POINTER, PG_RETURN_FLOAT8, int16key::upper, and GBT_NUMKEY_R::upper.
{
GISTENTRY *entry = (GISTENTRY *) PG_GETARG_POINTER(0);
int16 query = PG_GETARG_INT16(1);
/* Oid subtype = PG_GETARG_OID(3); */
int16KEY *kkk = (int16KEY *) 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_int2_penalty | ( | PG_FUNCTION_ARGS | ) |
Definition at line 191 of file btree_int2.c.
References DatumGetPointer, int16key::lower, penalty_num, PG_GETARG_POINTER, PG_RETURN_POINTER, and int16key::upper.
{
int16KEY *origentry = (int16KEY *) DatumGetPointer(((GISTENTRY *) PG_GETARG_POINTER(0))->key);
int16KEY *newentry = (int16KEY *) 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_int2_picksplit | ( | PG_FUNCTION_ARGS | ) |
Definition at line 203 of file btree_int2.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_int2_same | ( | PG_FUNCTION_ARGS | ) |
Definition at line 213 of file btree_int2.c.
References gbt_num_same(), PG_GETARG_POINTER, and PG_RETURN_POINTER.
{
int16KEY *b1 = (int16KEY *) PG_GETARG_POINTER(0);
int16KEY *b2 = (int16KEY *) 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_int2_union | ( | PG_FUNCTION_ARGS | ) |
Definition at line 180 of file btree_int2.c.
References gbt_num_union(), palloc(), PG_GETARG_POINTER, and PG_RETURN_POINTER.
{
GistEntryVector *entryvec = (GistEntryVector *) PG_GETARG_POINTER(0);
void *out = palloc(sizeof(int16KEY));
*(int *) PG_GETARG_POINTER(1) = sizeof(int16KEY);
PG_RETURN_POINTER(gbt_num_union((void *) out, entryvec, &tinfo));
}
| static bool gbt_int2eq | ( | const void * | a, | |
| const void * | b | |||
| ) | [static] |
Definition at line 45 of file btree_int2.c.
| static bool gbt_int2ge | ( | const void * | a, | |
| const void * | b | |||
| ) | [static] |
Definition at line 40 of file btree_int2.c.
| static bool gbt_int2gt | ( | const void * | a, | |
| const void * | b | |||
| ) | [static] |
Definition at line 35 of file btree_int2.c.
| static int gbt_int2key_cmp | ( | const void * | a, | |
| const void * | b | |||
| ) | [static] |
Definition at line 61 of file btree_int2.c.
References int16key::lower, and int16key::upper.
| static bool gbt_int2le | ( | const void * | a, | |
| const void * | b | |||
| ) | [static] |
Definition at line 50 of file btree_int2.c.
| static bool gbt_int2lt | ( | const void * | a, | |
| const void * | b | |||
| ) | [static] |
Definition at line 55 of file btree_int2.c.
| Datum int2_dist | ( | PG_FUNCTION_ARGS | ) |
Definition at line 101 of file btree_int2.c.
References Abs, ereport, errcode(), errmsg(), ERROR, PG_GETARG_INT16, PG_RETURN_INT16, and SAMESIGN.
{
int16 a = PG_GETARG_INT16(0);
int16 b = PG_GETARG_INT16(1);
int16 r;
int16 ra;
r = a - b;
ra = Abs(r);
/* Overflow check. */
if (ra < 0 || (!SAMESIGN(a, b) && !SAMESIGN(r, a)))
ereport(ERROR,
(errcode(ERRCODE_NUMERIC_VALUE_OUT_OF_RANGE),
errmsg("smallint out of range")));
PG_RETURN_INT16(ra);
}
| PG_FUNCTION_INFO_V1 | ( | gbt_int2_consistent | ) |
| PG_FUNCTION_INFO_V1 | ( | gbt_int2_compress | ) |
| PG_FUNCTION_INFO_V1 | ( | gbt_int2_union | ) |
| PG_FUNCTION_INFO_V1 | ( | gbt_int2_same | ) |
| PG_FUNCTION_INFO_V1 | ( | gbt_int2_penalty | ) |
| PG_FUNCTION_INFO_V1 | ( | gbt_int2_picksplit | ) |
| PG_FUNCTION_INFO_V1 | ( | gbt_int2_distance | ) |
| PG_FUNCTION_INFO_V1 | ( | int2_dist | ) |
const gbtree_ninfo tinfo [static] |
{
gbt_t_int2,
sizeof(int16),
gbt_int2gt,
gbt_int2ge,
gbt_int2eq,
gbt_int2le,
gbt_int2lt,
gbt_int2key_cmp,
gbt_int2_dist
}
Definition at line 84 of file btree_int2.c.
1.7.1