_int_op.c File Reference

#include "postgres.h"
#include "_int.h"

Include dependency graph for _int_op.c:

Go to the source code of this file.

Functions
	PG_FUNCTION_INFO_V1 (_int_different)
	PG_FUNCTION_INFO_V1 (_int_same)
	PG_FUNCTION_INFO_V1 (_int_contains)
	PG_FUNCTION_INFO_V1 (_int_contained)
	PG_FUNCTION_INFO_V1 (_int_overlap)
	PG_FUNCTION_INFO_V1 (_int_union)
	PG_FUNCTION_INFO_V1 (_int_inter)
Datum	_int_contained (PG_FUNCTION_ARGS)
Datum	_int_contains (PG_FUNCTION_ARGS)
Datum	_int_different (PG_FUNCTION_ARGS)
Datum	_int_same (PG_FUNCTION_ARGS)
Datum	_int_overlap (PG_FUNCTION_ARGS)
Datum	_int_union (PG_FUNCTION_ARGS)
Datum	_int_inter (PG_FUNCTION_ARGS)
	PG_FUNCTION_INFO_V1 (intset)
	PG_FUNCTION_INFO_V1 (icount)
	PG_FUNCTION_INFO_V1 (sort)
	PG_FUNCTION_INFO_V1 (sort_asc)
	PG_FUNCTION_INFO_V1 (sort_desc)
	PG_FUNCTION_INFO_V1 (uniq)
	PG_FUNCTION_INFO_V1 (idx)
	PG_FUNCTION_INFO_V1 (subarray)
	PG_FUNCTION_INFO_V1 (intarray_push_elem)
	PG_FUNCTION_INFO_V1 (intarray_push_array)
	PG_FUNCTION_INFO_V1 (intarray_del_elem)
	PG_FUNCTION_INFO_V1 (intset_union_elem)
	PG_FUNCTION_INFO_V1 (intset_subtract)
Datum	intset (PG_FUNCTION_ARGS)
Datum	icount (PG_FUNCTION_ARGS)
Datum	sort (PG_FUNCTION_ARGS)
Datum	sort_asc (PG_FUNCTION_ARGS)
Datum	sort_desc (PG_FUNCTION_ARGS)
Datum	uniq (PG_FUNCTION_ARGS)
Datum	idx (PG_FUNCTION_ARGS)
Datum	subarray (PG_FUNCTION_ARGS)
Datum	intarray_push_elem (PG_FUNCTION_ARGS)
Datum	intarray_push_array (PG_FUNCTION_ARGS)
Datum	intarray_del_elem (PG_FUNCTION_ARGS)
Datum	intset_union_elem (PG_FUNCTION_ARGS)
Datum	intset_subtract (PG_FUNCTION_ARGS)

Variables
	PG_MODULE_MAGIC

Function Documentation

_int_contained()

Datum _int_contained

(

PG_FUNCTION_ARGS

)

Definition at line 19 of file _int_op.c.

{
    /* just reverse the operands and call _int_contains */
    return DirectFunctionCall2(_int_contains,
                               PG_GETARG_DATUM(1),
                               PG_GETARG_DATUM(0));
}

References _int_contains(), DirectFunctionCall2, and PG_GETARG_DATUM.

_int_contains()

Datum _int_contains

(

PG_FUNCTION_ARGS

)

Definition at line 28 of file _int_op.c.

{
    /* Force copy so we can modify the arrays in-place */
    ArrayType  *a = PG_GETARG_ARRAYTYPE_P_COPY(0);
    ArrayType  *b = PG_GETARG_ARRAYTYPE_P_COPY(1);
    bool        res;
 
    CHECKARRVALID(a);
    CHECKARRVALID(b);
    PREPAREARR(a);
    PREPAREARR(b);
    res = inner_int_contains(a, b);
    pfree(a);
    pfree(b);
    PG_RETURN_BOOL(res);
}

References a, b, CHECKARRVALID, inner_int_contains(), pfree(), PG_GETARG_ARRAYTYPE_P_COPY, PG_RETURN_BOOL, PREPAREARR, and res.

Referenced by _int_contained().

_int_different()

Datum _int_different

(

PG_FUNCTION_ARGS

)

Definition at line 46 of file _int_op.c.

