PostgreSQL Source Code git master
Loading...
Searching...
No Matches
btree_int8.c
Go to the documentation of this file.
1/*
2 * contrib/btree_gist/btree_int8.c
3 */
4#include "postgres.h"
5
6#include "btree_gist.h"
7#include "btree_utils_num.h"
8#include "common/int.h"
9#include "utils/rel.h"
10#include "utils/sortsupport.h"
11
17
18/* GiST support functions */
28
29
30static bool
31gbt_int8gt(const void *a, const void *b, FmgrInfo *flinfo)
32{
33 return (*((const int64 *) a) > *((const int64 *) b));
34}
35static bool
36gbt_int8ge(const void *a, const void *b, FmgrInfo *flinfo)
37{
38 return (*((const int64 *) a) >= *((const int64 *) b));
39}
40static bool
41gbt_int8eq(const void *a, const void *b, FmgrInfo *flinfo)
42{
43 return (*((const int64 *) a) == *((const int64 *) b));
44}
45static bool
46gbt_int8le(const void *a, const void *b, FmgrInfo *flinfo)
47{
48 return (*((const int64 *) a) <= *((const int64 *) b));
49}
50static bool
51gbt_int8lt(const void *a, const void *b, FmgrInfo *flinfo)
52{
53 return (*((const int64 *) a) < *((const int64 *) b));
54}
55
56static int
57gbt_int8key_cmp(const void *a, const void *b, FmgrInfo *flinfo)
58{
59 int64KEY *ia = (int64KEY *) (((const Nsrt *) a)->t);
60 int64KEY *ib = (int64KEY *) (((const Nsrt *) b)->t);
61
62 if (ia->lower == ib->lower)
63 {
64 if (ia->upper == ib->upper)
65 return 0;
66
67 return (ia->upper > ib->upper) ? 1 : -1;
68 }
69
70 return (ia->lower > ib->lower) ? 1 : -1;
71}
72
73static float8
74gbt_int8_dist(const void *a, const void *b, FmgrInfo *flinfo)
75{
76 return GET_FLOAT_DISTANCE(int64, a, b);
77}
78
79
80static const gbtree_ninfo tinfo =
81{
83 sizeof(int64),
84 16, /* sizeof(gbtreekey16) */
92};
93
94
98{
101 int64 r;
102 int64 ra;
103
104 if (pg_sub_s64_overflow(a, b, &r) ||
105 r == PG_INT64_MIN)
108 errmsg("bigint out of range")));
109
110 ra = i64abs(r);
111
113}
114
115
116/**************************************************
117 * GiST support functions
118 **************************************************/
119
120Datum
127
128Datum
135
136Datum
138{
139 GISTENTRY *entry = (GISTENTRY *) PG_GETARG_POINTER(0);
140 int64 query = PG_GETARG_INT64(1);
142#ifdef NOT_USED
143 Oid subtype = PG_GETARG_OID(3);
144#endif
145 bool *recheck = (bool *) PG_GETARG_POINTER(4);
146 int64KEY *kkk = (int64KEY *) DatumGetPointer(entry->key);
147 GBT_NUMKEY_R key;
148
149 /* All cases served by this function are exact */
150 *recheck = false;
151
152 key.lower = (GBT_NUMKEY *) &kkk->lower;
153 key.upper = (GBT_NUMKEY *) &kkk->upper;
154
155 PG_RETURN_BOOL(gbt_num_consistent(&key, &query, &strategy,
156 GIST_LEAF(entry), &tinfo, fcinfo->flinfo));
157}
158
159Datum
161{
162 GISTENTRY *entry = (GISTENTRY *) PG_GETARG_POINTER(0);
163 int64 query = PG_GETARG_INT64(1);
164#ifdef NOT_USED
165 Oid subtype = PG_GETARG_OID(3);
166#endif
167 int64KEY *kkk = (int64KEY *) DatumGetPointer(entry->key);
168 GBT_NUMKEY_R key;
169
170 key.lower = (GBT_NUMKEY *) &kkk->lower;
171 key.upper = (GBT_NUMKEY *) &kkk->upper;
172
173 PG_RETURN_FLOAT8(gbt_num_distance(&key, &query, GIST_LEAF(entry),
174 &tinfo, fcinfo->flinfo));
175}
176
177Datum
179{
181 void *out = palloc(sizeof(int64KEY));
182
183 *(int *) PG_GETARG_POINTER(1) = sizeof(int64KEY);
184 PG_RETURN_POINTER(gbt_num_union(out, entryvec, &tinfo, fcinfo->flinfo));
185}
186
187Datum
189{
192 float *result = (float *) PG_GETARG_POINTER(2);
193
194 penalty_num(result, origentry->lower, origentry->upper, newentry->lower, newentry->upper);
195
196 PG_RETURN_POINTER(result);
197}
198
199Datum
206
207Datum
209{
212 bool *result = (bool *) PG_GETARG_POINTER(2);
213
214 *result = gbt_num_same((void *) b1, (void *) b2, &tinfo, fcinfo->flinfo);
215 PG_RETURN_POINTER(result);
216}
217
218static int
220{
223
224 /* for leaf items we expect lower == upper, so only compare lower */
225 if (arg1->lower < arg2->lower)
226 return -1;
227 else if (arg1->lower > arg2->lower)
228 return 1;
229 else
230 return 0;
231
232}
233
234Datum
@ gbt_t_int8
Definition btree_gist.h:19
static bool gbt_int8lt(const void *a, const void *b, FmgrInfo *flinfo)
Definition btree_int8.c:51
Datum gbt_int8_picksplit(PG_FUNCTION_ARGS)
Definition btree_int8.c:200
Datum gbt_int8_consistent(PG_FUNCTION_ARGS)
Definition btree_int8.c:137
Datum gbt_int8_union(PG_FUNCTION_ARGS)
Definition btree_int8.c:178
static float8 gbt_int8_dist(const void *a, const void *b, FmgrInfo *flinfo)
Definition btree_int8.c:74
Datum gbt_int8_distance(PG_FUNCTION_ARGS)
Definition btree_int8.c:160
static int gbt_int8_ssup_cmp(Datum x, Datum y, SortSupport ssup)
Definition btree_int8.c:219
Datum gbt_int8_penalty(PG_FUNCTION_ARGS)
Definition btree_int8.c:188
Datum gbt_int8_sortsupport(PG_FUNCTION_ARGS)
Definition btree_int8.c:235
static bool gbt_int8eq(const void *a, const void *b, FmgrInfo *flinfo)
Definition btree_int8.c:41
static int gbt_int8key_cmp(const void *a, const void *b, FmgrInfo *flinfo)
Definition btree_int8.c:57
static const gbtree_ninfo tinfo
Definition btree_int8.c:80
struct int64key int64KEY
Datum gbt_int8_compress(PG_FUNCTION_ARGS)
Definition btree_int8.c:121
Datum gbt_int8_fetch(PG_FUNCTION_ARGS)
Definition btree_int8.c:129
static bool gbt_int8ge(const void *a, const void *b, FmgrInfo *flinfo)
Definition btree_int8.c:36
Datum gbt_int8_same(PG_FUNCTION_ARGS)
Definition btree_int8.c:208
static bool gbt_int8gt(const void *a, const void *b, FmgrInfo *flinfo)
Definition btree_int8.c:31
static bool gbt_int8le(const void *a, const void *b, FmgrInfo *flinfo)
Definition btree_int8.c:46
Datum int8_dist(PG_FUNCTION_ARGS)
Definition btree_int8.c:97
GISTENTRY * gbt_num_compress(GISTENTRY *entry, const gbtree_ninfo *tinfo)
float8 gbt_num_distance(const GBT_NUMKEY_R *key, const void *query, bool is_leaf, const gbtree_ninfo *tinfo, FmgrInfo *flinfo)
bool gbt_num_consistent(const GBT_NUMKEY_R *key, const void *query, const StrategyNumber *strategy, bool is_leaf, const gbtree_ninfo *tinfo, FmgrInfo *flinfo)
bool gbt_num_same(const GBT_NUMKEY *a, const GBT_NUMKEY *b, const gbtree_ninfo *tinfo, FmgrInfo *flinfo)
GISTENTRY * gbt_num_fetch(GISTENTRY *entry, const gbtree_ninfo *tinfo)
GIST_SPLITVEC * gbt_num_picksplit(const GistEntryVector *entryvec, GIST_SPLITVEC *v, const gbtree_ninfo *tinfo, FmgrInfo *flinfo)
void * gbt_num_union(GBT_NUMKEY *out, const GistEntryVector *entryvec, const gbtree_ninfo *tinfo, FmgrInfo *flinfo)
#define penalty_num(result, olower, oupper, nlower, nupper)
#define GET_FLOAT_DISTANCE(t, arg1, arg2)
char GBT_NUMKEY
int64_t int64
Definition c.h:543
double float8
Definition c.h:644
#define PG_INT64_MIN
Definition c.h:605
int errcode(int sqlerrcode)
Definition elog.c:863
int errmsg(const char *fmt,...)
Definition elog.c:1080
#define ERROR
Definition elog.h:39
#define ereport(elevel,...)
Definition elog.h:150
#define PG_RETURN_VOID()
Definition fmgr.h:350
#define PG_GETARG_OID(n)
Definition fmgr.h:275
#define PG_RETURN_FLOAT8(x)
Definition fmgr.h:369
#define PG_GETARG_POINTER(n)
Definition fmgr.h:277
#define PG_RETURN_INT64(x)
Definition fmgr.h:370
#define PG_GETARG_INT64(n)
Definition fmgr.h:284
#define PG_FUNCTION_INFO_V1(funcname)
Definition fmgr.h:417
#define PG_GETARG_UINT16(n)
Definition fmgr.h:272
#define PG_RETURN_POINTER(x)
Definition fmgr.h:363
#define PG_FUNCTION_ARGS
Definition fmgr.h:193
#define PG_RETURN_BOOL(x)
Definition fmgr.h:360
#define GIST_LEAF(entry)
Definition gist.h:171
static bool pg_sub_s64_overflow(int64 a, int64 b, int64 *result)
Definition int.h:262
int y
Definition isn.c:76
int b
Definition isn.c:74
int x
Definition isn.c:75
int a
Definition isn.c:73
void * palloc(Size size)
Definition mcxt.c:1387
uint64_t Datum
Definition postgres.h:70
static Pointer DatumGetPointer(Datum X)
Definition postgres.h:342
unsigned int Oid
static int fb(int x)
struct SortSupportData * SortSupport
Definition sortsupport.h:58
uint16 StrategyNumber
Definition stratnum.h:22
Datum key
Definition gist.h:161
int(* comparator)(Datum x, Datum y, SortSupport ssup)
int64 lower
Definition btree_int8.c:14
int64 upper
Definition btree_int8.c:15