#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:

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)

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)

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

VARHDRSZ

#define VARHDRSZ

Definition: c.h:649

int32

int32_t int32

Definition: c.h:484

GISTMaxIndexKeySize

#define GISTMaxIndexKeySize

Definition: gist.h:103

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)

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)

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)

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 311 of file _int_tool.c.

{
    int         num = ARRNELEMS(r);
    bool        duplicates_found;   /* not used */
 
    num = qunique_arg(ARRPTR(r), num, sizeof(int), isort_cmp,
                      &duplicates_found);
 
    return resize_intArrayType(r, num);
}

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 398 of file _int_tool.c.

{
    return pg_cmp_s32(*(const int32 *) a, *(const int32 *) b);
}

References a, b, and pg_cmp_s32().

◆ compDESC()

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

Definition at line 404 of file _int_tool.c.

{
    return pg_cmp_s32(*(const int32 *) b, *(const int32 *) a);
}

References a, b, and pg_cmp_s32().

◆ copy_intArrayType()

ArrayType * copy_intArrayType ( ArrayType * a )

Definition at line 281 of file _int_tool.c.

{
    ArrayType  *r;
    int         n = ARRNELEMS(a);
 
    r = new_intArrayType(n);
    memcpy(ARRPTR(r), ARRPTR(a), n * sizeof(int32));
    return r;
}

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 307 of file _int_bool.c.

{
    CHKVAL      chkval;
 
    CHECKARRVALID(array);
    chkval.arrb = ARRPTR(array);
    chkval.arre = chkval.arrb + ARRNELEMS(array);
    return execute(GETQUERY(query) + query->size - 1,
                   &chkval, NULL, calcnot,
                   checkcondition_arr);
}

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 323 of file _int_tool.c.

{
    int         i;
 
    /* we assume that the sign vector is previously zeroed */
    for (i = 0; i < len; i++)
    {
        HASH(sign, *a, siglen);
        a++;
    }
}

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

◆ gin_bool_consistent()

bool gin_bool_consistent	(	QUERYTYPE *	query,
		bool *	check
	)

Definition at line 334 of file _int_bool.c.

{
    GinChkVal   gcv;
    ITEM       *items = GETQUERY(query);
    int         i,
                j = 0;
 
    if (query->size <= 0)
        return false;
 
    /*
     * Set up data for checkcondition_gin.  This must agree with the query
     * extraction code in ginint4_queryextract.
     */
    gcv.first = items;
    gcv.mapped_check = (bool *) palloc(sizeof(bool) * query->size);
    for (i = 0; i < query->size; i++)
    {
        if (items[i].type == VAL)
            gcv.mapped_check[i] = check[j++];
    }
 
    return execute(GETQUERY(query) + query->size - 1,
                   &gcv, NULL, true,
                   checkcondition_gin);
}

References checkcondition_gin(), execute(), GinChkVal::first, GETQUERY, i, items, 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 15 of file _int_tool.c.

{
    int         na,
                nb;
    int         i,
                j,
                n;
    int        *da,
               *db;
 
    na = ARRNELEMS(a);
    nb = ARRNELEMS(b);
    da = ARRPTR(a);
    db = ARRPTR(b);
 
    i = j = n = 0;
    while (i < na && j < nb)
    {
        if (da[i] < db[j])
            i++;
        else if (da[i] == db[j])
        {
            n++;
            i++;
            j++;
        }
        else
            break;              /* db[j] is not in da */
    }
 
    return (n == nb);
}

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 136 of file _int_tool.c.

{
    ArrayType  *r;
    int         na,
                nb;
    int        *da,
               *db,
               *dr;
    int         i,
                j,
                k;
 
    if (ARRISEMPTY(a) || ARRISEMPTY(b))
        return new_intArrayType(0);
 
    na = ARRNELEMS(a);
    nb = ARRNELEMS(b);
    da = ARRPTR(a);
    db = ARRPTR(b);
    r = new_intArrayType(Min(na, nb));
    dr = ARRPTR(r);
 
    i = j = k = 0;
    while (i < na && j < nb)
    {
        if (da[i] < db[j])
            i++;
        else if (da[i] == db[j])
        {
            if (k == 0 || dr[k - 1] != db[j])
                dr[k++] = db[j];
            i++;
            j++;
        }
        else
            j++;
    }
 
    if (k == 0)
    {
        pfree(r);
        return new_intArrayType(0);
    }
    else
        return resize_intArrayType(r, k);
}

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 50 of file _int_tool.c.

