PostgreSQL Source Code  git master
btree_uuid.c File Reference
#include "postgres.h"
#include "btree_gist.h"
#include "btree_utils_num.h"
#include "port/pg_bswap.h"
#include "utils/uuid.h"
Include dependency graph for btree_uuid.c:

Go to the source code of this file.

Data Structures

struct  uuidKEY
 

Functions

 PG_FUNCTION_INFO_V1 (gbt_uuid_compress)
 
 PG_FUNCTION_INFO_V1 (gbt_uuid_fetch)
 
 PG_FUNCTION_INFO_V1 (gbt_uuid_union)
 
 PG_FUNCTION_INFO_V1 (gbt_uuid_picksplit)
 
 PG_FUNCTION_INFO_V1 (gbt_uuid_consistent)
 
 PG_FUNCTION_INFO_V1 (gbt_uuid_penalty)
 
 PG_FUNCTION_INFO_V1 (gbt_uuid_same)
 
static int uuid_internal_cmp (const pg_uuid_t *arg1, const pg_uuid_t *arg2)
 
static bool gbt_uuidgt (const void *a, const void *b, FmgrInfo *flinfo)
 
static bool gbt_uuidge (const void *a, const void *b, FmgrInfo *flinfo)
 
static bool gbt_uuideq (const void *a, const void *b, FmgrInfo *flinfo)
 
static bool gbt_uuidle (const void *a, const void *b, FmgrInfo *flinfo)
 
static bool gbt_uuidlt (const void *a, const void *b, FmgrInfo *flinfo)
 
static int gbt_uuidkey_cmp (const void *a, const void *b, FmgrInfo *flinfo)
 
Datum gbt_uuid_compress (PG_FUNCTION_ARGS)
 
Datum gbt_uuid_fetch (PG_FUNCTION_ARGS)
 
Datum gbt_uuid_consistent (PG_FUNCTION_ARGS)
 
Datum gbt_uuid_union (PG_FUNCTION_ARGS)
 
static double uuid_2_double (const pg_uuid_t *u)
 
Datum gbt_uuid_penalty (PG_FUNCTION_ARGS)
 
Datum gbt_uuid_picksplit (PG_FUNCTION_ARGS)
 
Datum gbt_uuid_same (PG_FUNCTION_ARGS)
 

Variables

static const gbtree_ninfo tinfo
 

Function Documentation

◆ gbt_uuid_compress()

Datum gbt_uuid_compress ( PG_FUNCTION_ARGS  )

Definition at line 101 of file btree_uuid.c.

102 {
103  GISTENTRY *entry = (GISTENTRY *) PG_GETARG_POINTER(0);
104  GISTENTRY *retval;
105 
106  if (entry->leafkey)
107  {
108  char *r = (char *) palloc(2 * UUID_LEN);
109  pg_uuid_t *key = DatumGetUUIDP(entry->key);
110 
111  retval = palloc(sizeof(GISTENTRY));
112 
113  memcpy(r, key, UUID_LEN);
114  memcpy(r + UUID_LEN, key, UUID_LEN);
115  gistentryinit(*retval, PointerGetDatum(r),
116  entry->rel, entry->page,
117  entry->offset, false);
118  }
119  else
120  retval = entry;
121 
122  PG_RETURN_POINTER(retval);
123 }
#define PG_GETARG_POINTER(n)
Definition: fmgr.h:276
#define PG_RETURN_POINTER(x)
Definition: fmgr.h:361
#define gistentryinit(e, k, r, pg, o, l)
Definition: gist.h:244
void * palloc(Size size)
Definition: mcxt.c:1317
static Datum PointerGetDatum(const void *X)
Definition: postgres.h:322
OffsetNumber offset
Definition: gist.h:163
Datum key
Definition: gist.h:160
Page page
Definition: gist.h:162
Relation rel
Definition: gist.h:161
bool leafkey
Definition: gist.h:164
Definition: uuid.h:21
#define UUID_LEN
Definition: uuid.h:18
static pg_uuid_t * DatumGetUUIDP(Datum X)
Definition: uuid.h:35

References DatumGetUUIDP(), gistentryinit, GISTENTRY::key, sort-test::key, GISTENTRY::leafkey, GISTENTRY::offset, GISTENTRY::page, palloc(), PG_GETARG_POINTER, PG_RETURN_POINTER, PointerGetDatum(), GISTENTRY::rel, and UUID_LEN.

◆ gbt_uuid_consistent()

