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

PostgreSQL Source Code git master
btree_macaddr.c
Go to the documentation of this file.
1/*
2 * contrib/btree_gist/btree_macaddr.c
3 */
4#include "postgres.h"
5
6#include "btree_gist.h"
7#include "btree_utils_num.h"
8#include "utils/fmgrprotos.h"
9#include "utils/inet.h"
10#include "utils/rel.h"
11#include "utils/sortsupport.h"
12
13typedef struct
14{
17 char pad[4]; /* make struct size = sizeof(gbtreekey16) */
18} macKEY;
19
20/* GiST support functions */
29
30
31static bool
32gbt_macadgt(const void *a, const void *b, FmgrInfo *flinfo)
33{
35}
36static bool
37gbt_macadge(const void *a, const void *b, FmgrInfo *flinfo)
38{
40}
41
42static bool
43gbt_macadeq(const void *a, const void *b, FmgrInfo *flinfo)
44{
46}
47
48static bool
49gbt_macadle(const void *a, const void *b, FmgrInfo *flinfo)
50{
52}
53
54static bool
55gbt_macadlt(const void *a, const void *b, FmgrInfo *flinfo)
56{
58}
59
60
61static int
62gbt_macadkey_cmp(const void *a, const void *b, FmgrInfo *flinfo)
63{
64 macKEY *ia = (macKEY *) (((const Nsrt *) a)->t);
65 macKEY *ib = (macKEY *) (((const Nsrt *) b)->t);
66 int res;
67
69 if (res == 0)
71
72 return res;
73}
74
75
76static const gbtree_ninfo tinfo =
77{
79 sizeof(macaddr),
80 16, /* sizeof(gbtreekey16) */
87 NULL
88};
89
90
91/**************************************************
92 * GiST support functions
93 **************************************************/
94
95static uint64
97{
98 unsigned char *mi = (unsigned char *) m;
99 uint64 res = 0;
100 int i;
101
102 for (i = 0; i < 6; i++)
103 res += (((uint64) mi[i]) << ((uint64) ((5 - i) * 8)));
104 return res;
105}
106
107Datum
109{
110 GISTENTRY *entry = (GISTENTRY *) PG_GETARG_POINTER(0);
111
113}
114
115Datum
117{
118 GISTENTRY *entry = (GISTENTRY *) PG_GETARG_POINTER(0);
119
121}
122
123Datum
125{
126 GISTENTRY *entry = (GISTENTRY *) PG_GETARG_POINTER(0);
127 macaddr *query = (macaddr *) PG_GETARG_POINTER(1);
129
130 /* Oid subtype = PG_GETARG_OID(3); */
131 bool *recheck = (bool *) PG_GETARG_POINTER(4);
132 macKEY *kkk = (macKEY *) DatumGetPointer(entry->key);
134
135 /* All cases served by this function are exact */
136 *recheck = false;
137
138 key.lower = (GBT_NUMKEY *) &kkk->lower;
139 key.upper = (GBT_NUMKEY *) &kkk->upper;
140
141 PG_RETURN_BOOL(gbt_num_consistent(&key, query, &strategy,
142 GIST_LEAF(entry), &tinfo, fcinfo->flinfo));
143}
144
145
146Datum
148{
150 void *out = palloc0(sizeof(macKEY));
151
152 *(int *) PG_GETARG_POINTER(1) = sizeof(macKEY);
153 PG_RETURN_POINTER(gbt_num_union(out, entryvec, &tinfo, fcinfo->flinfo));
154}
155
156
157Datum
159{
160 macKEY *origentry = (macKEY *) DatumGetPointer(((GISTENTRY *) PG_GETARG_POINTER(0))->key);
161 macKEY *newentry = (macKEY *) DatumGetPointer(((GISTENTRY *) PG_GETARG_POINTER(1))->key);
162 float *result = (float *) PG_GETARG_POINTER(2);
163 uint64 iorg[2],
164 inew[2];
165
166 iorg[0] = mac_2_uint64(&origentry->lower);
167 iorg[1] = mac_2_uint64(&origentry->upper);
168 inew[0] = mac_2_uint64(&newentry->lower);
169 inew[1] = mac_2_uint64(&newentry->upper);
170
171 penalty_num(result, iorg[0], iorg[1], inew[0], inew[1]);
172
173 PG_RETURN_POINTER(result);
174}
175
176Datum
178{
181 &tinfo, fcinfo->flinfo));
182}
183
184Datum
186{
187 macKEY *b1 = (macKEY *) PG_GETARG_POINTER(0);
188 macKEY *b2 = (macKEY *) PG_GETARG_POINTER(1);
189 bool *result = (bool *) PG_GETARG_POINTER(2);
190
191 *result = gbt_num_same((void *) b1, (void *) b2, &tinfo, fcinfo->flinfo);
192 PG_RETURN_POINTER(result);
193}
194
195static int
197{
198 macKEY *arg1 = (macKEY *) DatumGetPointer(x);
199 macKEY *arg2 = (macKEY *) DatumGetPointer(y);
200
201 /* for leaf items we expect lower == upper, so only compare lower */
203 MacaddrPGetDatum(&arg1->lower),
204 MacaddrPGetDatum(&arg2->lower)));
205}
206
207Datum
209{
211
213 ssup->ssup_extra = NULL;
214
216}
@ gbt_t_macad
Definition: btree_gist.h:29
static bool gbt_macadle(const void *a, const void *b, FmgrInfo *flinfo)
Definition: btree_macaddr.c:49
Datum gbt_macad_fetch(PG_FUNCTION_ARGS)
Datum gbt_macad_consistent(PG_FUNCTION_ARGS)
static uint64 mac_2_uint64(macaddr *m)
Definition: btree_macaddr.c:96
static int gbt_macadkey_cmp(const void *a, const void *b, FmgrInfo *flinfo)
Definition: btree_macaddr.c:62
static bool gbt_macadlt(const void *a, const void *b, FmgrInfo *flinfo)
Definition: btree_macaddr.c:55
Datum gbt_macad_union(PG_FUNCTION_ARGS)
Datum gbt_macaddr_sortsupport(PG_FUNCTION_ARGS)
static int gbt_macaddr_ssup_cmp(Datum x, Datum y, SortSupport ssup)
Datum gbt_macad_picksplit(PG_FUNCTION_ARGS)
static bool gbt_macadeq(const void *a, const void *b, FmgrInfo *flinfo)
Definition: btree_macaddr.c:43
static const gbtree_ninfo tinfo
Definition: btree_macaddr.c:76
Datum gbt_macad_penalty(PG_FUNCTION_ARGS)
Datum gbt_macad_compress(PG_FUNCTION_ARGS)
Datum gbt_macad_same(PG_FUNCTION_ARGS)
static bool gbt_macadge(const void *a, const void *b, FmgrInfo *flinfo)
Definition: btree_macaddr.c:37
PG_FUNCTION_INFO_V1(gbt_macad_compress)
static bool gbt_macadgt(const void *a, const void *b, FmgrInfo *flinfo)
Definition: btree_macaddr.c:32
GISTENTRY * gbt_num_compress(GISTENTRY *entry, const gbtree_ninfo *tinfo)
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)
char GBT_NUMKEY
uint64_t uint64
Definition: c.h:540
#define PG_RETURN_VOID()
Definition: fmgr.h:349
#define DirectFunctionCall2(func, arg1, arg2)
Definition: fmgr.h:684
#define PG_GETARG_POINTER(n)
Definition: fmgr.h:276
#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
int y
Definition: isn.c:76
int b
Definition: isn.c:74
int x
Definition: isn.c:75
int a
Definition: isn.c:73
int i
Definition: isn.c:77
Datum macaddr_lt(PG_FUNCTION_ARGS)
Definition: mac.c:210
Datum macaddr_cmp(PG_FUNCTION_ARGS)
Definition: mac.c:197
Datum macaddr_eq(PG_FUNCTION_ARGS)
Definition: mac.c:228
Datum macaddr_ge(PG_FUNCTION_ARGS)
Definition: mac.c:237
Datum macaddr_le(PG_FUNCTION_ARGS)
Definition: mac.c:219
Datum macaddr_gt(PG_FUNCTION_ARGS)
Definition: mac.c:246
void * palloc0(Size size)
Definition: mcxt.c:1395
static bool DatumGetBool(Datum X)
Definition: postgres.h:100
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
static int32 DatumGetInt32(Datum X)
Definition: postgres.h:212
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
void * ssup_extra
Definition: sortsupport.h:87
macaddr upper
Definition: btree_macaddr.c:16
macaddr lower
Definition: btree_macaddr.c:15
Definition: inet.h:95
static Datum MacaddrPGetDatum(const macaddr *X)
Definition: inet.h:153
struct macaddr macaddr