PostgreSQL Source Code  git master
_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  GISTTYPE
 
struct  ITEM
 
struct  QUERYTYPE
 

Macros

#define MAXNUMRANGE   100
 
#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 SIGLENINT   63 /* >122 => key will toast, so very slow!!! */
 
#define SIGLEN   ( sizeof(int)*SIGLENINT )
 
#define SIGLENBIT   (SIGLEN*BITS_PER_BYTE)
 
#define LOOPBYTE   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)   (((unsigned int)(val)) % SIGLENBIT)
 
#define HASH(sign, val)   SETBIT((sign), HASHVAL(val))
 
#define ALLISTRUE   0x04
 
#define ISALLTRUE(x)   ( ((GISTTYPE*)x)->flag & ALLISTRUE )
 
#define GTHDRSIZE   (VARHDRSZ + sizeof(int32))
 
#define CALCGTSIZE(flag)   ( 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 BITVEC[SIGLEN]
 
typedef char * BITVECP
 
typedef struct ITEM ITEM
 
typedef struct QUERYTYPE QUERYTYPE
 

Functions

bool isort (int32 *a, int len)
 
ArrayTypenew_intArrayType (int num)
 
ArrayTypecopy_intArrayType (ArrayType *a)
 
ArrayTyperesize_intArrayType (ArrayType *a, int num)
 
int internal_size (int *a, int len)
 
ArrayType_int_unique (ArrayType *a)
 
int32 intarray_match_first (ArrayType *a, int32 elem)
 
ArrayTypeintarray_add_elem (ArrayType *a, int32 elem)
 
ArrayTypeintarray_concat_arrays (ArrayType *a, ArrayType *b)
 
ArrayTypeint_to_intset (int32 elem)
 
bool inner_int_overlap (ArrayType *a, ArrayType *b)
 
bool inner_int_contains (ArrayType *a, ArrayType *b)
 
ArrayTypeinner_int_union (ArrayType *a, ArrayType *b)
 
ArrayTypeinner_int_inter (ArrayType *a, ArrayType *b)
 
void rt__int_size (ArrayType *a, float *size)
 
void gensign (BITVEC sign, int *a, int len)
 
bool signconsistent (QUERYTYPE *query, BITVEC sign, 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 79 of file _int.h.

◆ ARRISEMPTY

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

◆ ARRNELEMS

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

Definition at line 15 of file _int.h.

◆ ARRPTR

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

Definition at line 14 of file _int.h.

◆ BooleanSearchStrategy

#define BooleanSearchStrategy   20

◆ CALCGTSIZE

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

Definition at line 84 of file _int.h.

◆ CHECKARRVALID

#define CHECKARRVALID (   x)
Value:
do { \
ereport(ERROR, \
(errcode(ERRCODE_NULL_VALUE_NOT_ALLOWED), \
errmsg("array must not contain nulls"))); \
} while(0)
int errcode(int sqlerrcode)
Definition: elog.c:570
#define ERROR
Definition: elog.h:43
#define ARR_HASNULL(a)
Definition: array.h:279
int errmsg(const char *fmt,...)
Definition: elog.c:784
bool array_contains_nulls(ArrayType *array)
Definition: arrayfuncs.c:3528

Definition at line 18 of file _int.h.

Referenced by _int_contains(), _int_inter(), _int_overlap(), _int_same(), _int_union(), _intbig_contains(), _intbig_overlap(), boolop(), execconsistent(), g_int_compress(), g_int_consistent(), g_int_decompress(), g_int_same(), g_int_union(), g_intbig_compress(), g_intbig_consistent(), ginint4_queryextract(), idx(), inner_int_union(), intarray_add_elem(), intarray_concat_arrays(), intarray_del_elem(), intarray_match_first(), intset_subtract(), sort(), sort_asc(), sort_desc(), subarray(), and uniq().

◆ CLOSE

#define CLOSE   5

Definition at line 144 of file _int.h.

Referenced by gettoken(), gettoken_query(), and makepol().

◆ CLRBIT

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

Definition at line 63 of file _int.h.

◆ COMPUTESIZE

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

Definition at line 134 of file _int.h.

Referenced by bqarr_in(), cleanup_tsquery_stopwords(), parse_tsquery(), QTN2QT(), and queryin().

◆ DatumGetQueryTypeP

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

Definition at line 147 of file _int.h.

Referenced by _int_matchsel().

◆ DatumGetQueryTypePCopy

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

Definition at line 148 of file _int.h.

◆ END

#define END   0

Definition at line 139 of file _int.h.

Referenced by gettoken(), gettoken_query(), makepol(), and next().

◆ ERR

#define ERR   1

◆ GETBIT

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

Definition at line 65 of file _int.h.

◆ GETBITBYTE

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

Definition at line 62 of file _int.h.

◆ GETBYTE

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

Definition at line 61 of file _int.h.

◆ GETQUERY

◆ GETSIGN

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

Definition at line 86 of file _int.h.

◆ GTHDRSIZE

#define GTHDRSIZE   (VARHDRSZ + sizeof(int32))

Definition at line 83 of file _int.h.

◆ HASH

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

Definition at line 67 of file _int.h.

◆ HASHVAL

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

Definition at line 66 of file _int.h.

◆ HDRSIZEQT

#define HDRSIZEQT   offsetof(QUERYTYPE, items)

Definition at line 133 of file _int.h.

◆ ISALLTRUE

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

Definition at line 81 of file _int.h.

◆ LOOPBYTE

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

Definition at line 57 of file _int.h.

◆ MAXNUMRANGE

#define MAXNUMRANGE   100

Definition at line 11 of file _int.h.

Referenced by g_int_compress(), and g_int_decompress().

◆ OPEN

#define OPEN   4

Definition at line 143 of file _int.h.

Referenced by gettoken(), gettoken_query(), and makepol().

◆ OPR

#define OPR   3

Definition at line 142 of file _int.h.

Referenced by bqarr_in(), findoprnd(), gettoken(), gettoken_query(), infix(), int_query_opr_selec(), and makepol().

◆ PG_GETARG_QUERYTYPE_P

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

Definition at line 149 of file _int.h.

Referenced by boolop(), bqarr_out(), ginint4_consistent(), and ginint4_queryextract().

◆ PG_GETARG_QUERYTYPE_P_COPY

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

Definition at line 150 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)
#define ARRNELEMS(x)
Definition: _int.h:15
bool isort(int32 *a, int len)
Definition: _int_tool.c:212
#define ARRPTR(x)
Definition: _int.h:14
ArrayType * _int_unique(ArrayType *a)
Definition: _int_tool.c:311

