PostgreSQL Source Code  git master
Data Structures | Macros | Typedefs | Functions
_int.h File Reference
#include "utils/array.h"
#include "utils/memutils.h"
Include dependency graph for _int.h:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Data Structures

struct  GISTIntArrayOptions
 
struct  GISTIntArrayBigOptions
 
struct  GISTTYPE
 
struct  ITEM
 
struct  QUERYTYPE
 

Macros

#define G_INT_NUMRANGES_DEFAULT   100
 
#define G_INT_NUMRANGES_MAX
 
#define G_INT_GET_NUMRANGES()
 
#define ARRPTR(x)   ( (int32 *) ARR_DATA_PTR(x) )
 
#define ARRNELEMS(x)   ArrayGetNItems(ARR_NDIM(x), ARR_DIMS(x))
 
#define CHECKARRVALID(x)
 
#define ARRISEMPTY(x)   (ARRNELEMS(x) == 0)
 
#define SORT(x)
 
#define PREPAREARR(x)
 
#define WISH_F(a, b, c)   (double)( -(double)(((a)-(b))*((a)-(b))*((a)-(b)))*(c) )
 
#define SIGLEN_DEFAULT   (63 * 4)
 
#define SIGLEN_MAX   GISTMaxIndexKeySize
 
#define SIGLENBIT(siglen)   ((siglen) * BITS_PER_BYTE)
 
#define GET_SIGLEN()
 
#define LOOPBYTE(siglen)    for (i = 0; i < siglen; i++)
 
#define GETBYTE(x, i)   ( *( (BITVECP)(x) + (int)( (i) / BITS_PER_BYTE ) ) )
 
#define GETBITBYTE(x, i)   ( (*((char*)(x)) >> (i)) & 0x01 )
 
#define CLRBIT(x, i)   GETBYTE(x,i) &= ~( 0x01 << ( (i) % BITS_PER_BYTE ) )
 
#define SETBIT(x, i)   GETBYTE(x,i) |= ( 0x01 << ( (i) % BITS_PER_BYTE ) )
 
#define GETBIT(x, i)   ( (GETBYTE(x,i) >> ( (i) % BITS_PER_BYTE )) & 0x01 )
 
#define HASHVAL(val, siglen)   (((unsigned int)(val)) % SIGLENBIT(siglen))
 
#define HASH(sign, val, siglen)   SETBIT((sign), HASHVAL(val, siglen))
 
#define ALLISTRUE   0x04
 
#define ISALLTRUE(x)   ( ((GISTTYPE*)x)->flag & ALLISTRUE )
 
#define GTHDRSIZE   (VARHDRSZ + sizeof(int32))
 
#define CALCGTSIZE(flag, siglen)   ( GTHDRSIZE+(((flag) & ALLISTRUE) ? 0 : (siglen)) )
 
#define GETSIGN(x)   ( (BITVECP)( (char*)x+GTHDRSIZE ) )
 
#define BooleanSearchStrategy   20
 
#define HDRSIZEQT   offsetof(QUERYTYPE, items)
 
#define COMPUTESIZE(size)   ( HDRSIZEQT + (size) * sizeof(ITEM) )
 
#define QUERYTYPEMAXITEMS   ((MaxAllocSize - HDRSIZEQT) / sizeof(ITEM))
 
#define GETQUERY(x)   ( (x)->items )
 
#define END   0
 
#define ERR   1
 
#define VAL   2
 
#define OPR   3
 
#define OPEN   4
 
#define CLOSE   5
 
#define DatumGetQueryTypeP(X)   ((QUERYTYPE *) PG_DETOAST_DATUM(X))
 
#define DatumGetQueryTypePCopy(X)   ((QUERYTYPE *) PG_DETOAST_DATUM_COPY(X))
 
#define PG_GETARG_QUERYTYPE_P(n)   DatumGetQueryTypeP(PG_GETARG_DATUM(n))
 
#define PG_GETARG_QUERYTYPE_P_COPY(n)   DatumGetQueryTypePCopy(PG_GETARG_DATUM(n))
 
#define QSORT(a, direction)
 

Typedefs

typedef char * BITVECP
 
typedef struct ITEM ITEM
 
typedef struct QUERYTYPE QUERYTYPE
 

Functions

bool isort (int32 *a, int len)
 
ArrayType * new_intArrayType (int num)
 
ArrayType * copy_intArrayType (ArrayType *a)
 
ArrayType * resize_intArrayType (ArrayType *a, int num)
 
int internal_size (int *a, int len)
 
ArrayType * _int_unique (ArrayType *r)
 
int32 intarray_match_first (ArrayType *a, int32 elem)
 