Datum gbt_uuid_consistent ( PG_FUNCTION_ARGS  )

Definition at line 134 of file btree_uuid.c.

135 {
136  GISTENTRY *entry = (GISTENTRY *) PG_GETARG_POINTER(0);
137  pg_uuid_t *query = PG_GETARG_UUID_P(1);
139 
140  /* Oid subtype = PG_GETARG_OID(3); */
141  bool *recheck = (bool *) PG_GETARG_POINTER(4);
142  uuidKEY *kkk = (uuidKEY *) DatumGetPointer(entry->key);
144 
145  /* All cases served by this function are exact */
146  *recheck = false;
147 
148  key.lower = (GBT_NUMKEY *) &kkk->lower;
149  key.upper = (GBT_NUMKEY *) &kkk->upper;
150 
151  PG_RETURN_BOOL(gbt_num_consistent(&key, query, &strategy,
152  GIST_LEAF(entry), &tinfo,
153  fcinfo->flinfo));
154 }
bool gbt_num_consistent(const GBT_NUMKEY_R *key, const void *query, const StrategyNumber *strategy, bool is_leaf, const gbtree_ninfo *tinfo, FmgrInfo *flinfo)
char GBT_NUMKEY
static const gbtree_ninfo tinfo
Definition: btree_uuid.c:80
#define PG_GETARG_UINT16(n)
Definition: fmgr.h:272
#define PG_RETURN_BOOL(x)
Definition: fmgr.h:359
#define GIST_LEAF(entry)
Definition: gist.h:170
static Pointer DatumGetPointer(Datum X)
Definition: postgres.h:312
uint16 StrategyNumber
Definition: stratnum.h:22
pg_uuid_t upper
Definition: btree_uuid.c:14
pg_uuid_t lower
Definition: btree_uuid.c:13
#define PG_GETARG_UUID_P(X)
Definition: uuid.h:40

References DatumGetPointer(), gbt_num_consistent(), GIST_LEAF, GISTENTRY::key, sort-test::key, uuidKEY::lower, PG_GETARG_POINTER, PG_GETARG_UINT16, PG_GETARG_UUID_P, PG_RETURN_BOOL, tinfo, and uuidKEY::upper.

◆ gbt_uuid_fetch()

Datum gbt_uuid_fetch ( PG_FUNCTION_ARGS  )

Definition at line 126 of file btree_uuid.c.

127 {
128  GISTENTRY *entry = (GISTENTRY *) PG_GETARG_POINTER(0);
129 
131 }
GISTENTRY * gbt_num_fetch(GISTENTRY *entry, const gbtree_ninfo *tinfo)

References gbt_num_fetch(), PG_GETARG_POINTER, PG_RETURN_POINTER, and tinfo.

◆ gbt_uuid_penalty()

Datum gbt_uuid_penalty ( PG_FUNCTION_ARGS  )

Definition at line 198 of file btree_uuid.c.

199 {
200  uuidKEY *origentry = (uuidKEY *) DatumGetPointer(((GISTENTRY *) PG_GETARG_POINTER(0))->key);
201  uuidKEY *newentry = (uuidKEY *) DatumGetPointer(((GISTENTRY *) PG_GETARG_POINTER(1))->key);
202  float *result = (float *) PG_GETARG_POINTER(2);
203  double olower,
204  oupper,
205  nlower,
206  nupper;
207 
208  olower = uuid_2_double(&origentry->lower);
209  oupper = uuid_2_double(&origentry->upper);
210  nlower = uuid_2_double(&newentry->lower);
211  nupper = uuid_2_double(&newentry->upper);
212 
213  penalty_num(result, olower, oupper, nlower, nupper);
214 
215  PG_RETURN_POINTER(result);
216 }
#define penalty_num(result, olower, oupper, nlower, nupper)
static double uuid_2_double(const pg_uuid_t *u)
Definition: btree_uuid.c:170

References DatumGetPointer(), sort-test::key, uuidKEY::lower, penalty_num, PG_GETARG_POINTER, PG_RETURN_POINTER, uuidKEY::upper, and uuid_2_double().

◆ gbt_uuid_picksplit()

Datum gbt_uuid_picksplit ( PG_FUNCTION_ARGS  )

Definition at line 219 of file btree_uuid.c.

220 {
223  &tinfo, fcinfo->flinfo));
224 }
GIST_SPLITVEC * gbt_num_picksplit(const GistEntryVector *entryvec, GIST_SPLITVEC *v, const gbtree_ninfo *tinfo, FmgrInfo *flinfo)