Definition at line 37 of file _int.h.

Referenced by _int_contains(), boolop(), g_int_compress(), and g_int_consistent().

◆ 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)
#define ARRNELEMS(x)
Definition: _int.h:15
signed int int32
Definition: c.h:346
#define ARRPTR(x)
Definition: _int.h:14
int compDESC(const void *a, const void *b)
Definition: _int_tool.c:416
int compASC(const void *a, const void *b)
Definition: _int_tool.c:408

Definition at line 162 of file _int.h.

Referenced by g_int_union(), intset_subtract(), intset_union_elem(), sort(), sort_asc(), and sort_desc().

◆ QUERYTYPEMAXITEMS

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

Definition at line 135 of file _int.h.

Referenced by bqarr_in().

◆ SETBIT

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

Definition at line 64 of file _int.h.

◆ SIGLEN

#define SIGLEN   ( sizeof(int)*SIGLENINT )

Definition at line 51 of file _int.h.

◆ SIGLENBIT

#define SIGLENBIT   (SIGLEN*BITS_PER_BYTE)

Definition at line 52 of file _int.h.

◆ SIGLENINT

#define SIGLENINT   63 /* >122 => key will toast, so very slow!!! */

Definition at line 50 of file _int.h.

◆ SORT

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

Definition at line 29 of file _int.h.

Referenced by _int_inter(), _int_overlap(), _int_same(), and _int_union().

◆ VAL

◆ WISH_F

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

Definition at line 46 of file _int.h.

Typedef Documentation

◆ BITVEC

typedef char BITVEC[SIGLEN]

Definition at line 54 of file _int.h.

◆ BITVECP

Definition at line 55 of file _int.h.

◆ ITEM

typedef struct ITEM ITEM

◆ QUERYTYPE

Function Documentation

◆ _int_unique()

ArrayType* _int_unique ( ArrayType a)

Definition at line 311 of file _int_tool.c.

References ARRNELEMS, ARRPTR, and resize_intArrayType().

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