ArrayType * intarray_add_elem (ArrayType *a, int32 elem)
 
ArrayType * intarray_concat_arrays (ArrayType *a, ArrayType *b)
 
ArrayType * int_to_intset (int32 elem)
 
bool inner_int_overlap (ArrayType *a, ArrayType *b)
 
bool inner_int_contains (ArrayType *a, ArrayType *b)
 
ArrayType * inner_int_union (ArrayType *a, ArrayType *b)
 
ArrayType * inner_int_inter (ArrayType *a, ArrayType *b)
 
void rt__int_size (ArrayType *a, float *size)
 
void gensign (BITVECP sign, int *a, int len, int siglen)
 
bool signconsistent (QUERYTYPE *query, BITVECP sign, int siglen, bool calcnot)
 
bool execconsistent (QUERYTYPE *query, ArrayType *array, bool calcnot)
 
bool gin_bool_consistent (QUERYTYPE *query, bool *check)
 
bool query_has_required_values (QUERYTYPE *query)
 
int compASC (const void *a, const void *b)
 
int compDESC (const void *a, const void *b)
 

Macro Definition Documentation

◆ ALLISTRUE

#define ALLISTRUE   0x04

Definition at line 100 of file _int.h.

◆ ARRISEMPTY

#define ARRISEMPTY (   x)    (ARRNELEMS(x) == 0)

Definition at line 38 of file _int.h.

◆ ARRNELEMS

#define ARRNELEMS (   x)    ArrayGetNItems(ARR_NDIM(x), ARR_DIMS(x))

Definition at line 27 of file _int.h.

◆ ARRPTR

#define ARRPTR (   x)    ( (int32 *) ARR_DATA_PTR(x) )

Definition at line 26 of file _int.h.

◆ BooleanSearchStrategy

#define BooleanSearchStrategy   20

Definition at line 134 of file _int.h.

◆ CALCGTSIZE

#define CALCGTSIZE (   flag,
  siglen 
)    ( GTHDRSIZE+(((flag) & ALLISTRUE) ? 0 : (siglen)) )

Definition at line 105 of file _int.h.

◆ CHECKARRVALID

#define CHECKARRVALID (   x)
Value:
do { \
if (ARR_HASNULL(x) && array_contains_nulls(x)) \
ereport(ERROR, \
(errcode(ERRCODE_NULL_VALUE_NOT_ALLOWED), \
errmsg("array must not contain nulls"))); \
} while(0)
ARR_HASNULL
#define ARR_HASNULL(a)
Definition: array.h:284
array_contains_nulls
bool array_contains_nulls(ArrayType *array)
Definition: arrayfuncs.c:3714
errcode
int errcode(int sqlerrcode)
Definition: elog.c:858
errmsg
int errmsg(const char *fmt,...)
Definition: elog.c:1069
ERROR
#define ERROR
Definition: elog.h:39
x
int x
Definition: isn.c:71

Definition at line 30 of file _int.h.

◆ CLOSE

#define CLOSE   5

Definition at line 165 of file _int.h.

◆ CLRBIT

#define CLRBIT (   x,
  i 
)    GETBYTE(x,i) &= ~( 0x01 << ( (i) % BITS_PER_BYTE ) )

Definition at line 77 of file _int.h.

◆ COMPUTESIZE

#define COMPUTESIZE (   size)    ( HDRSIZEQT + (size) * sizeof(ITEM) )

Definition at line 155 of file _int.h.

◆ DatumGetQueryTypeP

#define DatumGetQueryTypeP (   X)    ((QUERYTYPE *) PG_DETOAST_DATUM(X))

Definition at line 168 of file _int.h.

◆ DatumGetQueryTypePCopy

#define DatumGetQueryTypePCopy (   X)    ((QUERYTYPE *) PG_DETOAST_DATUM_COPY(X))

Definition at line 169 of file _int.h.

◆ END

#define END   0

Definition at line 160 of file _int.h.

◆ ERR

#define ERR   1

Definition at line 161 of file _int.h.

◆ G_INT_GET_NUMRANGES

#define G_INT_GET_NUMRANGES ( )
Value:
(PG_HAS_OPCLASS_OPTIONS() ? \
((GISTIntArrayOptions *) PG_GET_OPCLASS_OPTIONS())->num_ranges : \
G_INT_NUMRANGES_DEFAULT)
G_INT_NUMRANGES_DEFAULT
#define G_INT_NUMRANGES_DEFAULT
Definition: _int.h:11
PG_GET_OPCLASS_OPTIONS
#define PG_GET_OPCLASS_OPTIONS()
Definition: fmgr.h:342
PG_HAS_OPCLASS_OPTIONS
#define PG_HAS_OPCLASS_OPTIONS()
Definition: fmgr.h:341