{
    PG_RETURN_BOOL(!DatumGetBool(DirectFunctionCall2(_int_same,
                                                     PointerGetDatum(PG_GETARG_POINTER(0)),
                                                     PointerGetDatum(PG_GETARG_POINTER(1)))));
}

References _int_same(), DatumGetBool(), DirectFunctionCall2, PG_GETARG_POINTER, PG_RETURN_BOOL, and PointerGetDatum().

_int_inter()

Datum _int_inter

(

PG_FUNCTION_ARGS

)

Definition at line 143 of file _int_op.c.

{
    ArrayType  *a = PG_GETARG_ARRAYTYPE_P_COPY(0);
    ArrayType  *b = PG_GETARG_ARRAYTYPE_P_COPY(1);
    ArrayType  *result;
 
    CHECKARRVALID(a);
    CHECKARRVALID(b);
 
    SORT(a);
    SORT(b);
 
    result = inner_int_inter(a, b);
 
    pfree(a);
    pfree(b);
 
    PG_RETURN_POINTER(result);
}

References a, b, CHECKARRVALID, inner_int_inter(), pfree(), PG_GETARG_ARRAYTYPE_P_COPY, PG_RETURN_POINTER, and SORT.

_int_overlap()

Datum _int_overlap

(

PG_FUNCTION_ARGS

)

Definition at line 99 of file _int_op.c.

{
    ArrayType  *a = PG_GETARG_ARRAYTYPE_P_COPY(0);
    ArrayType  *b = PG_GETARG_ARRAYTYPE_P_COPY(1);
    bool        result;
 
    CHECKARRVALID(a);
    CHECKARRVALID(b);
    if (ARRISEMPTY(a) || ARRISEMPTY(b))
        return false;
 
    SORT(a);
    SORT(b);
 
    result = inner_int_overlap(a, b);
 
    pfree(a);
    pfree(b);
 
    PG_RETURN_BOOL(result);
}

References a, ARRISEMPTY, b, CHECKARRVALID, inner_int_overlap(), pfree(), PG_GETARG_ARRAYTYPE_P_COPY, PG_RETURN_BOOL, and SORT.

_int_same()

Datum _int_same

(

PG_FUNCTION_ARGS

)

Definition at line 54 of file _int_op.c.

{
    ArrayType  *a = PG_GETARG_ARRAYTYPE_P_COPY(0);
    ArrayType  *b = PG_GETARG_ARRAYTYPE_P_COPY(1);
    int         na,
                nb;
    int         n;
    int        *da,
               *db;
    bool        result;
 
    CHECKARRVALID(a);
    CHECKARRVALID(b);
    na = ARRNELEMS(a);
    nb = ARRNELEMS(b);
    da = ARRPTR(a);
    db = ARRPTR(b);
 
    result = false;
 
    if (na == nb)
    {
        SORT(a);
        SORT(b);
        result = true;
 
        for (n = 0; n < na; n++)
        {
            if (da[n] != db[n])
            {
                result = false;
                break;
            }
        }
    }
 
    pfree(a);
    pfree(b);
 
    PG_RETURN_BOOL(result);
}

References a, ARRNELEMS, ARRPTR, b, CHECKARRVALID, pfree(), PG_GETARG_ARRAYTYPE_P_COPY, PG_RETURN_BOOL, and SORT.

Referenced by _int_different().

_int_union()

Datum _int_union

(

PG_FUNCTION_ARGS

)

Definition at line 122 of file _int_op.c.

{
    ArrayType  *a = PG_GETARG_ARRAYTYPE_P_COPY(0);
    ArrayType  *b = PG_GETARG_ARRAYTYPE_P_COPY(1);
    ArrayType  *result;
 
    CHECKARRVALID(a);
    CHECKARRVALID(b);
 
    SORT(a);
    SORT(b);
 
    result = inner_int_union(a, b);
 
    pfree(a);
    pfree(b);
 
    PG_RETURN_POINTER(result);
}

References a, b, CHECKARRVALID, inner_int_union(), pfree(), PG_GETARG_ARRAYTYPE_P_COPY, PG_RETURN_POINTER, and SORT.

icount()

Datum icount

(

PG_FUNCTION_ARGS

)

Definition at line 185 of file _int_op.c.

