PostgreSQL Source Code: contrib/btree_gist/btree_inet.c Source File

PostgreSQL Source Code git master
btree_inet.c
Go to the documentation of this file.
1/*
2 * contrib/btree_gist/btree_inet.c
3 */
4#include "postgres.h"
5
6#include "btree_gist.h"
7#include "btree_utils_num.h"
8#include "catalog/pg_type.h"
9#include "utils/builtins.h"
10#include "utils/rel.h"
11#include "utils/sortsupport.h"
12
13 typedef struct inetkey
14{
15 double lower;
16 double upper;
17 } inetKEY;
18
19/* GiST support functions */
20 PG_FUNCTION_INFO_V1(gbt_inet_compress);
21 PG_FUNCTION_INFO_V1(gbt_inet_union);
22 PG_FUNCTION_INFO_V1(gbt_inet_picksplit);
23 PG_FUNCTION_INFO_V1(gbt_inet_consistent);
24 PG_FUNCTION_INFO_V1(gbt_inet_penalty);
25 PG_FUNCTION_INFO_V1(gbt_inet_same);
26 PG_FUNCTION_INFO_V1(gbt_inet_sortsupport);
27
28
29static bool
30 gbt_inetgt(const void *a, const void *b, FmgrInfo *flinfo)
31{
32 return (*((const double *) a) > *((const double *) b));
33}
34static bool
35 gbt_inetge(const void *a, const void *b, FmgrInfo *flinfo)
36{
37 return (*((const double *) a) >= *((const double *) b));
38}
39static bool
40 gbt_ineteq(const void *a, const void *b, FmgrInfo *flinfo)
41{
42 return (*((const double *) a) == *((const double *) b));
43}
44static bool
45 gbt_inetle(const void *a, const void *b, FmgrInfo *flinfo)
46{
47 return (*((const double *) a) <= *((const double *) b));
48}
49static bool
50 gbt_inetlt(const void *a, const void *b, FmgrInfo *flinfo)
51{
52 return (*((const double *) a) < *((const double *) b));
53}
54
55static int
56 gbt_inetkey_cmp(const void *a, const void *b, FmgrInfo *flinfo)
57{
58 inetKEY *ia = (inetKEY *) (((const Nsrt *) a)->t);
59 inetKEY *ib = (inetKEY *) (((const Nsrt *) b)->t);
60
61 if (ia->lower == ib->lower)
62 {
63 if (ia->upper == ib->upper)
64 return 0;
65
66 return (ia->upper > ib->upper) ? 1 : -1;
67 }
68
69 return (ia->lower > ib->lower) ? 1 : -1;
70}
71
72
73 static const gbtree_ninfo tinfo =
74{
75 gbt_t_inet,
76 sizeof(double),
77 16, /* sizeof(gbtreekey16) */
78 gbt_inetgt,
79 gbt_inetge,
80 gbt_ineteq,
81 gbt_inetle,
82 gbt_inetlt,
83 gbt_inetkey_cmp,
84 NULL
85};
86
87
88/**************************************************
89 * GiST support functions
90 **************************************************/
91
92Datum
93 gbt_inet_compress(PG_FUNCTION_ARGS)
94{
95 GISTENTRY *entry = (GISTENTRY *) PG_GETARG_POINTER(0);
96 GISTENTRY *retval;
97
98 if (entry->leafkey)
99 {
100 inetKEY *r = (inetKEY *) palloc(sizeof(inetKEY));
101 bool failure = false;
102
103 retval = palloc(sizeof(GISTENTRY));
104 r->lower = convert_network_to_scalar(entry->key, INETOID, &failure);
105 Assert(!failure);
106 r->upper = r->lower;
107 gistentryinit(*retval, PointerGetDatum(r),
108 entry->rel, entry->page,
109 entry->offset, false);
110 }
111 else
112 retval = entry;
113
114 PG_RETURN_POINTER(retval);
115}
116
117Datum
118 gbt_inet_consistent(PG_FUNCTION_ARGS)
119{
120 GISTENTRY *entry = (GISTENTRY *) PG_GETARG_POINTER(0);
121 Datum dquery = PG_GETARG_DATUM(1);
122 StrategyNumber strategy = (StrategyNumber) PG_GETARG_UINT16(2);
123
124 /* Oid subtype = PG_GETARG_OID(3); */
125 bool *recheck = (bool *) PG_GETARG_POINTER(4);
126 inetKEY *kkk = (inetKEY *) DatumGetPointer(entry->key);
127 GBT_NUMKEY_R key;
128 double query;
129 bool failure = false;
130
131 query = convert_network_to_scalar(dquery, INETOID, &failure);
132 Assert(!failure);
133
134 /* All cases served by this function are inexact */
135 *recheck = true;
136
137 key.lower = (GBT_NUMKEY *) &kkk->lower;
138 key.upper = (GBT_NUMKEY *) &kkk->upper;
139
140 PG_RETURN_BOOL(gbt_num_consistent(&key, &query,
141 &strategy, GIST_LEAF(entry), &tinfo, fcinfo->flinfo));
142}
143
144Datum
145 gbt_inet_union(PG_FUNCTION_ARGS)
146{
147 GistEntryVector *entryvec = (GistEntryVector *) PG_GETARG_POINTER(0);
148 void *out = palloc(sizeof(inetKEY));
149
150 *(int *) PG_GETARG_POINTER(1) = sizeof(inetKEY);
151 PG_RETURN_POINTER(gbt_num_union(out, entryvec, &tinfo, fcinfo->flinfo));
152}
153
154Datum
155 gbt_inet_penalty(PG_FUNCTION_ARGS)
156{
157 inetKEY *origentry = (inetKEY *) DatumGetPointer(((GISTENTRY *) PG_GETARG_POINTER(0))->key);
158 inetKEY *newentry = (inetKEY *) DatumGetPointer(((GISTENTRY *) PG_GETARG_POINTER(1))->key);
159 float *result = (float *) PG_GETARG_POINTER(2);
160
161 penalty_num(result, origentry->lower, origentry->upper, newentry->lower, newentry->upper);
162
163 PG_RETURN_POINTER(result);
164}
165
166Datum
167 gbt_inet_picksplit(PG_FUNCTION_ARGS)
168{
169 PG_RETURN_POINTER(gbt_num_picksplit((GistEntryVector *) PG_GETARG_POINTER(0),
170 (GIST_SPLITVEC *) PG_GETARG_POINTER(1),
171 &tinfo, fcinfo->flinfo));
172}
173
174Datum
175 gbt_inet_same(PG_FUNCTION_ARGS)
176{
177 inetKEY *b1 = (inetKEY *) PG_GETARG_POINTER(0);
178 inetKEY *b2 = (inetKEY *) PG_GETARG_POINTER(1);
179 bool *result = (bool *) PG_GETARG_POINTER(2);
180
181 *result = gbt_num_same((void *) b1, (void *) b2, &tinfo, fcinfo->flinfo);
182 PG_RETURN_POINTER(result);
183}
184
185static int
186 gbt_inet_ssup_cmp(Datum x, Datum y, SortSupport ssup)
187{
188 inetKEY *arg1 = (inetKEY *) DatumGetPointer(x);
189 inetKEY *arg2 = (inetKEY *) DatumGetPointer(y);
190
191 /* for leaf items we expect lower == upper, so only compare lower */
192 if (arg1->lower < arg2->lower)
193 return -1;
194 else if (arg1->lower > arg2->lower)
195 return 1;
196 else
197 return 0;
198}
199
200Datum
201 gbt_inet_sortsupport(PG_FUNCTION_ARGS)
202{
203 SortSupport ssup = (SortSupport) PG_GETARG_POINTER(0);
204
205 ssup->comparator = gbt_inet_ssup_cmp;
206 ssup->ssup_extra = NULL;
207
208 PG_RETURN_VOID();
209}
@ gbt_t_inet
Definition: btree_gist.h:36
static bool gbt_inetge(const void *a, const void *b, FmgrInfo *flinfo)
Definition: btree_inet.c:35
Datum gbt_inet_union(PG_FUNCTION_ARGS)
Definition: btree_inet.c:145
static int gbt_inetkey_cmp(const void *a, const void *b, FmgrInfo *flinfo)
Definition: btree_inet.c:56
Datum gbt_inet_sortsupport(PG_FUNCTION_ARGS)
Definition: btree_inet.c:201
Datum gbt_inet_picksplit(PG_FUNCTION_ARGS)
Definition: btree_inet.c:167
Datum gbt_inet_compress(PG_FUNCTION_ARGS)
Definition: btree_inet.c:93
static int gbt_inet_ssup_cmp(Datum x, Datum y, SortSupport ssup)
Definition: btree_inet.c:186
Datum gbt_inet_consistent(PG_FUNCTION_ARGS)
Definition: btree_inet.c:118
static bool gbt_inetgt(const void *a, const void *b, FmgrInfo *flinfo)
Definition: btree_inet.c:30
static bool gbt_inetle(const void *a, const void *b, FmgrInfo *flinfo)
Definition: btree_inet.c:45
struct inetkey inetKEY
static const gbtree_ninfo tinfo
Definition: btree_inet.c:73
static bool gbt_inetlt(const void *a, const void *b, FmgrInfo *flinfo)
Definition: btree_inet.c:50
static bool gbt_ineteq(const void *a, const void *b, FmgrInfo *flinfo)
Definition: btree_inet.c:40
PG_FUNCTION_INFO_V1(gbt_inet_compress)
Datum gbt_inet_same(PG_FUNCTION_ARGS)
Definition: btree_inet.c:175
Datum gbt_inet_penalty(PG_FUNCTION_ARGS)
Definition: btree_inet.c:155
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)
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)
char GBT_NUMKEY
#define PG_RETURN_VOID()
Definition: fmgr.h:349
#define PG_GETARG_POINTER(n)
Definition: fmgr.h:276
#define PG_GETARG_DATUM(n)
Definition: fmgr.h:268
#define PG_GETARG_UINT16(n)
Definition: fmgr.h:272
#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
#define gistentryinit(e, k, r, pg, o, l)
Definition: gist.h:245
Assert(PointerIsAligned(start, uint64))
y
int y
Definition: isn.c:76
b
int b
Definition: isn.c:74
x
int x
Definition: isn.c:75
a
int a
Definition: isn.c:73
void * palloc(Size size)
Definition: mcxt.c:1365
double convert_network_to_scalar(Datum value, Oid typid, bool *failure)
Definition: network.c:1435
static Datum PointerGetDatum(const void *X)
Definition: postgres.h:332
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
Definition: gist.h:160
OffsetNumber offset
Definition: gist.h:164
Datum key
Definition: gist.h:161
Page page
Definition: gist.h:163
Relation rel
Definition: gist.h:162
bool leafkey
Definition: gist.h:165
Definition: gist.h:142
int(* comparator)(Datum x, Datum y, SortSupport ssup)
Definition: sortsupport.h:106
void * ssup_extra
Definition: sortsupport.h:87
double lower
Definition: btree_inet.c:15
double upper
Definition: btree_inet.c:16

AltStyle によって変換されたページ (->オリジナル) /