PostgreSQL Source Code  git master
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros
btree_oid.c
Go to the documentation of this file.
1 /*
2  * contrib/btree_gist/btree_oid.c
3  */
4 #include "postgres.h"
5 
6 #include "btree_gist.h"
7 #include "btree_utils_num.h"
8 
9 typedef struct
10 {
11  Oid lower;
12  Oid upper;
13 } oidKEY;
14 
15 /*
16 ** OID ops
17 */
26 
27 
28 static bool
29 gbt_oidgt(const void *a, const void *b, FmgrInfo *flinfo)
30 {
31  return (*((const Oid *) a) > *((const Oid *) b));
32 }
33 static bool
34 gbt_oidge(const void *a, const void *b, FmgrInfo *flinfo)
35 {
36  return (*((const Oid *) a) >= *((const Oid *) b));
37 }
38 static bool
39 gbt_oideq(const void *a, const void *b, FmgrInfo *flinfo)
40 {
41  return (*((const Oid *) a) == *((const Oid *) b));
42 }
43 static bool
44 gbt_oidle(const void *a, const void *b, FmgrInfo *flinfo)
45 {
46  return (*((const Oid *) a) <= *((const Oid *) b));
47 }
48 static bool
49 gbt_oidlt(const void *a, const void *b, FmgrInfo *flinfo)
50 {
51  return (*((const Oid *) a) < *((const Oid *) b));
52 }
53 
54 static int
55 gbt_oidkey_cmp(const void *a, const void *b, FmgrInfo *flinfo)
56 {
57  oidKEY *ia = (oidKEY *) (((const Nsrt *) a)->t);
58  oidKEY *ib = (oidKEY *) (((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 static float8
72 gbt_oid_dist(const void *a, const void *b, FmgrInfo *flinfo)
73 {
74  Oid aa = *(const Oid *) a;
75  Oid bb = *(const Oid *) b;
76 
77  if (aa < bb)
78  return (float8) (bb - aa);
79  else
80  return (float8) (aa - bb);
81 }
82 
83 
84 static const gbtree_ninfo tinfo =
85 {
86  gbt_t_oid,
87  sizeof(Oid),
88  8, /* sizeof(gbtreekey8) */
89  gbt_oidgt,
90  gbt_oidge,
91  gbt_oideq,
92  gbt_oidle,
93  gbt_oidlt,
96 };
97 
98 
100 Datum
102 {
103  Oid a = PG_GETARG_OID(0);
104  Oid b = PG_GETARG_OID(1);
105  Oid res;
106 
107  if (a < b)
108  res = b - a;
109  else
110  res = a - b;
111  PG_RETURN_OID(res);
112 }
113 
114 
115 /**************************************************
116  * Oid ops
117  **************************************************/
118 
119 
120 Datum
122 {
123  GISTENTRY *entry = (GISTENTRY *) PG_GETARG_POINTER(0);
124 
125  PG_RETURN_POINTER(gbt_num_compress(entry, &tinfo));
126 }
127 
128 Datum
130 {
131  GISTENTRY *entry = (GISTENTRY *) PG_GETARG_POINTER(0);
132 
133  PG_RETURN_POINTER(gbt_num_fetch(entry, &tinfo));
134 }
135 
136 Datum
138 {
139  GISTENTRY *entry = (GISTENTRY *) PG_GETARG_POINTER(0);
140  Oid query = PG_GETARG_OID(1);
142 
143  /* Oid subtype = PG_GETARG_OID(3); */
144  bool *recheck = (bool *) PG_GETARG_POINTER(4);
145  oidKEY *kkk = (oidKEY *) DatumGetPointer(entry->key);
146  GBT_NUMKEY_R key;
147 
148  /* All cases served by this function are exact */
149  *recheck = false;
150 
151  key.lower = (GBT_NUMKEY *) &kkk->lower;
152  key.upper = (GBT_NUMKEY *) &kkk->upper;
153 
155  gbt_num_consistent(&key, (void *) &query, &strategy, GIST_LEAF(entry), &tinfo, fcinfo->flinfo)
156  );
157 }
158 
159 
160 Datum
162 {
163  GISTENTRY *entry = (GISTENTRY *) PG_GETARG_POINTER(0);
164  Oid query = PG_GETARG_OID(1);
165 
166  /* Oid subtype = PG_GETARG_OID(3); */
167  oidKEY *kkk = (oidKEY *) DatumGetPointer(entry->key);
168  GBT_NUMKEY_R key;
169 
170  key.lower = (GBT_NUMKEY *) &kkk->lower;
171  key.upper = (GBT_NUMKEY *) &kkk->upper;
172 
174  gbt_num_distance(&key, (void *) &query, GIST_LEAF(entry), &tinfo, fcinfo->flinfo)
175  );
176 }
177 
178 
179 Datum
181 {
183  void *out = palloc(sizeof(oidKEY));
184 
185  *(int *) PG_GETARG_POINTER(1) = sizeof(oidKEY);
186  PG_RETURN_POINTER(gbt_num_union((void *) out, entryvec, &tinfo, fcinfo->flinfo));
187 }
188 
189 
190 Datum
192 {
193  oidKEY *origentry = (oidKEY *) DatumGetPointer(((GISTENTRY *) PG_GETARG_POINTER(0))->key);
194  oidKEY *newentry = (oidKEY *) DatumGetPointer(((GISTENTRY *) PG_GETARG_POINTER(1))->key);
195  float *result = (float *) PG_GETARG_POINTER(2);
196 
197  penalty_num(result, origentry->lower, origentry->upper, newentry->lower, newentry->upper);
198 
199  PG_RETURN_POINTER(result);
200 }
201 
202 Datum
204 {
208  &tinfo, fcinfo->flinfo
209  ));
210 }
211 
212 Datum
214 {
215  oidKEY *b1 = (oidKEY *) PG_GETARG_POINTER(0);
216  oidKEY *b2 = (oidKEY *) PG_GETARG_POINTER(1);
217  bool *result = (bool *) PG_GETARG_POINTER(2);
218 
219  *result = gbt_num_same((void *) b1, (void *) b2, &tinfo, fcinfo->flinfo);
220  PG_RETURN_POINTER(result);
221 }
#define GIST_LEAF(entry)
Definition: gist.h:133
Oid lower
Definition: btree_enum.c:15
#define PG_RETURN_POINTER(x)
Definition: fmgr.h:321
bool gbt_num_same(const GBT_NUMKEY *a, const GBT_NUMKEY *b, const gbtree_ninfo *tinfo, FmgrInfo *flinfo)
static bool gbt_oidge(const void *a, const void *b, FmgrInfo *flinfo)
Definition: btree_oid.c:34
Datum gbt_oid_penalty(PG_FUNCTION_ARGS)
Definition: btree_oid.c:191
Definition: fmgr.h:56
PG_FUNCTION_INFO_V1(gbt_oid_compress)
static bool gbt_oidlt(const void *a, const void *b, FmgrInfo *flinfo)
Definition: btree_oid.c:49
static const gbtree_ninfo tinfo
Definition: btree_oid.c:84
const GBT_NUMKEY * lower
float8 gbt_num_distance(const GBT_NUMKEY_R *key, const void *query, bool is_leaf, const gbtree_ninfo *tinfo, FmgrInfo *flinfo)
Datum lower(PG_FUNCTION_ARGS)
Definition: oracle_compat.c:43
GISTENTRY * gbt_num_fetch(GISTENTRY *entry, const gbtree_ninfo *tinfo)
#define PG_RETURN_FLOAT8(x)
Definition: fmgr.h:326
uint16 StrategyNumber
Definition: stratnum.h:22
return result
Definition: formatting.c:1633
const GBT_NUMKEY * upper
#define PG_GETARG_POINTER(n)
Definition: fmgr.h:241
Datum upper(PG_FUNCTION_ARGS)
Definition: oracle_compat.c:74
bool gbt_num_consistent(const GBT_NUMKEY_R *key, const void *query, const StrategyNumber *strategy, bool is_leaf, const gbtree_ninfo *tinfo, FmgrInfo *flinfo)
unsigned int Oid
Definition: postgres_ext.h:31
Datum gbt_oid_same(PG_FUNCTION_ARGS)
Definition: btree_oid.c:213
GISTENTRY * gbt_num_compress(GISTENTRY *entry, const gbtree_ninfo *tinfo)
double float8
Definition: c.h:381
Datum gbt_oid_consistent(PG_FUNCTION_ARGS)
Definition: btree_oid.c:137
#define penalty_num(result, olower, oupper, nlower, nupper)
Datum key
Definition: gist.h:123
static bool gbt_oidle(const void *a, const void *b, FmgrInfo *flinfo)
Definition: btree_oid.c:44
char GBT_NUMKEY
#define PG_GETARG_OID(n)
Definition: fmgr.h:240
static float8 gbt_oid_dist(const void *a, const void *b, FmgrInfo *flinfo)
Definition: btree_oid.c:72
Datum gbt_oid_union(PG_FUNCTION_ARGS)
Definition: btree_oid.c:180
Datum gbt_oid_fetch(PG_FUNCTION_ARGS)
Definition: btree_oid.c:129
#define PG_RETURN_BOOL(x)
Definition: fmgr.h:319
uintptr_t Datum
Definition: postgres.h:372
static int gbt_oidkey_cmp(const void *a, const void *b, FmgrInfo *flinfo)
Definition: btree_oid.c:55
static bool gbt_oidgt(const void *a, const void *b, FmgrInfo *flinfo)
Definition: btree_oid.c:29
Datum gbt_oid_compress(PG_FUNCTION_ARGS)
Definition: btree_oid.c:121
GIST_SPLITVEC * gbt_num_picksplit(const GistEntryVector *entryvec, GIST_SPLITVEC *v, const gbtree_ninfo *tinfo, FmgrInfo *flinfo)
#define PG_GETARG_UINT16(n)
Definition: fmgr.h:237
#define DatumGetPointer(X)
Definition: postgres.h:555
Datum gbt_oid_picksplit(PG_FUNCTION_ARGS)
Definition: btree_oid.c:203
void * palloc(Size size)
Definition: mcxt.c:849
Oid upper
Definition: btree_enum.c:16
#define PG_FUNCTION_ARGS
Definition: fmgr.h:158
#define PG_RETURN_OID(x)
Definition: fmgr.h:320
Datum gbt_oid_distance(PG_FUNCTION_ARGS)
Definition: btree_oid.c:161
void * gbt_num_union(GBT_NUMKEY *out, const GistEntryVector *entryvec, const gbtree_ninfo *tinfo, FmgrInfo *flinfo)
Datum oid_dist(PG_FUNCTION_ARGS)
Definition: btree_oid.c:101
static bool gbt_oideq(const void *a, const void *b, FmgrInfo *flinfo)
Definition: btree_oid.c:39