Definition at line 14 of file _int.h.

◆ G_INT_NUMRANGES_DEFAULT

#define G_INT_NUMRANGES_DEFAULT   100

Definition at line 11 of file _int.h.

◆ G_INT_NUMRANGES_MAX

#define G_INT_NUMRANGES_MAX
Value:
((GISTMaxIndexKeySize - VARHDRSZ) / \
(2 * sizeof(int32)))
int32
signed int int32
Definition: c.h:483
VARHDRSZ
#define VARHDRSZ
Definition: c.h:681
GISTMaxIndexKeySize
#define GISTMaxIndexKeySize
Definition: gist.h:100

Definition at line 12 of file _int.h.

◆ GET_SIGLEN

#define GET_SIGLEN ( )
Value:
(PG_HAS_OPCLASS_OPTIONS() ? \
((GISTIntArrayBigOptions *) PG_GET_OPCLASS_OPTIONS())->siglen : \
SIGLEN_DEFAULT)
SIGLEN_DEFAULT
#define SIGLEN_DEFAULT
Definition: _int.h:62

Definition at line 65 of file _int.h.

◆ GETBIT

#define GETBIT (   x,
  i 
)    ( (GETBYTE(x,i) >> ( (i) % BITS_PER_BYTE )) & 0x01 )

Definition at line 79 of file _int.h.

◆ GETBITBYTE

#define GETBITBYTE (   x,
  i 
)    ( (*((char*)(x)) >> (i)) & 0x01 )

Definition at line 76 of file _int.h.

◆ GETBYTE

#define GETBYTE (   x,
  i 
)    ( *( (BITVECP)(x) + (int)( (i) / BITS_PER_BYTE ) ) )

Definition at line 75 of file _int.h.

◆ GETQUERY

#define GETQUERY (   x)    ( (x)->items )

Definition at line 157 of file _int.h.

◆ GETSIGN

#define GETSIGN (   x)    ( (BITVECP)( (char*)x+GTHDRSIZE ) )

Definition at line 107 of file _int.h.

◆ GTHDRSIZE

#define GTHDRSIZE   (VARHDRSZ + sizeof(int32))

Definition at line 104 of file _int.h.

◆ HASH

#define HASH (   sign,
  val,
  siglen 
)    SETBIT((sign), HASHVAL(val, siglen))

Definition at line 81 of file _int.h.

◆ HASHVAL

#define HASHVAL (   val,
  siglen 
)    (((unsigned int)(val)) % SIGLENBIT(siglen))

Definition at line 80 of file _int.h.

◆ HDRSIZEQT

#define HDRSIZEQT   offsetof(QUERYTYPE, items)

Definition at line 154 of file _int.h.

◆ ISALLTRUE

#define ISALLTRUE (   x)    ( ((GISTTYPE*)x)->flag & ALLISTRUE )

Definition at line 102 of file _int.h.

◆ LOOPBYTE

#define LOOPBYTE (   siglen)     for (i = 0; i < siglen; i++)

Definition at line 71 of file _int.h.

◆ OPEN

#define OPEN   4

Definition at line 164 of file _int.h.

◆ OPR

#define OPR   3

Definition at line 163 of file _int.h.

◆ PG_GETARG_QUERYTYPE_P

#define PG_GETARG_QUERYTYPE_P (   n)    DatumGetQueryTypeP(PG_GETARG_DATUM(n))

Definition at line 170 of file _int.h.

◆ PG_GETARG_QUERYTYPE_P_COPY

#define PG_GETARG_QUERYTYPE_P_COPY (   n)    DatumGetQueryTypePCopy(PG_GETARG_DATUM(n))

Definition at line 171 of file _int.h.

◆ PREPAREARR

#define PREPAREARR (   x)
Value:
do { \
int _nelems_ = ARRNELEMS(x); \
if (_nelems_ > 1) \
if (isort(ARRPTR(x), _nelems_)) \
(x) = _int_unique(x); \
} while(0)
isort
bool isort(int32 *a, int len)
Definition: _int_tool.c:211
_int_unique
ArrayType * _int_unique(ArrayType *r)
Definition: _int_tool.c:310
ARRNELEMS
#define ARRNELEMS(x)
Definition: _int.h:27
ARRPTR
#define ARRPTR(x)
Definition: _int.h:26

Definition at line 49 of file _int.h.

◆ QSORT

