#include "postgres.h"#include "btree_gist.h"#include "btree_utils_num.h"
Go to the source code of this file.
Data Structures | |
| struct | int64key |
Typedefs | |
| typedef struct int64key | int64KEY |
Functions | |
| PG_FUNCTION_INFO_V1 (gbt_int8_compress) | |
| PG_FUNCTION_INFO_V1 (gbt_int8_union) | |
| PG_FUNCTION_INFO_V1 (gbt_int8_picksplit) | |
| PG_FUNCTION_INFO_V1 (gbt_int8_consistent) | |
| PG_FUNCTION_INFO_V1 (gbt_int8_distance) | |
| PG_FUNCTION_INFO_V1 (gbt_int8_penalty) | |
| PG_FUNCTION_INFO_V1 (gbt_int8_same) | |
| Datum | gbt_int8_compress (PG_FUNCTION_ARGS) |
| Datum | gbt_int8_union (PG_FUNCTION_ARGS) |
| Datum | gbt_int8_picksplit (PG_FUNCTION_ARGS) |
| Datum | gbt_int8_consistent (PG_FUNCTION_ARGS) |
| Datum | gbt_int8_distance (PG_FUNCTION_ARGS) |
| Datum | gbt_int8_penalty (PG_FUNCTION_ARGS) |
| Datum | gbt_int8_same (PG_FUNCTION_ARGS) |
| static bool | gbt_int8gt (const void *a, const void *b) |
| static bool | gbt_int8ge (const void *a, const void *b) |
| static bool | gbt_int8eq (const void *a, const void *b) |
| static bool | gbt_int8le (const void *a, const void *b) |
| static bool | gbt_int8lt (const void *a, const void *b) |
| static int | gbt_int8key_cmp (const void *a, const void *b) |
| static float8 | gbt_int8_dist (const void *a, const void *b) |
| PG_FUNCTION_INFO_V1 (int8_dist) | |
| Datum | int8_dist (PG_FUNCTION_ARGS) |
Variables | |
| static const gbtree_ninfo | tinfo |
| Datum gbt_int8_compress | ( | PG_FUNCTION_ARGS | ) |
Definition at line 128 of file btree_int8.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_int8_consistent | ( | PG_FUNCTION_ARGS | ) |
Definition at line 138 of file btree_int8.c.
References DatumGetPointer, gbt_num_consistent(), GIST_LEAF, GISTENTRY::key, int64key::lower, GBT_NUMKEY_R::lower, PG_GETARG_INT64, PG_GETARG_POINTER, PG_GETARG_UINT16, PG_RETURN_BOOL, int64key::upper, and GBT_NUMKEY_R::upper.
{
GISTENTRY *entry = (GISTENTRY *) PG_GETARG_POINTER(0);
int64 query = PG_GETARG_INT64(1);
StrategyNumber strategy = (StrategyNumber) PG_GETARG_UINT16(2);
/* Oid subtype = PG_GETARG_OID(3); */
bool *recheck = (bool *) PG_GETARG_POINTER(4);
int64KEY *kkk = (int64KEY *) 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_int8_dist | ( | const void * | a, | |
| const void * | b | |||
| ) | [static] |
Definition at line 79 of file btree_int8.c.
References GET_FLOAT_DISTANCE.
{
return GET_FLOAT_DISTANCE(int64, a, b);
}
| Datum gbt_int8_distance | ( | PG_FUNCTION_ARGS | ) |
Definition at line 162 of file btree_int8.c.
References DatumGetPointer, gbt_num_distance(), GIST_LEAF, GISTENTRY::key, int64key::lower, GBT_NUMKEY_R::lower, PG_GETARG_INT64, PG_GETARG_POINTER, PG_RETURN_FLOAT8, int64key::upper, and GBT_NUMKEY_R::upper.
{
GISTENTRY *entry = (GISTENTRY *) PG_GETARG_POINTER(0);
int64 query = PG_GETARG_INT64(1);
/* Oid subtype = PG_GETARG_OID(3); */
int64KEY *kkk = (int64KEY *) 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_int8_penalty | ( | PG_FUNCTION_ARGS | ) |
Definition at line 192 of file btree_int8.c.
References DatumGetPointer, int64key::lower, penalty_num, PG_GETARG_POINTER, PG_RETURN_POINTER, and int64key::upper.
{
int64KEY *origentry = (int64KEY *) DatumGetPointer(((GISTENTRY *) PG_GETARG_POINTER(0))->key);
int64KEY *newentry = (int64KEY *) 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_int8_picksplit | ( | PG_FUNCTION_ARGS | ) |
Definition at line 204 of file btree_int8.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_int8_same | ( | PG_FUNCTION_ARGS | ) |
Definition at line 214 of file btree_int8.c.
References gbt_num_same(), PG_GETARG_POINTER, and PG_RETURN_POINTER.
{
int64KEY *b1 = (int64KEY *) PG_GETARG_POINTER(0);
int64KEY *b2 = (int64KEY *) 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_int8_union | ( | PG_FUNCTION_ARGS | ) |
Definition at line 181 of file btree_int8.c.
References gbt_num_union(), palloc(), PG_GETARG_POINTER, and PG_RETURN_POINTER.
{
GistEntryVector *entryvec = (GistEntryVector *) PG_GETARG_POINTER(0);
void *out = palloc(sizeof(int64KEY));
*(int *) PG_GETARG_POINTER(1) = sizeof(int64KEY);
PG_RETURN_POINTER(gbt_num_union((void *) out, entryvec, &tinfo));
}
| static bool gbt_int8eq | ( | const void * | a, | |
| const void * | b | |||
| ) | [static] |
Definition at line 46 of file btree_int8.c.
{
return (*((const int64 *) a) == *((const int64 *) b));
}
| static bool gbt_int8ge | ( | const void * | a, | |
| const void * | b | |||
| ) | [static] |
Definition at line 41 of file btree_int8.c.
{
return (*((const int64 *) a) >= *((const int64 *) b));
}
| static bool gbt_int8gt | ( | const void * | a, | |
| const void * | b | |||
| ) | [static] |
Definition at line 36 of file btree_int8.c.
{
return (*((const int64 *) a) > *((const int64 *) b));
}
| static int gbt_int8key_cmp | ( | const void * | a, | |
| const void * | b | |||
| ) | [static] |
Definition at line 62 of file btree_int8.c.
References int64key::lower, and int64key::upper.
| static bool gbt_int8le | ( | const void * | a, | |
| const void * | b | |||
| ) | [static] |
Definition at line 51 of file btree_int8.c.
{
return (*((const int64 *) a) <= *((const int64 *) b));
}
| static bool gbt_int8lt | ( | const void * | a, | |
| const void * | b | |||
| ) | [static] |
Definition at line 56 of file btree_int8.c.
{
return (*((const int64 *) a) < *((const int64 *) b));
}
| Datum int8_dist | ( | PG_FUNCTION_ARGS | ) |
Definition at line 102 of file btree_int8.c.
References Abs, ereport, errcode(), errmsg(), ERROR, PG_GETARG_INT64, PG_RETURN_INT64, and SAMESIGN.
{
int64 a = PG_GETARG_INT64(0);
int64 b = PG_GETARG_INT64(1);
int64 r;
int64 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("bigint out of range")));
PG_RETURN_INT64(ra);
}
| PG_FUNCTION_INFO_V1 | ( | gbt_int8_consistent | ) |
| PG_FUNCTION_INFO_V1 | ( | gbt_int8_compress | ) |
| PG_FUNCTION_INFO_V1 | ( | gbt_int8_union | ) |
| PG_FUNCTION_INFO_V1 | ( | gbt_int8_same | ) |
| PG_FUNCTION_INFO_V1 | ( | gbt_int8_penalty | ) |
| PG_FUNCTION_INFO_V1 | ( | gbt_int8_picksplit | ) |
| PG_FUNCTION_INFO_V1 | ( | gbt_int8_distance | ) |
| PG_FUNCTION_INFO_V1 | ( | int8_dist | ) |
const gbtree_ninfo tinfo [static] |
{
gbt_t_int8,
sizeof(int64),
gbt_int8gt,
gbt_int8ge,
gbt_int8eq,
gbt_int8le,
gbt_int8lt,
gbt_int8key_cmp,
gbt_int8_dist
}
Definition at line 85 of file btree_int8.c.
1.7.1