{
    ArrayType  *a = PG_GETARG_ARRAYTYPE_P(0);
    int32       count = ARRNELEMS(a);
 
    PG_FREE_IF_COPY(a, 0);
    PG_RETURN_INT32(count);
}

References a, ARRNELEMS, PG_FREE_IF_COPY, PG_GETARG_ARRAYTYPE_P, and PG_RETURN_INT32.

idx()

Datum idx

(

PG_FUNCTION_ARGS

)

Definition at line 259 of file _int_op.c.

{
    ArrayType  *a = PG_GETARG_ARRAYTYPE_P(0);
    int32       result;
 
    CHECKARRVALID(a);
    result = ARRNELEMS(a);
    if (result)
        result = intarray_match_first(a, PG_GETARG_INT32(1));
    PG_FREE_IF_COPY(a, 0);
    PG_RETURN_INT32(result);
}

References a, ARRNELEMS, CHECKARRVALID, intarray_match_first(), PG_FREE_IF_COPY, PG_GETARG_ARRAYTYPE_P, PG_GETARG_INT32, and PG_RETURN_INT32.

Referenced by aclexplode(), AllocSetFreeIndex(), appendStringInfoRegexpSubstr(), array_subscript_transform(), AttachPartitionEnsureIndexes(), avlCollectFields(), brin_minmax_multi_summary_out(), brin_revmap_data(), build_expr_data(), build_sorted_items(), cube_subset(), dependencies_clauselist_selectivity(), DetachPartitionFinalize(), do_set_block_offsets(), estimate_multivariate_ndistinct(), ExecHashIncreaseNumBatches(), ExecHashIncreaseNumBuckets(), ExecParallelHashIncreaseNumBuckets(), ExecParallelHashRepartitionFirst(), fill_expanded_ranges(), GetXLogBuffer(), hstore_contains(), hstore_defined(), hstore_exists(), hstore_exists_all(), hstore_exists_any(), hstore_fetchval(), hstore_populate_record(), hstore_slice_to_array(), hstore_slice_to_hstore(), hstore_subscript_fetch(), indexOfColumn(), jsonb_delete_idx(), jsonb_subscript_transform(), lazy_cleanup_all_indexes(), lazy_vacuum_all_indexes(), Lookahead(), make_build_data(), mcv_get_match_bitmap(), mcv_match_expression(), merge_overlapping_ranges(), multirange_bsearch_match(), parallel_vacuum_process_safe_indexes(), percentile_cont_multi_final_common(), percentile_disc_multi_final(), pg_get_wait_events(), pg_mb_radix_conv(), pg_nextoid(), pg_stat_get_db_numbackends(), pgoutput_row_filter_init(), pgstat_fetch_replslot(), pgstat_get_local_beentry_by_index(), pgstat_replslot_from_serialized_name_cb(), PLy_result_item(), PLySequence_ToComposite(), printCrosstab(), range_gist_double_sorting_split(), range_gist_single_sorting_split(), ReindexRelationConcurrently(), ResourceOwnerAddToHash(), ResourceOwnerForget(), ResourceOwnerReleaseAll(), ResourceOwnerRemember(), ResourceOwnerSort(), ri_ReportViolation(), RT_ADD_CHILD_256(), RT_ADD_CHILD_48(), RT_GROW_NODE_16(), RT_NODE_256_IS_CHUNK_USED(), RT_NODE_4_GET_INSERTPOS(), RT_VERIFY_NODE(), s_init_lock_sema(), setPathArray(), stat_find_expression(), statext_expressions_load(), store_expanded_ranges(), tbm_prepare_shared_iterate(), test_pattern(), TidStoreSetBlockOffsets(), transformContainerSubscripts(), update_relstats_all_indexes(), and WALReadFromBuffers().

intarray_del_elem()

Datum intarray_del_elem

(

PG_FUNCTION_ARGS

)

Definition at line 347 of file _int_op.c.

{
    ArrayType  *a = PG_GETARG_ARRAYTYPE_P_COPY(0);
    int32       elem = PG_GETARG_INT32(1);
    int32       c;
    int32      *aa;
    int32       n = 0,
                i;
 
    CHECKARRVALID(a);
    if (!ARRISEMPTY(a))
    {
        c = ARRNELEMS(a);
        aa = ARRPTR(a);
        for (i = 0; i < c; i++)
        {
            if (aa[i] != elem)
            {
                if (i > n)
                    aa[n++] = aa[i];
                else
                    n++;
            }
        }
        a = resize_intArrayType(a, n);
    }
    PG_RETURN_POINTER(a);
}