#define QSORT (   a,
  direction 
)
Value:
do { \
int _nelems_ = ARRNELEMS(a); \
if (_nelems_ > 1) \
qsort((void*) ARRPTR(a), _nelems_, sizeof(int32), \
(direction) ? compASC : compDESC ); \
} while(0)
compASC
int compASC(const void *a, const void *b)
Definition: _int_tool.c:397
compDESC
int compDESC(const void *a, const void *b)
Definition: _int_tool.c:405
a
int a
Definition: isn.c:69

Definition at line 183 of file _int.h.

◆ QUERYTYPEMAXITEMS

#define QUERYTYPEMAXITEMS   ((MaxAllocSize - HDRSIZEQT) / sizeof(ITEM))

Definition at line 156 of file _int.h.

◆ SETBIT

#define SETBIT (   x,
  i 
)    GETBYTE(x,i) |= ( 0x01 << ( (i) % BITS_PER_BYTE ) )

Definition at line 78 of file _int.h.

◆ SIGLEN_DEFAULT

#define SIGLEN_DEFAULT   (63 * 4)

Definition at line 62 of file _int.h.

◆ SIGLEN_MAX

#define SIGLEN_MAX   GISTMaxIndexKeySize

Definition at line 63 of file _int.h.

◆ SIGLENBIT

#define SIGLENBIT (   siglen)    ((siglen) * BITS_PER_BYTE)

Definition at line 64 of file _int.h.

◆ SORT

#define SORT (   x)
Value:
do { \
int _nelems_ = ARRNELEMS(x); \
if (_nelems_ > 1) \
isort(ARRPTR(x), _nelems_); \
} while(0)

Definition at line 41 of file _int.h.

◆ VAL

#define VAL   2

Definition at line 162 of file _int.h.

◆ WISH_F

#define WISH_F (   a,
  b,
  c 
)    (double)( -(double)(((a)-(b))*((a)-(b))*((a)-(b)))*(c) )

Definition at line 58 of file _int.h.

Typedef Documentation

◆ BITVECP

typedef char* BITVECP

Definition at line 69 of file _int.h.

◆ ITEM

typedef struct ITEM ITEM

◆ QUERYTYPE

typedef struct QUERYTYPE QUERYTYPE

Function Documentation

◆ _int_unique()

ArrayType* _int_unique ( ArrayType *  r)

Definition at line 310 of file _int_tool.c.

311 {
312  int num = ARRNELEMS(r);
313  bool duplicates_found; /* not used */
314 
315  num = qunique_arg(ARRPTR(r), num, sizeof(int), isort_cmp,
316  &duplicates_found);
317 
318  return resize_intArrayType(r, num);
319 }
isort_cmp
static int isort_cmp(const void *a, const void *b, void *arg)
Definition: _int_tool.c:190
resize_intArrayType
ArrayType * resize_intArrayType(ArrayType *a, int num)
Definition: _int_tool.c:249
ARRNELEMS
#define ARRNELEMS(x)
Definition: cube.c:26
ARRPTR
#define ARRPTR(x)
Definition: cube.c:25
qunique_arg
static size_t qunique_arg(void *array, size_t elements, size_t width, int(*compare)(const void *, const void *, void *), void *arg)
Definition: qunique.h:46

References ARRNELEMS, ARRPTR, isort_cmp(), qunique_arg(), and resize_intArrayType().

Referenced by g_int_union(), inner_int_union(), intset_subtract(), intset_union_elem(), and uniq().

◆ compASC()

int compASC ( const void *  a,
const void *  b 
)

Definition at line 397 of file _int_tool.c.

398 {
399  if (*(const int32 *) a == *(const int32 *) b)
400  return 0;
401  return (*(const int32 *) a > *(const int32 *) b) ? 1 : -1;
402 }
b
int b
Definition: isn.c:70

References a, and b.

◆ compDESC()

int compDESC ( const void *  a,
const void *  b 
)

Definition at line 405 of file _int_tool.c.

406 {
407  if (*(const int32 *) a == *(const int32 *) b)
408  return 0;
409  return (*(const int32 *) a < *(const int32 *) b) ? 1 : -1;
410 }

References a, and b.

◆ copy_intArrayType()

ArrayType* copy_intArrayType ( ArrayType *  a)

Definition at line 280 of file _int_tool.c.

281 {
282  ArrayType *r;
283  int n = ARRNELEMS(a);
284 
285  r = new_intArrayType(n);
286  memcpy(ARRPTR(r), ARRPTR(a), n * sizeof(int32));
287  return r;
288 }
new_intArrayType
ArrayType * new_intArrayType(int num)
Definition: _int_tool.c:221

References a, ARRNELEMS, ARRPTR, and new_intArrayType().