312 {
313  int *tmp,
314  *dr,
315  *data;
316  int num = ARRNELEMS(r);
317 
318  if (num < 2)
319  return r;
320 
321  data = tmp = dr = ARRPTR(r);
322  while (tmp - data < num)
323  {
324  if (*tmp != *dr)
325  *(++dr) = *tmp++;
326  else
327  tmp++;
328  }
329  return resize_intArrayType(r, dr + 1 - ARRPTR(r));
330 }
ArrayType * resize_intArrayType(ArrayType *a, int num)
Definition: _int_tool.c:250
#define ARRNELEMS(x)
Definition: cube.c:26
#define ARRPTR(x)
Definition: cube.c:25

◆ compASC()

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

Definition at line 408 of file _int_tool.c.

409 {
410  if (*(const int32 *) a == *(const int32 *) b)
411  return 0;
412  return (*(const int32 *) a > *(const int32 *) b) ? 1 : -1;
413 }
signed int int32
Definition: c.h:346

◆ compDESC()

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

Definition at line 416 of file _int_tool.c.

417 {
418  if (*(const int32 *) a == *(const int32 *) b)
419  return 0;
420  return (*(const int32 *) a < *(const int32 *) b) ? 1 : -1;
421 }
signed int int32
Definition: c.h:346

◆ copy_intArrayType()

ArrayType* copy_intArrayType ( ArrayType a)

Definition at line 281 of file _int_tool.c.

References ARRNELEMS, ARRPTR, and new_intArrayType().

Referenced by g_int_picksplit(), and inner_int_union().

282 {
283  ArrayType *r;
284  int n = ARRNELEMS(a);
285 
286  r = new_intArrayType(n);
287  memcpy(ARRPTR(r), ARRPTR(a), n * sizeof(int32));
288  return r;
289 }
ArrayType * new_intArrayType(int num)
Definition: _int_tool.c:222
signed int int32
Definition: c.h:346
#define ARRNELEMS(x)
Definition: cube.c:26
#define ARRPTR(x)
Definition: cube.c:25

◆ execconsistent()

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

Definition at line 310 of file _int_bool.c.

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

Referenced by g_int_consistent().

