Thanks to visit codestin.com
Credit goes to doxygen.postgresql.org

PostgreSQL Source Code git master
btree_int4.c
Go to the documentation of this file.
1/*
2 * contrib/btree_gist/btree_int4.c
3 */
4#include "postgres.h"
5#include "btree_gist.h"
6#include "btree_utils_num.h"
7#include "common/int.h"
8#include "utils/rel.h"
9#include "utils/sortsupport.h"
10
11typedef struct int32key
12{
16
17/* GiST support functions */
27
28static bool
29gbt_int4gt(const void *a, const void *b, FmgrInfo *flinfo)
30{
31 return (*((const int32 *) a) > *((const int32 *) b));
32}
33static bool
34gbt_int4ge(const void *a, const void *b, FmgrInfo *flinfo)
35{
36 return (*((const int32 *) a) >= *((const int32 *) b));
37}
38static bool
39gbt_int4eq(const void *a, const void *b, FmgrInfo *flinfo)
40{
41 return (*((const int32 *) a) == *((const int32 *) b));
42}
43static bool
44gbt_int4le(const void *a, const void *b, FmgrInfo *flinfo)
45{
46 return (*((const int32 *) a) <= *((const int32 *) b));
47}
48static bool
49gbt_int4lt(const void *a, const void *b, FmgrInfo *flinfo)
50{
51 return (*((const int32 *) a) < *((const int32 *) b));
52}
53
54static int
55gbt_int4key_cmp(const void *a, const void *b, FmgrInfo *flinfo)
56{
57 int32KEY *ia = (int32KEY *) (((const Nsrt *) a)->t);
58 int32KEY *ib = (int32KEY *) (((const Nsrt *) b)->t);
59
60 if (ia->lower == ib->lower)
61 {
62 if (ia->upper == ib->upper)
63 return 0;
64
65 return (ia->upper > ib->upper) ? 1 : -1;
66 }
67
68 return (ia->lower > ib->lower) ? 1 : -1;
69}
70
71static float8
72gbt_int4_dist(const void *a, const void *b, FmgrInfo *flinfo)
73{
74 return GET_FLOAT_DISTANCE(int32, a, b);
75}
76
77
78static const gbtree_ninfo tinfo =
79{
81 sizeof(int32),
82 8, /* sizeof(gbtreekey8) */
90};
91
92
96{
99 int32 r;
100 int32 ra;
101
102 if (pg_sub_s32_overflow(a, b, &r) ||
103 r == PG_INT32_MIN)
105 (errcode(ERRCODE_NUMERIC_VALUE_OUT_OF_RANGE),
106 errmsg("integer out of range")));
107
108 ra = abs(r);
109
110 PG_RETURN_INT32(ra);
111}
112
113
114/**************************************************
115 * GiST support functions
116 **************************************************/
117
118Datum
120{
121 GISTENTRY *entry = (GISTENTRY *) PG_GETARG_POINTER(0);
122
124}
125
126Datum
128{
129 GISTENTRY *entry = (GISTENTRY *) PG_GETARG_POINTER(0);
130
132}
133
134Datum
136{
137 GISTENTRY *entry = (GISTENTRY *) PG_GETARG_POINTER(0);
138 int32 query = PG_GETARG_INT32(1);
140
141 /* Oid subtype = PG_GETARG_OID(3); */
142 bool *recheck = (bool *) PG_GETARG_POINTER(4);
143 int32KEY *kkk = (int32KEY *) DatumGetPointer(entry->key);
145
146 /* All cases served by this function are exact */
147 *recheck = false;
148
149 key.lower = (GBT_NUMKEY *) &kkk->lower;
150 key.upper = (GBT_NUMKEY *) &kkk->upper;
151
152 PG_RETURN_BOOL(gbt_num_consistent(&key, &query, &strategy,
153 GIST_LEAF(entry), &tinfo, fcinfo->flinfo));
154}
155
156Datum
158{
159 GISTENTRY *entry = (GISTENTRY *) PG_GETARG_POINTER(0);
160 int32 query = PG_GETARG_INT32(1);
161
162 /* Oid subtype = PG_GETARG_OID(3); */
163 int32KEY *kkk = (int32KEY *) DatumGetPointer(entry->key);
165
166 key.lower = (GBT_NUMKEY *) &kkk->lower;
167 key.upper = (GBT_NUMKEY *) &kkk->upper;
168
170 &tinfo, fcinfo->flinfo));
171}
172
173Datum
175{
177 void *out = palloc(sizeof(int32KEY));
178
179 *(int *) PG_GETARG_POINTER(1) = sizeof(int32KEY);
180 PG_RETURN_POINTER(gbt_num_union(out, entryvec, &tinfo, fcinfo->flinfo));
181}
182
183Datum
185{
186 int32KEY *origentry = (int32KEY *) DatumGetPointer(((GISTENTRY *) PG_GETARG_POINTER(0))->key);
188 float *result = (float *) PG_GETARG_POINTER(2);
189
190 penalty_num(result, origentry->lower, origentry->upper, newentry->lower, newentry->upper);
191
192 PG_RETURN_POINTER(result);
193}
194
195Datum
197{
200 &tinfo, fcinfo->flinfo));
201}
202
203Datum
205{
208 bool *result = (bool *) PG_GETARG_POINTER(2);
209
210 *result = gbt_num_same((void *) b1, (void *) b2, &tinfo, fcinfo->flinfo);
211 PG_RETURN_POINTER(result);
212}
213
214static int
216{
219
220 /* for leaf items we expect lower == upper, so only compare lower */
221 if (ia->lower < ib->lower)
222 return -1;
223 else if (ia->lower > ib->lower)
224 return 1;
225 else
226 return 0;
227}
228
229Datum
231{
233
236}
@ gbt_t_int4
Definition: btree_gist.h:18
static bool gbt_int4lt(const void *a, const void *b, FmgrInfo *flinfo)
Definition: btree_int4.c:49
PG_FUNCTION_INFO_V1(gbt_int4_compress)
static bool gbt_int4eq(const void *a, const void *b, FmgrInfo *flinfo)
Definition: btree_int4.c:39
static int gbt_int4key_cmp(const void *a, const void *b, FmgrInfo *flinfo)
Definition: btree_int4.c:55
Datum gbt_int4_penalty(PG_FUNCTION_ARGS)
Definition: btree_int4.c:184
Datum gbt_int4_consistent(PG_FUNCTION_ARGS)
Definition: btree_int4.c:135
static bool gbt_int4ge(const void *a, const void *b, FmgrInfo *flinfo)
Definition: btree_int4.c:34
Datum gbt_int4_same(PG_FUNCTION_ARGS)
Definition: btree_int4.c:204
Datum gbt_int4_distance(PG_FUNCTION_ARGS)
Definition: btree_int4.c:157
Datum gbt_int4_fetch(PG_FUNCTION_ARGS)
Definition: btree_int4.c:127
Datum gbt_int4_union(PG_FUNCTION_ARGS)
Definition: btree_int4.c:174
static bool gbt_int4gt(const void *a, const void *b, FmgrInfo *flinfo)
Definition: btree_int4.c:29
static bool gbt_int4le(const void *a, const void *b, FmgrInfo *flinfo)
Definition: btree_int4.c:44
static float8 gbt_int4_dist(const void *a, const void *b, FmgrInfo *flinfo)
Definition: btree_int4.c:72
struct int32key int32KEY
static const gbtree_ninfo tinfo
Definition: btree_int4.c:78
Datum gbt_int4_sortsupport(PG_FUNCTION_ARGS)
Definition: btree_int4.c:230
Datum int4_dist(PG_FUNCTION_ARGS)
Definition: btree_int4.c:95
Datum gbt_int4_picksplit(PG_FUNCTION_ARGS)
Definition: btree_int4.c:196
static int gbt_int4_ssup_cmp(Datum a, Datum b, SortSupport ssup)
Definition: btree_int4.c:215
Datum gbt_int4_compress(PG_FUNCTION_ARGS)
Definition: btree_int4.c:119
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
double float8
Definition: c.h:636
int32_t int32
Definition: c.h:535
#define PG_INT32_MIN
Definition: c.h:594
int errcode(int sqlerrcode)
Definition: elog.c:854
int errmsg(const char *fmt,...)
Definition: elog.c:1071
#define ERROR
Definition: elog.h:39
#define ereport(elevel,...)
Definition: elog.h:150
#define PG_RETURN_VOID()
Definition: fmgr.h:349
#define PG_RETURN_FLOAT8(x)
Definition: fmgr.h:367
#define PG_GETARG_POINTER(n)
Definition: fmgr.h:276
#define PG_GETARG_UINT16(n)
Definition: fmgr.h:272
#define PG_RETURN_INT32(x)
Definition: fmgr.h:354
#define PG_GETARG_INT32(n)
Definition: fmgr.h:269
#define PG_RETURN_POINTER(x)
Definition: fmgr.h:361
#define PG_FUNCTION_ARGS
Definition: fmgr.h:193
#define PG_RETURN_BOOL(x)
Definition: fmgr.h:359
#define GIST_LEAF(entry)
Definition: gist.h:171
static bool pg_sub_s32_overflow(int32 a, int32 b, int32 *result)
Definition: int.h:169
int b
Definition: isn.c:74
int a
Definition: isn.c:73
void * palloc(Size size)
Definition: mcxt.c:1365
uint64_t Datum
Definition: postgres.h:70
static Pointer DatumGetPointer(Datum X)
Definition: postgres.h:322
struct SortSupportData * SortSupport
Definition: sortsupport.h:58
uint16 StrategyNumber
Definition: stratnum.h:22
Definition: fmgr.h:57
Datum key
Definition: gist.h:161
int(* comparator)(Datum x, Datum y, SortSupport ssup)
Definition: sortsupport.h:106
int32 upper
Definition: btree_int4.c:14
int32 lower
Definition: btree_int4.c:13