Referenced by g_int_picksplit(), and inner_int_union().

◆ execconsistent()

bool execconsistent ( QUERYTYPE *  query,
ArrayType *  array,
bool  calcnot 
)

Definition at line 308 of file _int_bool.c.

309 {
310  CHKVAL chkval;
311 
312  CHECKARRVALID(array);
313  chkval.arrb = ARRPTR(array);
314  chkval.arre = chkval.arrb + ARRNELEMS(array);
315  return execute(GETQUERY(query) + query->size - 1,
316  (void *) &chkval, NULL, calcnot,
317  checkcondition_arr);
318 }
CHECKARRVALID
#define CHECKARRVALID(x)
Definition: _int.h:30
GETQUERY
#define GETQUERY(x)
Definition: _int.h:157
checkcondition_arr
static bool checkcondition_arr(void *checkval, ITEM *item, void *options)
Definition: _int_bool.c:234
execute
static bool execute(ITEM *curitem, void *checkval, void *options, bool calcnot, bool(*chkcond)(void *checkval, ITEM *item, void *options))
Definition: _int_bool.c:265
CHKVAL::arrb
int32 * arrb
Definition: _int_bool.c:226
CHKVAL::arre
int32 * arre
Definition: _int_bool.c:227
QUERYTYPE::size
int32 size
Definition: _int.h:150

References CHKVAL::arrb, CHKVAL::arre, ARRNELEMS, ARRPTR, CHECKARRVALID, checkcondition_arr(), execute(), GETQUERY, and QUERYTYPE::size.

Referenced by g_int_consistent().

◆ gensign()

void gensign ( BITVECP  sign,
int *  a,
int  len,
int  siglen 
)

Definition at line 322 of file _int_tool.c.

323 {
324  int i;
325 
326  /* we assume that the sign vector is previously zeroed */
327  for (i = 0; i < len; i++)
328  {
329  HASH(sign, *a, siglen);
330  a++;
331  }
332 }
HASH
#define HASH(sign, val, siglen)
Definition: hstore_gist.c:45
sign
char sign
Definition: informix.c:668
i
int i
Definition: isn.c:73
len
const void size_t len
Definition: pg_crc32c_sse42.c:24

References a, HASH, i, len, and sign.

◆ gin_bool_consistent()

bool gin_bool_consistent ( QUERYTYPE *  query,
bool *  check 
)

Definition at line 335 of file _int_bool.c.

336 {
337  GinChkVal gcv;
338  ITEM *items = GETQUERY(query);
339  int i,
340  j = 0;
341 
342  if (query->size <= 0)
343  return false;
344 
345  /*
346  * Set up data for checkcondition_gin. This must agree with the query
347  * extraction code in ginint4_queryextract.
348  */
349  gcv.first = items;
350  gcv.mapped_check = (bool *) palloc(sizeof(bool) * query->size);
351  for (i = 0; i < query->size; i++)
352  {
353  if (items[i].type == VAL)
354  gcv.mapped_check[i] = check[j++];
355  }
356 
357  return execute(GETQUERY(query) + query->size - 1,
358  (void *) &gcv, NULL, true,
359  checkcondition_gin);
360 }
VAL
#define VAL
Definition: _int.h:162
checkcondition_gin
static bool checkcondition_gin(void *checkval, ITEM *item, void *options)
Definition: _int_bool.c:327
j
int j
Definition: isn.c:74
palloc
void * palloc(Size size)
Definition: mcxt.c:1226
GinChkVal::first
ITEM * first
Definition: _int_bool.c:322
GinChkVal::mapped_check
bool * mapped_check
Definition: _int_bool.c:323
ITEM
Definition: _int.h:141
type
const char * type
Definition: wait_event_funcs.c:27

References checkcondition_gin(), execute(), GinChkVal::first, GETQUERY, i, j, GinChkVal::mapped_check, palloc(), QUERYTYPE::size, type, and VAL.

Referenced by ginint4_consistent().

◆ inner_int_contains()

bool inner_int_contains ( ArrayType *  a,
ArrayType *  b 
)

Definition at line 14 of file _int_tool.c.

15 {
16  int na,
17  nb;
18  int i,
19  j,
20  n;
21  int *da,
22  *db;
23 
24  na = ARRNELEMS(a);
25  nb = ARRNELEMS(b);
26  da = ARRPTR(a);
27  db = ARRPTR(b);
28 
29  i = j = n = 0;
30  while (i < na && j < nb)
31  {
32  if (da[i] < db[j])
33  i++;
34  else if (da[i] == db[j])
35  {
36  n++;
37  i++;
38  j++;
39  }
40  else
41  break; /* db[j] is not in da */
42  }
43 
44  return (n == nb);
45 }