311 {
312  CHKVAL chkval;
313 
314  CHECKARRVALID(array);
315  chkval.arrb = ARRPTR(array);
316  chkval.arre = chkval.arrb + ARRNELEMS(array);
317  return execute(GETQUERY(query) + query->size - 1,
318  (void *) &chkval, calcnot,
320 }
static bool checkcondition_arr(void *checkval, ITEM *item)
Definition: _int_bool.c:236
#define CHECKARRVALID(x)
Definition: _int.h:18
#define GETQUERY(x)
Definition: _int.h:136
int32 * arrb
Definition: _int_bool.c:228
static bool execute(ITEM *curitem, void *checkval, bool calcnot, bool(*chkcond)(void *checkval, ITEM *item))
Definition: _int_bool.c:267
#define ARRNELEMS(x)
Definition: cube.c:26
int32 * arre
Definition: _int_bool.c:229
#define ARRPTR(x)
Definition: cube.c:25
int32 size
Definition: _int.h:129

◆ gensign()

void gensign ( BITVEC  sign,
int *  a,
int  len 
)

Definition at line 333 of file _int_tool.c.

References HASH, and i.

334 {
335  int i;
336 
337  /* we assume that the sign vector is previously zeroed */
338  for (i = 0; i < len; i++)
339  {
340  HASH(sign, *a);
341  a++;
342  }
343 }
#define HASH(sign, val)
Definition: hstore_gist.c:35
char sign
Definition: informix.c:688
int i

◆ gin_bool_consistent()

bool gin_bool_consistent ( QUERYTYPE query,
bool check 
)

Definition at line 337 of file _int_bool.c.

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

Referenced by ginint4_consistent().

338 {
339  GinChkVal gcv;
340  ITEM *items = GETQUERY(query);
341  int i,
342  j = 0;
343 
344  if (query->size <= 0)
345  return false;
346 
347  /*
348  * Set up data for checkcondition_gin. This must agree with the query
349  * extraction code in ginint4_queryextract.
350  */
351  gcv.first = items;
352  gcv.mapped_check = (bool *) palloc(sizeof(bool) * query->size);
353  for (i = 0; i < query->size; i++)
354  {
355  if (items[i].type == VAL)
356  gcv.mapped_check[i] = check[j++];
357  }
358 
359  return execute(GETQUERY(query) + query->size - 1,
360  (void *) &gcv, true,
362 }
Definition: _int.h:119
bool * mapped_check
Definition: _int_bool.c:325
#define GETQUERY(x)
Definition: _int.h:136
#define VAL
Definition: _int.h:141
static bool execute(ITEM *curitem, void *checkval, bool calcnot, bool(*chkcond)(void *checkval, ITEM *item))
Definition: _int_bool.c:267
void * palloc(Size size)
Definition: mcxt.c:924
int i
ITEM * first
Definition: _int_bool.c:324
int32 size
Definition: _int.h:129
static bool checkcondition_gin(void *checkval, ITEM *item)
Definition: _int_bool.c:329

◆ inner_int_contains()

bool inner_int_contains ( ArrayType a,
ArrayType b 
)

Definition at line 15 of file _int_tool.c.

References ARRNELEMS, ARRPTR, i, and true.

Referenced by _int_contains(), and g_int_consistent().

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

◆ inner_int_inter()

ArrayType* inner_int_inter ( ArrayType a,
ArrayType b 
)

Definition at line 136 of file _int_tool.c.

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

Referenced by _int_inter(), and g_int_picksplit().

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

◆ inner_int_overlap()

bool inner_int_overlap ( ArrayType a,
ArrayType b 
)

Definition at line 50 of file _int_tool.c.

References ARRNELEMS, ARRPTR, and i.

Referenced by _int_overlap(), and g_int_consistent().

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

◆ inner_int_union()

ArrayType* inner_int_union ( ArrayType a,
ArrayType b 
)

Definition at line 79 of file _int_tool.c.

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

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

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

◆ int_to_intset()

ArrayType* int_to_intset ( int32  elem)

Definition at line 396 of file _int_tool.c.

References ARRPTR, and new_intArrayType().

Referenced by intset().

397 {
398  ArrayType *result;
399  int32 *aa;
400 
401  result = new_intArrayType(1);
402  aa = ARRPTR(result);
403  aa[0] = n;
404  return result;
405 }
ArrayType * new_intArrayType(int num)
Definition: _int_tool.c:222
signed int int32
Definition: c.h:346
#define ARRPTR(x)
Definition: cube.c:25

◆ intarray_add_elem()

ArrayType* intarray_add_elem ( ArrayType a,
int32  elem 
)

Definition at line 362 of file _int_tool.c.

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

Referenced by intarray_push_elem(), and intset_union_elem().

363 {
364  ArrayType *result;
365  int32 *r;
366  int32 c;
367 
368  CHECKARRVALID(a);
369  c = ARRNELEMS(a);
370  result = new_intArrayType(c + 1);
371  r = ARRPTR(result);
372  if (c > 0)
373  memcpy(r, ARRPTR(a), c * sizeof(int32));
374  r[c] = elem;
375  return result;
376 }
ArrayType * new_intArrayType(int num)
Definition: _int_tool.c:222
#define CHECKARRVALID(x)
Definition: _int.h:18
signed int int32
Definition: c.h:346
char * c
#define ARRNELEMS(x)
Definition: cube.c:26
#define ARRPTR(x)
Definition: cube.c:25

◆ intarray_concat_arrays()

ArrayType* intarray_concat_arrays ( ArrayType a,
ArrayType b 
)

Definition at line 379 of file _int_tool.c.

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

Referenced by intarray_push_array().

380 {
381  ArrayType *result;
382  int32 ac = ARRNELEMS(a);
383  int32 bc = ARRNELEMS(b);
384 
385  CHECKARRVALID(a);
386  CHECKARRVALID(b);
387  result = new_intArrayType(ac + bc);
388  if (ac)
389  memcpy(ARRPTR(result), ARRPTR(a), ac * sizeof(int32));
390  if (bc)
391  memcpy(ARRPTR(result) + ac, ARRPTR(b), bc * sizeof(int32));
392  return result;
393 }
ArrayType * new_intArrayType(int num)
Definition: _int_tool.c:222
#define CHECKARRVALID(x)
Definition: _int.h:18
signed int int32
Definition: c.h:346
#define ARRNELEMS(x)
Definition: cube.c:26
#define ARRPTR(x)
Definition: cube.c:25

◆ intarray_match_first()

int32 intarray_match_first ( ArrayType a,
int32  elem 
)

Definition at line 346 of file _int_tool.c.

References ARRNELEMS, ARRPTR, CHECKARRVALID, and i.

Referenced by idx().

347 {
348  int32 *aa,
349  c,
350  i;
351 
352  CHECKARRVALID(a);
353  c = ARRNELEMS(a);
354  aa = ARRPTR(a);
355  for (i = 0; i < c; i++)
356  if (aa[i] == elem)
357  return (i + 1);
358  return 0;
359 }
#define CHECKARRVALID(x)
Definition: _int.h:18
signed int int32
Definition: c.h:346
char * c
#define ARRNELEMS(x)
Definition: cube.c:26
int i
#define ARRPTR(x)
Definition: cube.c:25

◆ internal_size()

int internal_size ( int *  a,
int  len 
)

Definition at line 293 of file _int_tool.c.

References i.

Referenced by g_int_compress(), and g_int_decompress().

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

◆ isort()

bool isort ( int32 a,
int  len 
)

Definition at line 212 of file _int_tool.c.

References isort_cmp(), and qsort_arg().

213 {
214  bool r = false;
215 
216  qsort_arg(a, len, sizeof(int32), isort_cmp, (void *) &r);
217  return r;
218 }
signed int int32
Definition: c.h:346
void qsort_arg(void *base, size_t nel, size_t elsize, qsort_arg_comparator cmp, void *arg)
Definition: qsort_arg.c:113
static int isort_cmp(const void *a, const void *b, void *arg)
Definition: _int_tool.c:191

◆ new_intArrayType()

ArrayType* new_intArrayType ( int  num)

Definition at line 222 of file _int_tool.c.

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().

223 {
224  ArrayType *r;
225  int nbytes;
226 
227  /* if no elements, return a zero-dimensional array */
228  if (num <= 0)
229  {
230  Assert(num == 0);
231  r = construct_empty_array(INT4OID);
232  return r;
233  }
234 
235  nbytes = ARR_OVERHEAD_NONULLS(1) + sizeof(int) * num;
236 
237  r = (ArrayType *) palloc0(nbytes);
238 
239  SET_VARSIZE(r, nbytes);
240  ARR_NDIM(r) = 1;
241  r->dataoffset = 0; /* marker for no null bitmap */
242  ARR_ELEMTYPE(r) = INT4OID;
243  ARR_DIMS(r)[0] = num;
244  ARR_LBOUND(r)[0] = 1;
245 
246  return r;
247 }
#define ARR_OVERHEAD_NONULLS(ndims)
Definition: array.h:298
int32 dataoffset
Definition: array.h:84
ArrayType * construct_empty_array(Oid elmtype)
Definition: arrayfuncs.c:3410
#define ARR_LBOUND(a)
Definition: array.h:284
#define ARR_DIMS(a)
Definition: array.h:282
void * palloc0(Size size)
Definition: mcxt.c:955
#define Assert(condition)
Definition: c.h:732
#define ARR_NDIM(a)
Definition: array.h:278
#define SET_VARSIZE(PTR, len)
Definition: postgres.h:329
#define ARR_ELEMTYPE(a)
Definition: array.h:280

◆ query_has_required_values()

bool query_has_required_values ( QUERYTYPE query)

Definition at line 400 of file _int_bool.c.

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

Referenced by ginint4_queryextract().

401 {
402  if (query->size <= 0)
403  return false;
404  return contains_required_value(GETQUERY(query) + query->size - 1);
405 }
static bool contains_required_value(ITEM *curitem)
Definition: _int_bool.c:365
#define GETQUERY(x)
Definition: _int.h:136
int32 size
Definition: _int.h:129

◆ resize_intArrayType()

ArrayType* resize_intArrayType ( ArrayType a,
int  num 
)

Definition at line 250 of file _int_tool.c.

References 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().

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

◆ rt__int_size()

void rt__int_size ( ArrayType a,
float *  size 
)

Definition at line 184 of file _int_tool.c.

References ARRNELEMS.

Referenced by g_int_penalty(), and g_int_picksplit().

185 {
186  *size = (float) ARRNELEMS(a);
187 }
#define ARRNELEMS(x)
Definition: cube.c:26

◆ signconsistent()

bool signconsistent ( QUERYTYPE query,
BITVEC  sign,
bool  calcnot 
)

Definition at line 301 of file _int_bool.c.

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

Referenced by g_intbig_consistent().

302 {
303  return execute(GETQUERY(query) + query->size - 1,
304  (void *) sign, calcnot,
306 }
#define GETQUERY(x)
Definition: _int.h:136
char sign
Definition: informix.c:688
static bool execute(ITEM *curitem, void *checkval, bool calcnot, bool(*chkcond)(void *checkval, ITEM *item))
Definition: _int_bool.c:267
static bool checkcondition_bit(void *checkval, ITEM *item)
Definition: _int_bool.c:258
int32 size
Definition: _int.h:129