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
11typedef struct inetkey
12{
13 double lower;
14 double upper;
16
17/*
18** inet ops
19*/
26
27
28static bool
29gbt_inetgt(const void *a, const void *b, FmgrInfo *flinfo)
30{
31 return (*((const double *) a) > *((const double *) b));
32}
33static bool
34gbt_inetge(const void *a, const void *b, FmgrInfo *flinfo)
35{
36 return (*((const double *) a) >= *((const double *) b));
37}
38static bool
39gbt_ineteq(const void *a, const void *b, FmgrInfo *flinfo)
40{
41 return (*((const double *) a) == *((const double *) b));
42}
43static bool
44gbt_inetle(const void *a, const void *b, FmgrInfo *flinfo)
45{
46 return (*((const double *) a) <= *((const double *) b));
47}
48static bool
49gbt_inetlt(const void *a, const void *b, FmgrInfo *flinfo)
50{
51 return (*((const double *) a) < *((const double *) b));
52}
53
54static int
55gbt_inetkey_cmp(const void *a, const void *b, FmgrInfo *flinfo)
56{
57 inetKEY *ia = (inetKEY *) (((const Nsrt *) a)->t);
58 inetKEY *ib = (inetKEY *) (((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
71
72static const gbtree_ninfo tinfo =
73{
75 sizeof(double),
76 16, /* sizeof(gbtreekey16) */
83 NULL
84};
85
86
87/**************************************************
88 * inet ops
89 **************************************************/
90
91
94{
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
117
118Datum
120{
121 GISTENTRY *entry = (GISTENTRY *) PG_GETARG_POINTER(0);
122 Datum dquery = PG_GETARG_DATUM(1);
124
125 /* Oid subtype = PG_GETARG_OID(3); */
126 bool *recheck = (bool *) PG_GETARG_POINTER(4);
127 inetKEY *kkk = (inetKEY *) DatumGetPointer(entry->key);
129 double query;
130 bool failure = false;
131
132 query = convert_network_to_scalar(dquery, INETOID, &failure);
133 Assert(!failure);
134
135 /* All cases served by this function are inexact */
136 *recheck = true;
137
138 key.lower = (GBT_NUMKEY *) &kkk->lower;
139 key.upper = (GBT_NUMKEY *) &kkk->upper;
140
142 &strategy, GIST_LEAF(entry), &tinfo, fcinfo->flinfo));
143}
144
145
146Datum
148{
150 void *out = palloc(sizeof(inetKEY));
151
152 *(int *) PG_GETARG_POINTER(1) = sizeof(inetKEY);
153 PG_RETURN_POINTER(gbt_num_union(out, entryvec, &tinfo, fcinfo->flinfo));
154}
155
156
157Datum
159{
160 inetKEY *origentry = (inetKEY *) DatumGetPointer(((GISTENTRY *) PG_GETARG_POINTER(0))->key);
162 float *result = (float *) PG_GETARG_POINTER(2);
163
164 penalty_num(result, origentry->lower, origentry->upper, newentry->lower, newentry->upper);
165
166 PG_RETURN_POINTER(result);
167}
168
169Datum
171{
174 &tinfo, fcinfo->flinfo));
175}
176
177Datum
179{
180 inetKEY *b1 = (inetKEY *) PG_GETARG_POINTER(0);
181 inetKEY *b2 = (inetKEY *) PG_GETARG_POINTER(1);
182 bool *result = (bool *) PG_GETARG_POINTER(2);
183
184 *result = gbt_num_same((void *) b1, (void *) b2, &tinfo, fcinfo->flinfo);
185 PG_RETURN_POINTER(result);
186}
@ gbt_t_inet
Definition: btree_gist.h:36
static bool gbt_inetge(const void *a, const void *b, FmgrInfo *flinfo)
Definition: btree_inet.c:34
Datum gbt_inet_union(PG_FUNCTION_ARGS)
Definition: btree_inet.c:147
static int gbt_inetkey_cmp(const void *a, const void *b, FmgrInfo *flinfo)
Definition: btree_inet.c:55
Datum gbt_inet_picksplit(PG_FUNCTION_ARGS)
Definition: btree_inet.c:170
Datum gbt_inet_compress(PG_FUNCTION_ARGS)
Definition: btree_inet.c:93
Datum gbt_inet_consistent(PG_FUNCTION_ARGS)
Definition: btree_inet.c:119
static bool gbt_inetgt(const void *a, const void *b, FmgrInfo *flinfo)
Definition: btree_inet.c:29
static bool gbt_inetle(const void *a, const void *b, FmgrInfo *flinfo)
Definition: btree_inet.c:44
struct inetkey inetKEY
static const gbtree_ninfo tinfo
Definition: btree_inet.c:72
static bool gbt_inetlt(const void *a, const void *b, FmgrInfo *flinfo)
Definition: btree_inet.c:49
static bool gbt_ineteq(const void *a, const void *b, FmgrInfo *flinfo)
Definition: btree_inet.c:39
PG_FUNCTION_INFO_V1(gbt_inet_compress)
Datum gbt_inet_same(PG_FUNCTION_ARGS)
Definition: btree_inet.c:178
Datum gbt_inet_penalty(PG_FUNCTION_ARGS)
Definition: btree_inet.c:158
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 Assert(condition)
Definition: c.h:815
#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
int b
Definition: isn.c:69
int a
Definition: isn.c:68
void * palloc(Size size)
Definition: mcxt.c:1317
double convert_network_to_scalar(Datum value, Oid typid, bool *failure)
Definition: network.c:1496
static Datum PointerGetDatum(const void *X)
Definition: postgres.h:327
uintptr_t Datum
Definition: postgres.h:69
static Pointer DatumGetPointer(Datum X)
Definition: postgres.h:317
uint16 StrategyNumber
Definition: stratnum.h:22
Definition: fmgr.h:57
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
double lower
Definition: btree_inet.c:13
double upper
Definition: btree_inet.c:14