References a, ARRNELEMS, ARRPTR, b, i, and j.

Referenced by _int_contains(), and g_int_consistent().

◆ inner_int_inter()

ArrayType* inner_int_inter ( ArrayType *  a,
ArrayType *  b 
)

Definition at line 135 of file _int_tool.c.

136 {
137  ArrayType *r;
138  int na,
139  nb;
140  int *da,
141  *db,
142  *dr;
143  int i,
144  j,
145  k;
146 
147  if (ARRISEMPTY(a) || ARRISEMPTY(b))
148  return new_intArrayType(0);
149 
150  na = ARRNELEMS(a);
151  nb = ARRNELEMS(b);
152  da = ARRPTR(a);
153  db = ARRPTR(b);
154  r = new_intArrayType(Min(na, nb));
155  dr = ARRPTR(r);
156 
157  i = j = k = 0;
158  while (i < na && j < nb)
159  {
160  if (da[i] < db[j])
161  i++;
162  else if (da[i] == db[j])
163  {
164  if (k == 0 || dr[k - 1] != db[j])
165  dr[k++] = db[j];
166  i++;
167  j++;
168  }
169  else
170  j++;
171  }
172 
173  if (k == 0)
174  {
175  pfree(r);
176  return new_intArrayType(0);
177  }
178  else
179  return resize_intArrayType(r, k);
180 }
ARRISEMPTY
#define ARRISEMPTY(x)
Definition: _int.h:38
Min
#define Min(x, y)
Definition: c.h:993
pfree
void pfree(void *pointer)
Definition: mcxt.c:1456

References a, ARRISEMPTY, ARRNELEMS, ARRPTR, b, i, j, Min, new_intArrayType(), pfree(), and resize_intArrayType().

Referenced by _int_inter(), and g_int_picksplit().

◆ inner_int_overlap()

bool inner_int_overlap ( ArrayType *  a,
ArrayType *  b 
)

Definition at line 49 of file _int_tool.c.

50 {
51  int na,
52  nb;
53  int i,
54  j;
55  int *da,
56  *db;
57 
58  na = ARRNELEMS(a);
59  nb = ARRNELEMS(b);
60  da = ARRPTR(a);
61  db = ARRPTR(b);
62 
63  i = j = 0;
64  while (i < na && j < nb)
65  {
66  if (da[i] < db[j])
67  i++;
68  else if (da[i] == db[j])
69  return true;
70  else
71  j++;
72  }
73 
74  return false;
75 }

References a, ARRNELEMS, ARRPTR, b, i, and j.

Referenced by _int_overlap(), and g_int_consistent().

◆ inner_int_union()

ArrayType* inner_int_union ( ArrayType *  a,
ArrayType *  b 
)

Definition at line 78 of file _int_tool.c.

79 {
80  ArrayType *r = NULL;
81 
82  CHECKARRVALID(a);
83  CHECKARRVALID(b);
84 
85  if (ARRISEMPTY(a) && ARRISEMPTY(b))
86  return new_intArrayType(0);
87  if (ARRISEMPTY(a))
88  r = copy_intArrayType(b);
89  if (ARRISEMPTY(b))
90  r = copy_intArrayType(a);
91 
92  if (!r)
93  {
94  int na = ARRNELEMS(a),
95  nb = ARRNELEMS(b);
96  int *da = ARRPTR(a),
97  *db = ARRPTR(b);
98  int i,
99  j,
100  *dr;
101 
102  r = new_intArrayType(na + nb);
103  dr = ARRPTR(r);
104 
105  /* union */
106  i = j = 0;
107  while (i < na && j < nb)
108  {
109  if (da[i] == db[j])
110  {
111  *dr++ = da[i++];
112  j++;
113  }
114  else if (da[i] < db[j])
115  *dr++ = da[i++];
116  else
117  *dr++ = db[j++];
118  }
119 
120  while (i < na)
121  *dr++ = da[i++];
122  while (j < nb)
123  *dr++ = db[j++];
124 
125  r = resize_intArrayType(r, dr - ARRPTR(r));
126  }
127 
128  if (ARRNELEMS(r) > 1)
129  r = _int_unique(r);
130 
131  return r;
132 }
copy_intArrayType
ArrayType * copy_intArrayType(ArrayType *a)
Definition: _int_tool.c:280
_int_unique
ArrayType * _int_unique(ArrayType *r)
Definition: _int_tool.c:310