{
    int         na,
                nb;
    int         i,
                j;
    int        *da,
               *db;
 
    na = ARRNELEMS(a);
    nb = ARRNELEMS(b);
    da = ARRPTR(a);
    db = ARRPTR(b);
 
    i = j = 0;
    while (i < na && j < nb)
    {
        if (da[i] < db[j])
            i++;
        else if (da[i] == db[j])
            return true;
        else
            j++;
    }
 
    return false;
}

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 79 of file _int_tool.c.

{
    ArrayType  *r = NULL;
 
    CHECKARRVALID(a);
    CHECKARRVALID(b);
 
    if (ARRISEMPTY(a) && ARRISEMPTY(b))
        return new_intArrayType(0);
    if (ARRISEMPTY(a))
        r = copy_intArrayType(b);
    if (ARRISEMPTY(b))
        r = copy_intArrayType(a);
 
    if (!r)
    {
        int         na = ARRNELEMS(a),
                    nb = ARRNELEMS(b);
        int        *da = ARRPTR(a),
                   *db = ARRPTR(b);
        int         i,
                    j,
                   *dr;
 
        r = new_intArrayType(na + nb);
        dr = ARRPTR(r);
 
        /* union */
        i = j = 0;
        while (i < na && j < nb)
        {
            if (da[i] == db[j])
            {
                *dr++ = da[i++];
                j++;
            }
            else if (da[i] < db[j])
                *dr++ = da[i++];
            else
                *dr++ = db[j++];
        }
 
        while (i < na)
            *dr++ = da[i++];
        while (j < nb)
            *dr++ = db[j++];
 
        r = resize_intArrayType(r, dr - ARRPTR(r));
    }
 
    if (ARRNELEMS(r) > 1)
        r = _int_unique(r);
 
    return r;
}

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 386 of file _int_tool.c.

{
    ArrayType  *result;
    int32      *aa;
 
    result = new_intArrayType(1);
    aa = ARRPTR(result);
    aa[0] = elem;
    return result;
}

References ARRPTR, and new_intArrayType().

Referenced by intset().

◆ intarray_add_elem()

ArrayType * intarray_add_elem	(	ArrayType *	a,
		int32	elem
	)

Definition at line 352 of file _int_tool.c.

{
    ArrayType  *result;
    int32      *r;
    int32       c;
 
    CHECKARRVALID(a);
    c = ARRNELEMS(a);
    result = new_intArrayType(c + 1);
    r = ARRPTR(result);
    if (c > 0)
        memcpy(r, ARRPTR(a), c * sizeof(int32));
    r[c] = elem;
    return result;
}

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 369 of file _int_tool.c.

{
    ArrayType  *result;
    int32       ac = ARRNELEMS(a);
    int32       bc = ARRNELEMS(b);
 
    CHECKARRVALID(a);
    CHECKARRVALID(b);
    result = new_intArrayType(ac + bc);
    if (ac)
        memcpy(ARRPTR(result), ARRPTR(a), ac * sizeof(int32));
    if (bc)
        memcpy(ARRPTR(result) + ac, ARRPTR(b), bc * sizeof(int32));
    return result;
}

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 336 of file _int_tool.c.

{
    int32      *aa,
                c,
                i;
 
    CHECKARRVALID(a);
    c = ARRNELEMS(a);
    aa = ARRPTR(a);
    for (i = 0; i < c; i++)
        if (aa[i] == elem)
            return (i + 1);
    return 0;
}

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

Referenced by idx().

◆ internal_size()

int internal_size	(	int *	a,
		int	len
	)

Definition at line 293 of file _int_tool.c.

{
    int         i;
    int64       size = 0;
 
    for (i = 0; i < len; i += 2)
    {
        if (!i || a[i] != a[i - 1]) /* do not count repeated range */
            size += (int64) (a[i + 1]) - (int64) (a[i]) + 1;
    }
 
    if (size > (int64) INT_MAX || size < (int64) INT_MIN)
        return -1;              /* overflow */
    return (int) size;
}

References a, i, len, and size.

Referenced by g_int_compress(), and g_int_decompress().

◆ isort()

bool isort	(	int32 *	a,
		int	len
	)

Definition at line 212 of file _int_tool.c.

{
    bool        r = false;
 
    qsort_arg(a, len, sizeof(int32), isort_cmp, &r);
    return r;
}

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

◆ new_intArrayType()

ArrayType * new_intArrayType ( int num )

Definition at line 222 of file _int_tool.c.