References gbt_num_picksplit(), PG_GETARG_POINTER, PG_RETURN_POINTER, and tinfo.

◆ gbt_uuid_same()

Datum gbt_uuid_same ( PG_FUNCTION_ARGS  )

Definition at line 227 of file btree_uuid.c.

228 {
229  uuidKEY *b1 = (uuidKEY *) PG_GETARG_POINTER(0);
230  uuidKEY *b2 = (uuidKEY *) PG_GETARG_POINTER(1);
231  bool *result = (bool *) PG_GETARG_POINTER(2);
232 
233  *result = gbt_num_same((void *) b1, (void *) b2, &tinfo, fcinfo->flinfo);
234  PG_RETURN_POINTER(result);
235 }
bool gbt_num_same(const GBT_NUMKEY *a, const GBT_NUMKEY *b, const gbtree_ninfo *tinfo, FmgrInfo *flinfo)

References gbt_num_same(), PG_GETARG_POINTER, PG_RETURN_POINTER, and tinfo.

◆ gbt_uuid_union()

Datum gbt_uuid_union ( PG_FUNCTION_ARGS  )

Definition at line 157 of file btree_uuid.c.

158 {
160  void *out = palloc(sizeof(uuidKEY));
161 
162  *(int *) PG_GETARG_POINTER(1) = sizeof(uuidKEY);
163  PG_RETURN_POINTER(gbt_num_union(out, entryvec, &tinfo, fcinfo->flinfo));
164 }
void * gbt_num_union(GBT_NUMKEY *out, const GistEntryVector *entryvec, const gbtree_ninfo *tinfo, FmgrInfo *flinfo)

References gbt_num_union(), palloc(), PG_GETARG_POINTER, PG_RETURN_POINTER, and tinfo.

◆ gbt_uuideq()

static bool gbt_uuideq ( const void *  a,
const void *  b,
FmgrInfo flinfo 
)
static

Definition at line 49 of file btree_uuid.c.

50 {
51  return uuid_internal_cmp((const pg_uuid_t *) a, (const pg_uuid_t *) b) == 0;
52 }
static int uuid_internal_cmp(const pg_uuid_t *arg1, const pg_uuid_t *arg2)
Definition: btree_uuid.c:31
int b
Definition: isn.c:69
int a
Definition: isn.c:68

References a, b, and uuid_internal_cmp().

◆ gbt_uuidge()

static bool gbt_uuidge ( const void *  a,
const void *  b,
FmgrInfo flinfo 
)
static

Definition at line 43 of file btree_uuid.c.

44 {
45  return uuid_internal_cmp((const pg_uuid_t *) a, (const pg_uuid_t *) b) >= 0;
46 }

References a, b, and uuid_internal_cmp().

◆ gbt_uuidgt()

static bool gbt_uuidgt ( const void *  a,
const void *  b,
FmgrInfo flinfo 
)
static

Definition at line 37 of file btree_uuid.c.

38 {
39  return uuid_internal_cmp((const pg_uuid_t *) a, (const pg_uuid_t *) b) > 0;
40 }

References a, b, and uuid_internal_cmp().

◆ gbt_uuidkey_cmp()

static int gbt_uuidkey_cmp ( const void *  a,
const void *  b,
FmgrInfo flinfo 
)
static

Definition at line 67 of file btree_uuid.c.

68 {
69  uuidKEY *ia = (uuidKEY *) (((const Nsrt *) a)->t);
70  uuidKEY *ib = (uuidKEY *) (((const Nsrt *) b)->t);
71  int res;
72 
73  res = uuid_internal_cmp(&ia->lower, &ib->lower);
74  if (res == 0)
75  res = uuid_internal_cmp(&ia->upper, &ib->upper);
76  return res;
77 }

References a, b, uuidKEY::lower, res, uuidKEY::upper, and uuid_internal_cmp().

◆ gbt_uuidle()

static bool gbt_uuidle ( const void *  a,
const void *  b,
FmgrInfo flinfo 
)
static

Definition at line 55 of file btree_uuid.c.

56 {
57  return uuid_internal_cmp((const pg_uuid_t *) a, (const pg_uuid_t *) b) <= 0;
58 }

References a, b, and uuid_internal_cmp().

◆ gbt_uuidlt()

static bool gbt_uuidlt ( const void *  a,
const void *  b,
FmgrInfo flinfo 
)
static