References _int_unique(), a, ARRISEMPTY, ARRNELEMS, ARRPTR, b, CHECKARRVALID, copy_intArrayType(), i, j, new_intArrayType(), and resize_intArrayType().

Referenced by _int_union(), g_int_penalty(), and g_int_picksplit().

◆ int_to_intset()

ArrayType* int_to_intset ( int32  elem)

Definition at line 385 of file _int_tool.c.

386 {
387  ArrayType *result;
388  int32 *aa;
389 
390  result = new_intArrayType(1);
391  aa = ARRPTR(result);
392  aa[0] = elem;
393  return result;
394 }

References ARRPTR, and new_intArrayType().

Referenced by intset().

◆ intarray_add_elem()

ArrayType* intarray_add_elem ( ArrayType *  a,
int32  elem 
)

Definition at line 351 of file _int_tool.c.

352 {
353  ArrayType *result;
354  int32 *r;
355  int32 c;
356 
357  CHECKARRVALID(a);
358  c = ARRNELEMS(a);
359  result = new_intArrayType(c + 1);
360  r = ARRPTR(result);
361  if (c > 0)
362  memcpy(r, ARRPTR(a), c * sizeof(int32));
363  r[c] = elem;
364  return result;
365 }
c
char * c
Definition: preproc-cursor.c:31

References a, ARRNELEMS, ARRPTR, CHECKARRVALID, and new_intArrayType().

Referenced by intarray_push_elem(), and intset_union_elem().

◆ intarray_concat_arrays()

ArrayType* intarray_concat_arrays ( ArrayType *  a,
ArrayType *  b 
)

Definition at line 368 of file _int_tool.c.

369 {
370  ArrayType *result;
371  int32 ac = ARRNELEMS(a);
372  int32 bc = ARRNELEMS(b);
373 
374  CHECKARRVALID(a);
375  CHECKARRVALID(b);
376  result = new_intArrayType(ac + bc);
377  if (ac)
378  memcpy(ARRPTR(result), ARRPTR(a), ac * sizeof(int32));
379  if (bc)
380  memcpy(ARRPTR(result) + ac, ARRPTR(b), bc * sizeof(int32));
381  return result;
382 }

References a, ARRNELEMS, ARRPTR, b, CHECKARRVALID, and new_intArrayType().

Referenced by intarray_push_array().

◆ intarray_match_first()

int32 intarray_match_first ( ArrayType *  a,
int32  elem 
)

Definition at line 335 of file _int_tool.c.

336 {
337  int32 *aa,
338  c,
339  i;
340 
341  CHECKARRVALID(a);
342  c = ARRNELEMS(a);
343  aa = ARRPTR(a);
344  for (i = 0; i < c; i++)
345  if (aa[i] == elem)
346  return (i + 1);
347  return 0;
348 }

References a, ARRNELEMS, ARRPTR, CHECKARRVALID, and i.

Referenced by idx().

◆ internal_size()

int internal_size ( int *  a,
int  len 
)

Definition at line 292 of file _int_tool.c.

293 {
294  int i;
295  int64 size = 0;
296 
297  for (i = 0; i < len; i += 2)
298  {
299  if (!i || a[i] != a[i - 1]) /* do not count repeated range */
300  size += (int64) (a[i + 1]) - (int64) (a[i]) + 1;
301  }
302 
303  if (size > (int64) INT_MAX || size < (int64) INT_MIN)
304  return -1; /* overflow */
305  return (int) size;
306 }

References a, i, and len.

Referenced by g_int_compress(), and g_int_decompress().

◆ isort()

bool isort ( int32 *  a,
int  len 
)

Definition at line 211 of file _int_tool.c.

212 {
213  bool r = false;
214 
215  qsort_arg(a, len, sizeof(int32), isort_cmp, &r);
216  return r;
217 }
qsort_arg
void qsort_arg(void *base, size_t nel, size_t elsize, qsort_arg_comparator cmp, void *arg)

References a, isort_cmp(), len, and qsort_arg().

◆ new_intArrayType()

ArrayType* new_intArrayType ( int  num)

Definition at line 221 of file _int_tool.c.