{
    ArrayType  *r;
    int         nbytes;
 
    /* if no elements, return a zero-dimensional array */
    if (num <= 0)
    {
        Assert(num == 0);
        r = construct_empty_array(INT4OID);
        return r;
    }
 
    nbytes = ARR_OVERHEAD_NONULLS(1) + sizeof(int) * num;
 
    r = (ArrayType *) palloc0(nbytes);
 
    SET_VARSIZE(r, nbytes);
    ARR_NDIM(r) = 1;
    r->dataoffset = 0;          /* marker for no null bitmap */
    ARR_ELEMTYPE(r) = INT4OID;
    ARR_DIMS(r)[0] = num;
    ARR_LBOUND(r)[0] = 1;
 
    return r;
}

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 397 of file _int_bool.c.

{
    if (query->size <= 0)
        return false;
    return contains_required_value(GETQUERY(query) + query->size - 1);
}

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

Referenced by ginint4_queryextract().

◆ resize_intArrayType()

ArrayType * resize_intArrayType	(	ArrayType *	a,
		int	num
	)

Definition at line 250 of file _int_tool.c.

{
    int         nbytes;
    int         i;
 
    /* if no elements, return a zero-dimensional array */
    if (num <= 0)
    {
        Assert(num == 0);
        a = construct_empty_array(INT4OID);
        return a;
    }
 
    if (num == ARRNELEMS(a))
        return a;
 
    nbytes = ARR_DATA_OFFSET(a) + sizeof(int) * num;
 
    a = (ArrayType *) repalloc(a, nbytes);
 
    SET_VARSIZE(a, nbytes);
    /* usually the array should be 1-D already, but just in case ... */
    for (i = 0; i < ARR_NDIM(a); i++)
    {
        ARR_DIMS(a)[i] = num;
        num = 1;
    }
    return a;
}

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 184 of file _int_tool.c.

{
    *size = (float) ARRNELEMS(a);
}

References a, ARRNELEMS, and size.

Referenced by g_int_penalty(), and g_int_picksplit().

◆ signconsistent()

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

Definition at line 298 of file _int_bool.c.

{
    return execute(GETQUERY(query) + query->size - 1,
                   sign, (void *) (intptr_t) siglen, calcnot,
                   checkcondition_bit);
}

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

Referenced by g_intbig_consistent().

Data Structures

Macros

Typedefs

Functions

Macro Definition Documentation

◆ ALLISTRUE

◆ ARRISEMPTY

◆ ARRNELEMS

◆ ARRPTR

◆ BooleanSearchStrategy

◆ CALCGTSIZE

◆ CHECKARRVALID

◆ CLOSE

◆ CLRBIT

◆ COMPUTESIZE

◆ DatumGetQueryTypeP

◆ DatumGetQueryTypePCopy

◆ END

◆ ERR

◆ G_INT_GET_NUMRANGES

◆ G_INT_NUMRANGES_DEFAULT

◆ G_INT_NUMRANGES_MAX

◆ GET_SIGLEN

◆ GETBIT

◆ GETBITBYTE

◆ GETBYTE

◆ GETQUERY

◆ GETSIGN

◆ GTHDRSIZE

◆ HASH

◆ HASHVAL

◆ HDRSIZEQT

◆ ISALLTRUE

◆ LOOPBYTE

◆ OPEN

◆ OPR

◆ PG_GETARG_QUERYTYPE_P

◆ PG_GETARG_QUERYTYPE_P_COPY

◆ PREPAREARR

◆ QSORT

◆ QUERYTYPEMAXITEMS

◆ SETBIT

◆ SIGLEN_DEFAULT

◆ SIGLEN_MAX

◆ SIGLENBIT

◆ SORT

◆ VAL

◆ WISH_F

Typedef Documentation

◆ BITVECP

◆ ITEM

◆ QUERYTYPE

Function Documentation

◆ _int_unique()

◆ compASC()

◆ compDESC()

◆ copy_intArrayType()

◆ execconsistent()

◆ gensign()

◆ gin_bool_consistent()

◆ inner_int_contains()

◆ inner_int_inter()

◆ inner_int_overlap()

◆ inner_int_union()

◆ int_to_intset()

◆ intarray_add_elem()

◆ intarray_concat_arrays()

◆ intarray_match_first()

◆ internal_size()

◆ isort()

◆ new_intArrayType()

◆ query_has_required_values()

◆ resize_intArrayType()

◆ rt__int_size()

◆ signconsistent()