Definition at line 61 of file btree_uuid.c.

62 {
63  return uuid_internal_cmp((const pg_uuid_t *) a, (const pg_uuid_t *) b) < 0;
64 }

References a, b, and uuid_internal_cmp().

◆ PG_FUNCTION_INFO_V1() [1/7]

PG_FUNCTION_INFO_V1 ( gbt_uuid_compress  )

◆ PG_FUNCTION_INFO_V1() [2/7]

PG_FUNCTION_INFO_V1 ( gbt_uuid_consistent  )

◆ PG_FUNCTION_INFO_V1() [3/7]

PG_FUNCTION_INFO_V1 ( gbt_uuid_fetch  )

◆ PG_FUNCTION_INFO_V1() [4/7]

PG_FUNCTION_INFO_V1 ( gbt_uuid_penalty  )

◆ PG_FUNCTION_INFO_V1() [5/7]

PG_FUNCTION_INFO_V1 ( gbt_uuid_picksplit  )

◆ PG_FUNCTION_INFO_V1() [6/7]

PG_FUNCTION_INFO_V1 ( gbt_uuid_same  )

◆ PG_FUNCTION_INFO_V1() [7/7]

PG_FUNCTION_INFO_V1 ( gbt_uuid_union  )

◆ uuid_2_double()

static double uuid_2_double ( const pg_uuid_t u)
static

Definition at line 170 of file btree_uuid.c.

171 {
172  uint64 uu[2];
173  const double two64 = 18446744073709551616.0; /* 2^64 */
174 
175  /* Source data may not be suitably aligned, so copy */
176  memcpy(uu, u->data, UUID_LEN);
177 
178  /*
179  * uuid values should be considered as big-endian numbers, since that
180  * corresponds to how memcmp will compare them. On a little-endian
181  * machine, byte-swap each half so we can use native uint64 arithmetic.
182  */
183 #ifndef WORDS_BIGENDIAN
184  uu[0] = pg_bswap64(uu[0]);
185  uu[1] = pg_bswap64(uu[1]);
186 #endif
187 
188  /*
189  * 2^128 is about 3.4e38, which in theory could exceed the range of
190  * "double" (POSIX only requires 1e37). To avoid any risk of overflow,
191  * put the decimal point between the two halves rather than treating the
192  * uuid value as a 128-bit integer.
193  */
194  return (double) uu[0] + (double) uu[1] / two64;
195 }
static uint64 pg_bswap64(uint64 x)
Definition: pg_bswap.h:89
unsigned char data[UUID_LEN]
Definition: uuid.h:22

References pg_uuid_t::data, pg_bswap64(), and UUID_LEN.

Referenced by gbt_uuid_penalty().

◆ uuid_internal_cmp()

static int uuid_internal_cmp ( const pg_uuid_t arg1,
const pg_uuid_t arg2 
)
static

Definition at line 31 of file btree_uuid.c.

32 {
33  return memcmp(arg1->data, arg2->data, UUID_LEN);
34 }

References pg_uuid_t::data, and UUID_LEN.

Referenced by gbt_uuideq(), gbt_uuidge(), gbt_uuidgt(), gbt_uuidkey_cmp(), gbt_uuidle(), and gbt_uuidlt().

Variable Documentation

◆ tinfo

const gbtree_ninfo tinfo
static
Initial value:
=
{
32,
NULL
}
@ gbt_t_uuid
Definition: btree_gist.h:37
static bool gbt_uuidle(const void *a, const void *b, FmgrInfo *flinfo)
Definition: btree_uuid.c:55
static bool gbt_uuideq(const void *a, const void *b, FmgrInfo *flinfo)
Definition: btree_uuid.c:49
static bool gbt_uuidgt(const void *a, const void *b, FmgrInfo *flinfo)
Definition: btree_uuid.c:37
static bool gbt_uuidge(const void *a, const void *b, FmgrInfo *flinfo)
Definition: btree_uuid.c:43
static bool gbt_uuidlt(const void *a, const void *b, FmgrInfo *flinfo)
Definition: btree_uuid.c:61
static int gbt_uuidkey_cmp(const void *a, const void *b, FmgrInfo *flinfo)
Definition: btree_uuid.c:67

Definition at line 80 of file btree_uuid.c.

Referenced by gbt_uuid_consistent(), gbt_uuid_fetch(), gbt_uuid_picksplit(), gbt_uuid_same(), and gbt_uuid_union().