222 {
223  ArrayType *r;
224  int nbytes;
225 
226  /* if no elements, return a zero-dimensional array */
227  if (num <= 0)
228  {
229  Assert(num == 0);
230  r = construct_empty_array(INT4OID);
231  return r;
232  }
233 
234  nbytes = ARR_OVERHEAD_NONULLS(1) + sizeof(int) * num;
235 
236  r = (ArrayType *) palloc0(nbytes);
237 
238  SET_VARSIZE(r, nbytes);
239  ARR_NDIM(r) = 1;
240  r->dataoffset = 0; /* marker for no null bitmap */
241  ARR_ELEMTYPE(r) = INT4OID;
242  ARR_DIMS(r)[0] = num;
243  ARR_LBOUND(r)[0] = 1;
244 
245  return r;
246 }
ARR_NDIM
#define ARR_NDIM(a)
Definition: array.h:283
ARR_ELEMTYPE
#define ARR_ELEMTYPE(a)
Definition: array.h:285
ARR_OVERHEAD_NONULLS
#define ARR_OVERHEAD_NONULLS(ndims)
Definition: array.h:303
ARR_DIMS
#define ARR_DIMS(a)
Definition: array.h:287
ARR_LBOUND
#define ARR_LBOUND(a)
Definition: array.h:289
construct_empty_array
ArrayType * construct_empty_array(Oid elmtype)
Definition: arrayfuncs.c:3527
Assert
Assert(fmt[strlen(fmt) - 1] !='\n')
palloc0
void * palloc0(Size size)
Definition: mcxt.c:1257
ArrayType::dataoffset
int32 dataoffset
Definition: array.h:89
SET_VARSIZE
#define SET_VARSIZE(PTR, len)
Definition: varatt.h:305

References ARR_DIMS, ARR_ELEMTYPE, ARR_LBOUND, ARR_NDIM, ARR_OVERHEAD_NONULLS, Assert(), construct_empty_array(), ArrayType::dataoffset, palloc0(), and SET_VARSIZE.

Referenced by copy_intArrayType(), g_int_decompress(), g_int_union(), inner_int_inter(), inner_int_union(), int_to_intset(), intarray_add_elem(), intarray_concat_arrays(), intset_subtract(), and subarray().

◆ query_has_required_values()

bool query_has_required_values ( QUERYTYPE *  query)

Definition at line 398 of file _int_bool.c.

399 {
400  if (query->size <= 0)
401  return false;
402  return contains_required_value(GETQUERY(query) + query->size - 1);
403 }
contains_required_value
static bool contains_required_value(ITEM *curitem)
Definition: _int_bool.c:363

References contains_required_value(), GETQUERY, and QUERYTYPE::size.

Referenced by ginint4_queryextract().

◆ resize_intArrayType()

ArrayType* resize_intArrayType ( ArrayType *  a,
int  num 
)

Definition at line 249 of file _int_tool.c.

250 {
251  int nbytes;
252  int i;
253 
254  /* if no elements, return a zero-dimensional array */
255  if (num <= 0)
256  {
257  Assert(num == 0);
258  a = construct_empty_array(INT4OID);
259  return a;
260  }
261 
262  if (num == ARRNELEMS(a))
263  return a;
264 
265  nbytes = ARR_DATA_OFFSET(a) + sizeof(int) * num;
266 
267  a = (ArrayType *) repalloc(a, nbytes);
268 
269  SET_VARSIZE(a, nbytes);
270  /* usually the array should be 1-D already, but just in case ... */
271  for (i = 0; i < ARR_NDIM(a); i++)
272  {
273  ARR_DIMS(a)[i] = num;
274  num = 1;
275  }
276  return a;
277 }
ARR_DATA_OFFSET
#define ARR_DATA_OFFSET(a)
Definition: array.h:309
repalloc
void * repalloc(void *pointer, Size size)
Definition: mcxt.c:1476

References a, ARR_DATA_OFFSET, ARR_DIMS, ARR_NDIM, ARRNELEMS, Assert(), construct_empty_array(), i, repalloc(), and SET_VARSIZE.

Referenced by _int_unique(), g_int_compress(), inner_int_inter(), inner_int_union(), intarray_del_elem(), and intset_subtract().

◆ rt__int_size()

void rt__int_size ( ArrayType *  a,
float *  size 
)

Definition at line 183 of file _int_tool.c.

184 {
185  *size = (float) ARRNELEMS(a);
186 }

References a, and ARRNELEMS.

Referenced by g_int_penalty(), and g_int_picksplit().

◆ signconsistent()

bool signconsistent ( QUERYTYPE *  query,
BITVECP  sign,
int  siglen,
bool  calcnot 
)

Definition at line 299 of file _int_bool.c.

300 {
301  return execute(GETQUERY(query) + query->size - 1,
302  (void *) sign, (void *) (intptr_t) siglen, calcnot,
303  checkcondition_bit);
304 }
checkcondition_bit
static bool checkcondition_bit(void *checkval, ITEM *item, void *siglen)
Definition: _int_bool.c:256

References checkcondition_bit(), execute(), GETQUERY, sign, and QUERYTYPE::size.

Referenced by g_intbig_consistent().