References a, ARRISEMPTY, ARRNELEMS, ARRPTR, CHECKARRVALID, i, PG_GETARG_ARRAYTYPE_P_COPY, PG_GETARG_INT32, PG_RETURN_POINTER, and resize_intArrayType().

intarray_push_array()

Datum intarray_push_array

(

PG_FUNCTION_ARGS

)

Definition at line 334 of file _int_op.c.

{
    ArrayType  *a = PG_GETARG_ARRAYTYPE_P(0);
    ArrayType  *b = PG_GETARG_ARRAYTYPE_P(1);
    ArrayType  *result;
 
    result = intarray_concat_arrays(a, b);
    PG_FREE_IF_COPY(a, 0);
    PG_FREE_IF_COPY(b, 1);
    PG_RETURN_POINTER(result);
}

References a, b, intarray_concat_arrays(), PG_FREE_IF_COPY, PG_GETARG_ARRAYTYPE_P, and PG_RETURN_POINTER.

intarray_push_elem()

Datum intarray_push_elem

(

PG_FUNCTION_ARGS

)

Definition at line 323 of file _int_op.c.

{
    ArrayType  *a = PG_GETARG_ARRAYTYPE_P(0);
    ArrayType  *result;
 
    result = intarray_add_elem(a, PG_GETARG_INT32(1));
    PG_FREE_IF_COPY(a, 0);
    PG_RETURN_POINTER(result);
}

References a, intarray_add_elem(), PG_FREE_IF_COPY, PG_GETARG_ARRAYTYPE_P, PG_GETARG_INT32, and PG_RETURN_POINTER.

intset()

Datum intset

(

PG_FUNCTION_ARGS

)

Definition at line 179 of file _int_op.c.

{
    PG_RETURN_POINTER(int_to_intset(PG_GETARG_INT32(0)));
}

References int_to_intset(), PG_GETARG_INT32, and PG_RETURN_POINTER.

Referenced by check_with_filler(), intset_add_member(), intset_begin_iterate(), intset_create(), intset_flush_buffered_values(), intset_is_member(), intset_iterate_next(), intset_memory_usage(), intset_new_internal_node(), intset_new_leaf_node(), intset_num_entries(), intset_update_upper(), test_empty(), test_huge_distances(), test_pattern(), test_single_value(), and test_single_value_and_filler().

intset_subtract()

Datum intset_subtract

(

PG_FUNCTION_ARGS

)

Definition at line 389 of file _int_op.c.

{
    ArrayType  *a = PG_GETARG_ARRAYTYPE_P_COPY(0);
    ArrayType  *b = PG_GETARG_ARRAYTYPE_P_COPY(1);
    ArrayType  *result;
    int32       ca;
    int32       cb;
    int32      *aa,
               *bb,
               *r;
    int32       n = 0,
                i = 0,
                k = 0;
 
    CHECKARRVALID(a);
    CHECKARRVALID(b);
 
    QSORT(a, 1);
    a = _int_unique(a);
    ca = ARRNELEMS(a);
    QSORT(b, 1);
    b = _int_unique(b);
    cb = ARRNELEMS(b);
    result = new_intArrayType(ca);
    aa = ARRPTR(a);
    bb = ARRPTR(b);
    r = ARRPTR(result);
    while (i < ca)
    {
        if (k == cb || aa[i] < bb[k])
            r[n++] = aa[i++];
        else if (aa[i] == bb[k])
        {
            i++;
            k++;
        }
        else
            k++;
    }
    result = resize_intArrayType(result, n);
    pfree(a);
    pfree(b);
    PG_RETURN_POINTER(result);
}

References _int_unique(), a, ARRNELEMS, ARRPTR, b, CHECKARRVALID, i, new_intArrayType(), pfree(), PG_GETARG_ARRAYTYPE_P_COPY, PG_RETURN_POINTER, QSORT, and resize_intArrayType().

intset_union_elem()

Datum intset_union_elem

(

PG_FUNCTION_ARGS

)

