_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)
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 *a)
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 (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)

Definition at line 26 of file _int.h.

Referenced by _int_overlap(), g_int_compress(), g_int_decompress(), g_intbig_compress(), inner_int_inter(), inner_int_union(), intarray_del_elem(), and subarray().

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

Definition at line 113 of file _int.h.

Referenced by g_int_consistent(), g_intbig_consistent(), ginint4_consistent(), and ginint4_queryextract().

CALCGTSIZE

#define CALCGTSIZE

(

flag

)

( GTHDRSIZE+(((flag) & ALLISTRUE) ? 0 : SIGLEN) )

Definition at line 84 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 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

Definition at line 140 of file _int.h.

Referenced by cclass(), element(), getcvec(), gettoken(), gettoken_query(), lacon(), lexdigits(), makepol(), miss(), newdfa(), newnfa(), pickss(), prefixes(), and range().

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

#define GETQUERY

(

x

)

( (x)->items )

Definition at line 136 of file _int.h.

Referenced by _int_matchsel(), boolop(), bqarr_in(), bqarr_out(), calc_rank(), cleanup_tsquery_stopwords(), collectTSQueryValues(), CompareTSQ(), Cover(), execconsistent(), get_docrep(), gin_bool_consistent(), gin_extract_tsquery(), gin_tsquery_consistent(), gin_tsquery_triconsistent(), ginint4_queryextract(), gist_qtxt(), gtsvector_consistent(), hlCover(), hlfinditem(), join_tsqueries(), ltxtq_exec(), ltxtq_out(), makeTSQuerySign(), mcelem_tsquery_selec(), parse_tsquery(), QTN2QT(), query_has_required_values(), queryin(), signconsistent(), SortAndUniqItems(), ts_match_vq(), tsquery_not(), tsquery_rewrite(), tsquery_rewrite_query(), tsqueryout(), tsqueryrecv(), tsquerysend(), and tsquerytree().

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)

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)

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)

Definition at line 29 of file _int.h.

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

VAL

#define VAL   2

Definition at line 141 of file _int.h.

Referenced by contains_required_value(), execute(), findoprnd(), gettoken(), gettoken_query(), gin_bool_consistent(), ginint4_queryextract(), infix(), int_query_opr_selec(), ltree_execute(), and makepol().

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

typedef char* BITVECP

Definition at line 55 of file _int.h.

ITEM

typedef struct ITEM ITEM

QUERYTYPE

typedef struct QUERYTYPE QUERYTYPE

Function Documentation

_int_unique()

ArrayType* _int_unique

(

ArrayType *

a

)

Definition at line 310 of file _int_tool.c.

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

{
    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);
}

compASC()

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

Definition at line 397 of file _int_tool.c.

{
    if (*(const int32 *) a == *(const int32 *) b)
        return 0;
    return (*(const int32 *) a > *(const int32 *) b) ? 1 : -1;
}

compDESC()

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

Definition at line 405 of file _int_tool.c.

{
    if (*(const int32 *) a == *(const int32 *) b)
        return 0;
    return (*(const int32 *) a < *(const int32 *) b) ? 1 : -1;
}

copy_intArrayType()

ArrayType* copy_intArrayType

(

ArrayType *

a

)

Definition at line 280 of file _int_tool.c.

References ARRNELEMS, ARRPTR, and new_intArrayType().

Referenced by g_int_picksplit(), and inner_int_union().

{
    ArrayType  *r;
    int         n = ARRNELEMS(a);

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

execconsistent()

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

Definition at line 309 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().

{
    CHKVAL      chkval;

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

gensign()

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

Definition at line 322 of file _int_tool.c.

References HASH, and i.

{
    int         i;

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

gin_bool_consistent()

bool gin_bool_consistent	(	QUERYTYPE *	query,
		bool *	check
	)

Definition at line 336 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().

{
    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,
                   (void *) &gcv, true,
                   checkcondition_gin);
}

inner_int_contains()

bool inner_int_contains	(	ArrayType *	a,
		ArrayType *	b
	)

Definition at line 14 of file _int_tool.c.

References ARRNELEMS, ARRPTR, i, and true.

Referenced by _int_contains(), and g_int_consistent().

{
    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) ? true : false;
}

inner_int_inter()

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

Definition at line 135 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().

{
    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);
}

inner_int_overlap()

bool inner_int_overlap	(	ArrayType *	a,
		ArrayType *	b
	)

Definition at line 49 of file _int_tool.c.

References ARRNELEMS, ARRPTR, and i.

Referenced by _int_overlap(), and g_int_consistent().

{
    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;
}

inner_int_union()

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

Definition at line 78 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().

{
    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;
}

int_to_intset()

ArrayType* int_to_intset

(

int32

elem

)

Definition at line 385 of file _int_tool.c.

References ARRPTR, and new_intArrayType().

Referenced by intset().

{
    ArrayType  *result;
    int32      *aa;

    result = new_intArrayType(1);
    aa = ARRPTR(result);
    aa[0] = n;
    return result;
}

intarray_add_elem()

ArrayType* intarray_add_elem	(	ArrayType *	a,
		int32	elem
	)

Definition at line 351 of file _int_tool.c.

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

Referenced by intarray_push_elem(), and intset_union_elem().

{
    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;
}

intarray_concat_arrays()

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

Definition at line 368 of file _int_tool.c.

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

Referenced by intarray_push_array().

{
    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;
}

intarray_match_first()

int32 intarray_match_first	(	ArrayType *	a,
		int32	elem
	)

Definition at line 335 of file _int_tool.c.

References ARRNELEMS, ARRPTR, CHECKARRVALID, and i.

Referenced by idx().

{
    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;
}

internal_size()

int internal_size	(	int *	a,
		int	len
	)

Definition at line 292 of file _int_tool.c.

References i.

Referenced by g_int_compress(), and g_int_decompress().

{
    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;
}

isort()

bool isort	(	int32 *	a,
		int	len
	)

Definition at line 211 of file _int_tool.c.

References isort_cmp(), and qsort_arg().

{
    bool        r = false;

    qsort_arg(a, len, sizeof(int32), isort_cmp, (void *) &r);
    return r;
}

new_intArrayType()

ArrayType* new_intArrayType

(

int

num

)

Definition at line 221 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().

{
    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;
}

query_has_required_values()

bool query_has_required_values

(

QUERYTYPE *

query

)

Definition at line 399 of file _int_bool.c.

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

Referenced by ginint4_queryextract().

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

resize_intArrayType()

ArrayType* resize_intArrayType	(	ArrayType *	a,
		int	num
	)

Definition at line 249 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().

{
    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;
}

rt__int_size()

void rt__int_size	(	ArrayType *	a,
		float *	size
	)

Definition at line 183 of file _int_tool.c.

References ARRNELEMS.

Referenced by g_int_penalty(), and g_int_picksplit().

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

signconsistent()

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

Definition at line 300 of file _int_bool.c.

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

Referenced by g_intbig_consistent().

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