Definition at line 377 of file _int_op.c.

{
    ArrayType  *a = PG_GETARG_ARRAYTYPE_P(0);
    ArrayType  *result;
 
    result = intarray_add_elem(a, PG_GETARG_INT32(1));
    PG_FREE_IF_COPY(a, 0);
    QSORT(result, 1);
    PG_RETURN_POINTER(_int_unique(result));
}

References _int_unique(), a, intarray_add_elem(), PG_FREE_IF_COPY, PG_GETARG_ARRAYTYPE_P, PG_GETARG_INT32, PG_RETURN_POINTER, and QSORT.

PG_FUNCTION_INFO_V1() [1/20]

PG_FUNCTION_INFO_V1

(

_int_contained

)

PG_FUNCTION_INFO_V1() [2/20]

PG_FUNCTION_INFO_V1

(

_int_contains

)

PG_FUNCTION_INFO_V1() [3/20]

PG_FUNCTION_INFO_V1

(

_int_different

)

PG_FUNCTION_INFO_V1() [4/20]

PG_FUNCTION_INFO_V1

(

_int_inter

)

PG_FUNCTION_INFO_V1() [5/20]

PG_FUNCTION_INFO_V1

(

_int_overlap

)

PG_FUNCTION_INFO_V1() [6/20]

PG_FUNCTION_INFO_V1

(

_int_same

)

PG_FUNCTION_INFO_V1() [7/20]

PG_FUNCTION_INFO_V1

(

_int_union

)

PG_FUNCTION_INFO_V1() [8/20]

PG_FUNCTION_INFO_V1

(

icount

)

PG_FUNCTION_INFO_V1() [9/20]

PG_FUNCTION_INFO_V1

(

idx

)

PG_FUNCTION_INFO_V1() [10/20]

PG_FUNCTION_INFO_V1

(

intarray_del_elem

)

PG_FUNCTION_INFO_V1() [11/20]

PG_FUNCTION_INFO_V1

(

intarray_push_array

)

PG_FUNCTION_INFO_V1() [12/20]

PG_FUNCTION_INFO_V1

(

intarray_push_elem

)

PG_FUNCTION_INFO_V1() [13/20]

PG_FUNCTION_INFO_V1

(

intset

)

PG_FUNCTION_INFO_V1() [14/20]

PG_FUNCTION_INFO_V1

(

intset_subtract

)

PG_FUNCTION_INFO_V1() [15/20]

PG_FUNCTION_INFO_V1

(

intset_union_elem

)

PG_FUNCTION_INFO_V1() [16/20]

PG_FUNCTION_INFO_V1

(

sort

)

PG_FUNCTION_INFO_V1() [17/20]

PG_FUNCTION_INFO_V1

(

sort_asc

)

PG_FUNCTION_INFO_V1() [18/20]

PG_FUNCTION_INFO_V1

(

sort_desc

)

PG_FUNCTION_INFO_V1() [19/20]

PG_FUNCTION_INFO_V1

(

subarray

)

PG_FUNCTION_INFO_V1() [20/20]

PG_FUNCTION_INFO_V1

(

uniq

)

sort()

Datum sort

(

PG_FUNCTION_ARGS

)

Definition at line 195 of file _int_op.c.

{
    ArrayType  *a = PG_GETARG_ARRAYTYPE_P_COPY(0);
    text       *dirstr = (fcinfo->nargs == 2) ? PG_GETARG_TEXT_PP(1) : NULL;
    int32       dc = (dirstr) ? VARSIZE_ANY_EXHDR(dirstr) : 0;
    char       *d = (dirstr) ? VARDATA_ANY(dirstr) : NULL;
    int         dir = -1;
 
    CHECKARRVALID(a);
    if (ARRNELEMS(a) < 2)
        PG_RETURN_POINTER(a);
 
    if (dirstr == NULL || (dc == 3
                           && (d[0] == 'A' || d[0] == 'a')
                           && (d[1] == 'S' || d[1] == 's')
                           && (d[2] == 'C' || d[2] == 'c')))
        dir = 1;
    else if (dc == 4
             && (d[0] == 'D' || d[0] == 'd')
             && (d[1] == 'E' || d[1] == 'e')
             && (d[2] == 'S' || d[2] == 's')
             && (d[3] == 'C' || d[3] == 'c'))
        dir = 0;
    if (dir == -1)
        ereport(ERROR,
                (errcode(ERRCODE_INVALID_PARAMETER_VALUE),
                 errmsg("second parameter must be \"ASC\" or \"DESC\"")));
    QSORT(a, dir);
    PG_RETURN_POINTER(a);
}

References a, ARRNELEMS, CHECKARRVALID, ereport, errcode(), errmsg(), ERROR, PG_GETARG_ARRAYTYPE_P_COPY, PG_GETARG_TEXT_PP, PG_RETURN_POINTER, QSORT, VARDATA_ANY, and VARSIZE_ANY_EXHDR.

Referenced by create_append_plan(), create_incremental_sort_path(), create_merge_append_plan(), create_mergejoin_plan(), and create_unique_plan().

sort_asc()

Datum sort_asc

(

PG_FUNCTION_ARGS

)

Definition at line 227 of file _int_op.c.

{
    ArrayType  *a = PG_GETARG_ARRAYTYPE_P_COPY(0);
 
    CHECKARRVALID(a);
    QSORT(a, 1);
    PG_RETURN_POINTER(a);
}

References a, CHECKARRVALID, PG_GETARG_ARRAYTYPE_P_COPY, PG_RETURN_POINTER, and QSORT.

sort_desc()

Datum sort_desc

(

PG_FUNCTION_ARGS

)

Definition at line 237 of file _int_op.c.

{
    ArrayType  *a = PG_GETARG_ARRAYTYPE_P_COPY(0);
 
    CHECKARRVALID(a);
    QSORT(a, 0);
    PG_RETURN_POINTER(a);
}

References a, CHECKARRVALID, PG_GETARG_ARRAYTYPE_P_COPY, PG_RETURN_POINTER, and QSORT.

subarray()

Datum subarray

(

PG_FUNCTION_ARGS

)

Definition at line 273 of file _int_op.c.

{
    ArrayType  *a = PG_GETARG_ARRAYTYPE_P(0);
    int32       start = PG_GETARG_INT32(1);
    int32       len = (fcinfo->nargs == 3) ? PG_GETARG_INT32(2) : 0;
    int32       end = 0;
    int32       c;
    ArrayType  *result;
 
    start = (start > 0) ? start - 1 : start;
 
    CHECKARRVALID(a);
    if (ARRISEMPTY(a))
    {
        PG_FREE_IF_COPY(a, 0);
        PG_RETURN_POINTER(new_intArrayType(0));
    }
 
    c = ARRNELEMS(a);
 
    if (start < 0)
        start = c + start;
 
    if (len < 0)
        end = c + len;
    else if (len == 0)
        end = c;
    else
        end = start + len;
 
    if (end > c)
        end = c;
 
    if (start < 0)
        start = 0;
 
    if (start >= end || end <= 0)
    {
        PG_FREE_IF_COPY(a, 0);
        PG_RETURN_POINTER(new_intArrayType(0));
    }
 
    result = new_intArrayType(end - start);
    if (end - start > 0)
        memcpy(ARRPTR(result), ARRPTR(a) + start, (end - start) * sizeof(int32));
    PG_FREE_IF_COPY(a, 0);
    PG_RETURN_POINTER(result);
}

References a, ARRISEMPTY, ARRNELEMS, ARRPTR, CHECKARRVALID, len, new_intArrayType(), PG_FREE_IF_COPY, PG_GETARG_ARRAYTYPE_P, PG_GETARG_INT32, PG_RETURN_POINTER, and start.

uniq()

Datum uniq

(

PG_FUNCTION_ARGS

)

Definition at line 247 of file _int_op.c.

{
    ArrayType  *a = PG_GETARG_ARRAYTYPE_P_COPY(0);
 
    CHECKARRVALID(a);
    if (ARRNELEMS(a) < 2)
        PG_RETURN_POINTER(a);
    a = _int_unique(a);
    PG_RETURN_POINTER(a);
}

References _int_unique(), a, ARRNELEMS, CHECKARRVALID, PG_GETARG_ARRAYTYPE_P_COPY, and PG_RETURN_POINTER.

Variable Documentation

PG_MODULE_MAGIC

PG_MODULE_MAGIC

Definition at line 8 of file _int_op.c.