ltree_op.c File Reference

#include "postgres.h"
#include <ctype.h>
#include "access/htup_details.h"
#include "catalog/pg_statistic.h"
#include "common/hashfn.h"
#include "ltree.h"
#include "utils/builtins.h"
#include "utils/lsyscache.h"
#include "utils/selfuncs.h"

Include dependency graph for ltree_op.c:

Go to the source code of this file.

Macros
#define	RUNCMP

Functions
	PG_FUNCTION_INFO_V1 (ltree_cmp)
	PG_FUNCTION_INFO_V1 (ltree_lt)
	PG_FUNCTION_INFO_V1 (ltree_le)
	PG_FUNCTION_INFO_V1 (ltree_eq)
	PG_FUNCTION_INFO_V1 (ltree_ne)
	PG_FUNCTION_INFO_V1 (ltree_ge)
	PG_FUNCTION_INFO_V1 (ltree_gt)
	PG_FUNCTION_INFO_V1 (hash_ltree)
	PG_FUNCTION_INFO_V1 (hash_ltree_extended)
	PG_FUNCTION_INFO_V1 (nlevel)
	PG_FUNCTION_INFO_V1 (ltree_isparent)
	PG_FUNCTION_INFO_V1 (ltree_risparent)
	PG_FUNCTION_INFO_V1 (subltree)
	PG_FUNCTION_INFO_V1 (subpath)
	PG_FUNCTION_INFO_V1 (ltree_index)
	PG_FUNCTION_INFO_V1 (ltree_addltree)
	PG_FUNCTION_INFO_V1 (ltree_addtext)
	PG_FUNCTION_INFO_V1 (ltree_textadd)
	PG_FUNCTION_INFO_V1 (lca)
	PG_FUNCTION_INFO_V1 (ltree2text)
	PG_FUNCTION_INFO_V1 (text2ltree)
	PG_FUNCTION_INFO_V1 (ltreeparentsel)
int	ltree_compare (const ltree *a, const ltree *b)
Datum	ltree_cmp (PG_FUNCTION_ARGS)
Datum	ltree_lt (PG_FUNCTION_ARGS)
Datum	ltree_le (PG_FUNCTION_ARGS)
Datum	ltree_eq (PG_FUNCTION_ARGS)
Datum	ltree_ge (PG_FUNCTION_ARGS)
Datum	ltree_gt (PG_FUNCTION_ARGS)
Datum	ltree_ne (PG_FUNCTION_ARGS)
Datum	hash_ltree (PG_FUNCTION_ARGS)
Datum	hash_ltree_extended (PG_FUNCTION_ARGS)
Datum	nlevel (PG_FUNCTION_ARGS)
bool	inner_isparent (const ltree *c, const ltree *p)
Datum	ltree_isparent (PG_FUNCTION_ARGS)
Datum	ltree_risparent (PG_FUNCTION_ARGS)
static ltree *	inner_subltree (ltree *t, int32 startpos, int32 endpos)
Datum	subltree (PG_FUNCTION_ARGS)
Datum	subpath (PG_FUNCTION_ARGS)
static ltree *	ltree_concat (ltree *a, ltree *b)
Datum	ltree_addltree (PG_FUNCTION_ARGS)
Datum	ltree_addtext (PG_FUNCTION_ARGS)
Datum	ltree_index (PG_FUNCTION_ARGS)
Datum	ltree_textadd (PG_FUNCTION_ARGS)
ltree *	lca_inner (ltree **a, int len)
Datum	lca (PG_FUNCTION_ARGS)
Datum	text2ltree (PG_FUNCTION_ARGS)
Datum	ltree2text (PG_FUNCTION_ARGS)
Datum	ltreeparentsel (PG_FUNCTION_ARGS)

Variables
	PG_MODULE_MAGIC

Macro Definition Documentation

RUNCMP

#define RUNCMP

Value:

ltree *a = PG_GETARG_LTREE_P(0);    \
ltree *b = PG_GETARG_LTREE_P(1);    \
int res = ltree_compare(a,b);       \
PG_FREE_IF_COPY(a,0);               \
PG_FREE_IF_COPY(b,1)

Definition at line 79 of file ltree_op.c.

Function Documentation

hash_ltree()

Datum hash_ltree

(

PG_FUNCTION_ARGS

)

Definition at line 137 of file ltree_op.c.

{
    ltree      *a = PG_GETARG_LTREE_P(0);
    uint32      result = 1;
    int         an = a->numlevel;
    ltree_level *al = LTREE_FIRST(a);
 
    while (an > 0)
    {
        uint32      levelHash = DatumGetUInt32(hash_any((unsigned char *) al->name, al->len));
 
        /*
         * Combine hash values of successive elements by multiplying the
         * current value by 31 and adding on the new element's hash value.
         *
         * This method is borrowed from hash_array(), which see for further
         * commentary.
         */
        result = (result << 5) - result + levelHash;
 
        an--;
        al = LEVEL_NEXT(al);
    }
 
    PG_FREE_IF_COPY(a, 0);
    PG_RETURN_UINT32(result);
}

References a, DatumGetUInt32(), hash_any(), ltree_level::len, LEVEL_NEXT, LTREE_FIRST, ltree_level::name, PG_FREE_IF_COPY, PG_GETARG_LTREE_P, and PG_RETURN_UINT32.

hash_ltree_extended()

Datum hash_ltree_extended

(

PG_FUNCTION_ARGS

)

Definition at line 167 of file ltree_op.c.

{
    ltree      *a = PG_GETARG_LTREE_P(0);
    const uint64 seed = PG_GETARG_INT64(1);
    uint64      result = 1;
    int         an = a->numlevel;
    ltree_level *al = LTREE_FIRST(a);
 
    /*
     * If the path has length zero, return 1 + seed to ensure that the low 32
     * bits of the result match hash_ltree when the seed is 0, as required by
     * the hash index support functions, but to also return a different value
     * when there is a seed.
     */
    if (an == 0)
    {
        PG_FREE_IF_COPY(a, 0);
        PG_RETURN_UINT64(result + seed);
    }
 
    while (an > 0)
    {
        uint64      levelHash = DatumGetUInt64(hash_any_extended((unsigned char *) al->name, al->len, seed));
 
        result = (result << 5) - result + levelHash;
 
        an--;
        al = LEVEL_NEXT(al);
    }
 
    PG_FREE_IF_COPY(a, 0);
    PG_RETURN_UINT64(result);
}

References a, DatumGetUInt64(), hash_any_extended(), ltree_level::len, LEVEL_NEXT, LTREE_FIRST, ltree_level::name, PG_FREE_IF_COPY, PG_GETARG_INT64, PG_GETARG_LTREE_P, and PG_RETURN_UINT64.

inner_isparent()

bool inner_isparent	(	const ltree *	c,
		const ltree *	p
	)

Definition at line 212 of file ltree_op.c.

{
    ltree_level *cl = LTREE_FIRST(c);
    ltree_level *pl = LTREE_FIRST(p);
    int         pn = p->numlevel;
 
    if (pn > c->numlevel)
        return false;
 
    while (pn > 0)
    {
        if (cl->len != pl->len)
            return false;
        if (memcmp(cl->name, pl->name, cl->len) != 0)
            return false;
 
        pn--;
        cl = LEVEL_NEXT(cl);
        pl = LEVEL_NEXT(pl);
    }
    return true;
}

References ltree_level::len, LEVEL_NEXT, LTREE_FIRST, ltree_level::name, and ltree::numlevel.

Referenced by ltree_consistent(), ltree_isparent(), and ltree_risparent().

inner_subltree()

static ltree* inner_subltree ( ltree *  t, int32  startpos, int32  endpos  )

static

Definition at line 261 of file ltree_op.c.

{
    char       *start = NULL,
               *end = NULL;
    ltree_level *ptr = LTREE_FIRST(t);
    ltree      *res;
    int         i;
 
    if (startpos < 0 || endpos < 0 || startpos >= t->numlevel || startpos > endpos)
        ereport(ERROR,
                (errcode(ERRCODE_INVALID_PARAMETER_VALUE),
                 errmsg("invalid positions")));
 
    if (endpos > t->numlevel)
        endpos = t->numlevel;
 
    start = end = (char *) ptr;
    for (i = 0; i < endpos; i++)
    {
        if (i == startpos)
            start = (char *) ptr;
        if (i == endpos - 1)
        {
            end = (char *) LEVEL_NEXT(ptr);
            break;
        }
        ptr = LEVEL_NEXT(ptr);
    }
 
    res = (ltree *) palloc0(LTREE_HDRSIZE + (end - start));
    SET_VARSIZE(res, LTREE_HDRSIZE + (end - start));
    res->numlevel = endpos - startpos;
 
    memcpy(LTREE_FIRST(res), start, end - start);
 
    return res;
}

References endpos, ereport, errcode(), errmsg(), ERROR, i, LEVEL_NEXT, LTREE_FIRST, LTREE_HDRSIZE, ltree::numlevel, palloc0(), res, SET_VARSIZE, start, and startpos.

Referenced by subltree(), and subpath().

lca()

Datum lca

(

PG_FUNCTION_ARGS

)

Definition at line 570 of file ltree_op.c.

{
    int         i;
    ltree     **a,
               *res;
 
    a = (ltree **) palloc(sizeof(ltree *) * fcinfo->nargs);
    for (i = 0; i < fcinfo->nargs; i++)
        a[i] = PG_GETARG_LTREE_P(i);
    res = lca_inner(a, (int) fcinfo->nargs);
    for (i = 0; i < fcinfo->nargs; i++)
        PG_FREE_IF_COPY(a[i], i);
    pfree(a);
 
    if (res)
        PG_RETURN_POINTER(res);
    else
        PG_RETURN_NULL();
}

References a, i, lca_inner(), palloc(), pfree(), PG_FREE_IF_COPY, PG_GETARG_LTREE_P, PG_RETURN_NULL, PG_RETURN_POINTER, and res.

Referenced by cmp_list_len_contents_asc(), fix_indexqual_clause(), mbms_add_members(), mbms_int_members(), mbms_overlap_sets(), and set_plan_refs().

lca_inner()

ltree* lca_inner	(	ltree **	a,
		int	len
	)

Definition at line 495 of file ltree_op.c.

{
    int         tmp,
                num,
                i,
                reslen;
    ltree     **ptr;
    ltree_level *l1,
               *l2;
    ltree      *res;
 
    if (len <= 0)
        return NULL;            /* no inputs? */
    if ((*a)->numlevel == 0)
        return NULL;            /* any empty input means NULL result */
 
    /* num is the length of the longest common ancestor so far */
    num = (*a)->numlevel - 1;
 
    /* Compare each additional input to *a */
    ptr = a + 1;
    while (ptr - a < len)
    {
        if ((*ptr)->numlevel == 0)
            return NULL;
        else if ((*ptr)->numlevel == 1)
            num = 0;
        else
        {
            l1 = LTREE_FIRST(*a);
            l2 = LTREE_FIRST(*ptr);
            tmp = Min(num, (*ptr)->numlevel - 1);
            num = 0;
            for (i = 0; i < tmp; i++)
            {
                if (l1->len == l2->len &&
                    memcmp(l1->name, l2->name, l1->len) == 0)
                    num = i + 1;
                else
                    break;
                l1 = LEVEL_NEXT(l1);
                l2 = LEVEL_NEXT(l2);
            }
        }
        ptr++;
    }
 
    /* Now compute size of result ... */
    reslen = LTREE_HDRSIZE;
    l1 = LTREE_FIRST(*a);
    for (i = 0; i < num; i++)
    {
        reslen += MAXALIGN(l1->len + LEVEL_HDRSIZE);
        l1 = LEVEL_NEXT(l1);
    }
 
    /* ... and construct it by copying from *a */
    res = (ltree *) palloc0(reslen);
    SET_VARSIZE(res, reslen);
    res->numlevel = num;
 
    l1 = LTREE_FIRST(*a);
    l2 = LTREE_FIRST(res);
 
    for (i = 0; i < num; i++)
    {
        memcpy(l2, l1, MAXALIGN(l1->len + LEVEL_HDRSIZE));
        l1 = LEVEL_NEXT(l1);
        l2 = LEVEL_NEXT(l2);
    }
 
    return res;
}

References a, i, ltree_level::len, len, LEVEL_HDRSIZE, LEVEL_NEXT, LTREE_FIRST, LTREE_HDRSIZE, MAXALIGN, Min, ltree_level::name, palloc0(), res, and SET_VARSIZE.

Referenced by _lca(), and lca().

ltree2text()

Datum ltree2text

(

PG_FUNCTION_ARGS

)

Definition at line 608 of file ltree_op.c.

{
    ltree      *in = PG_GETARG_LTREE_P(0);
    char       *ptr;
    int         i;
    ltree_level *curlevel;
    text       *out;
 
    out = (text *) palloc(VARSIZE(in) + VARHDRSZ);
    ptr = VARDATA(out);
    curlevel = LTREE_FIRST(in);
    for (i = 0; i < in->numlevel; i++)
    {
        if (i != 0)
        {
            *ptr = '.';
            ptr++;
        }
        memcpy(ptr, curlevel->name, curlevel->len);
        ptr += curlevel->len;
        curlevel = LEVEL_NEXT(curlevel);
    }
 
    SET_VARSIZE(out, ptr - ((char *) out));
    PG_FREE_IF_COPY(in, 0);
 
    PG_RETURN_POINTER(out);
}

References i, ltree_level::len, LEVEL_NEXT, LTREE_FIRST, ltree_level::name, ltree::numlevel, palloc(), PG_FREE_IF_COPY, PG_GETARG_LTREE_P, PG_RETURN_POINTER, SET_VARSIZE, VARDATA, VARHDRSZ, and VARSIZE.

ltree_addltree()

Datum ltree_addltree

(

PG_FUNCTION_ARGS

)

Definition at line 366 of file ltree_op.c.

{
    ltree      *a = PG_GETARG_LTREE_P(0);
    ltree      *b = PG_GETARG_LTREE_P(1);
    ltree      *r;
 
    r = ltree_concat(a, b);
    PG_FREE_IF_COPY(a, 0);
    PG_FREE_IF_COPY(b, 1);
    PG_RETURN_POINTER(r);
}

References a, b, ltree_concat(), PG_FREE_IF_COPY, PG_GETARG_LTREE_P, and PG_RETURN_POINTER.

ltree_addtext()

Datum ltree_addtext

(

PG_FUNCTION_ARGS

)

Definition at line 379 of file ltree_op.c.

{
    ltree      *a = PG_GETARG_LTREE_P(0);
    text       *b = PG_GETARG_TEXT_PP(1);
    char       *s;
    ltree      *r,
               *tmp;
 
    s = text_to_cstring(b);
 
    tmp = (ltree *) DatumGetPointer(DirectFunctionCall1(ltree_in,
                                                        PointerGetDatum(s)));
 
    pfree(s);
 
    r = ltree_concat(a, tmp);
 
    pfree(tmp);
 
    PG_FREE_IF_COPY(a, 0);
    PG_FREE_IF_COPY(b, 1);
    PG_RETURN_POINTER(r);
}

References a, b, DatumGetPointer(), DirectFunctionCall1, ltree_concat(), ltree_in(), pfree(), PG_FREE_IF_COPY, PG_GETARG_LTREE_P, PG_GETARG_TEXT_PP, PG_RETURN_POINTER, PointerGetDatum(), and text_to_cstring().

ltree_cmp()

Datum ltree_cmp

(

PG_FUNCTION_ARGS

)

Definition at line 87 of file ltree_op.c.

{
    RUNCMP;
    PG_RETURN_INT32(res);
}

References PG_RETURN_INT32, res, and RUNCMP.

ltree_compare()

int ltree_compare	(	const ltree *	a,
		const ltree *	b
	)

Definition at line 45 of file ltree_op.c.

{
    ltree_level *al = LTREE_FIRST(a);
    ltree_level *bl = LTREE_FIRST(b);
    int         an = a->numlevel;
    int         bn = b->numlevel;
 
    while (an > 0 && bn > 0)
    {
        int         res;
 
        if ((res = memcmp(al->name, bl->name, Min(al->len, bl->len))) == 0)
        {
            if (al->len != bl->len)
                return (al->len - bl->len) * 10 * (an + 1);
        }
        else
        {
            if (res < 0)
                res = -1;
            else
                res = 1;
            return res * 10 * (an + 1);
        }
 
        an--;
        bn--;
        al = LEVEL_NEXT(al);
        bl = LEVEL_NEXT(bl);
    }
 
    return (a->numlevel - b->numlevel) * 10 * (an + 1);
}

References a, b, ltree_level::len, LEVEL_NEXT, LTREE_FIRST, Min, ltree_level::name, and res.

Referenced by gist_ischild(), gist_isparent(), ltree_consistent(), ltree_penalty(), ltree_picksplit(), ltree_union(), and treekey_cmp().

ltree_concat()

static ltree* ltree_concat ( ltree *  a, ltree *  b  )

static

Definition at line 343 of file ltree_op.c.

{
    ltree      *r;
    int         numlevel = (int) a->numlevel + b->numlevel;
 
    if (numlevel > LTREE_MAX_LEVELS)
        ereport(ERROR,
                (errcode(ERRCODE_PROGRAM_LIMIT_EXCEEDED),
                 errmsg("number of ltree levels (%d) exceeds the maximum allowed (%d)",
                        numlevel, LTREE_MAX_LEVELS)));
 
    r = (ltree *) palloc0(VARSIZE(a) + VARSIZE(b) - LTREE_HDRSIZE);
    SET_VARSIZE(r, VARSIZE(a) + VARSIZE(b) - LTREE_HDRSIZE);
    r->numlevel = (uint16) numlevel;
 
    memcpy(LTREE_FIRST(r), LTREE_FIRST(a), VARSIZE(a) - LTREE_HDRSIZE);
    memcpy(((char *) LTREE_FIRST(r)) + VARSIZE(a) - LTREE_HDRSIZE,
           LTREE_FIRST(b),
           VARSIZE(b) - LTREE_HDRSIZE);
    return r;
}

References a, b, ereport, errcode(), errmsg(), ERROR, if(), LTREE_FIRST, LTREE_HDRSIZE, LTREE_MAX_LEVELS, ltree::numlevel, palloc0(), SET_VARSIZE, and VARSIZE.

Referenced by ltree_addltree(), ltree_addtext(), and ltree_textadd().

ltree_eq()

Datum ltree_eq

(

PG_FUNCTION_ARGS

)

Definition at line 108 of file ltree_op.c.

{
    RUNCMP;
    PG_RETURN_BOOL(res == 0);
}

References PG_RETURN_BOOL, res, and RUNCMP.

ltree_ge()

Datum ltree_ge

(

PG_FUNCTION_ARGS

)

Definition at line 115 of file ltree_op.c.

{
    RUNCMP;
    PG_RETURN_BOOL(res >= 0);
}

References PG_RETURN_BOOL, res, and RUNCMP.

ltree_gt()

Datum ltree_gt

(

PG_FUNCTION_ARGS

)

Definition at line 122 of file ltree_op.c.

{
    RUNCMP;
    PG_RETURN_BOOL(res > 0);
}

References PG_RETURN_BOOL, res, and RUNCMP.

ltree_index()

Datum ltree_index

(

PG_FUNCTION_ARGS

)

Definition at line 404 of file ltree_op.c.

{
    ltree      *a = PG_GETARG_LTREE_P(0);
    ltree      *b = PG_GETARG_LTREE_P(1);
    int         start = (fcinfo->nargs == 3) ? PG_GETARG_INT32(2) : 0;
    int         i,
                j;
    ltree_level *startptr,
               *aptr,
               *bptr;
    bool        found = false;
 
    if (start < 0)
    {
        if (-start >= a->numlevel)
            start = 0;
        else
            start = (int) (a->numlevel) + start;
    }
 
    if (a->numlevel - start < b->numlevel || a->numlevel == 0 || b->numlevel == 0)
    {
        PG_FREE_IF_COPY(a, 0);
        PG_FREE_IF_COPY(b, 1);
        PG_RETURN_INT32(-1);
    }
 
    startptr = LTREE_FIRST(a);
    for (i = 0; i <= a->numlevel - b->numlevel; i++)
    {
        if (i >= start)
        {
            aptr = startptr;
            bptr = LTREE_FIRST(b);
            for (j = 0; j < b->numlevel; j++)
            {
                if (!(aptr->len == bptr->len && memcmp(aptr->name, bptr->name, aptr->len) == 0))
                    break;
                aptr = LEVEL_NEXT(aptr);
                bptr = LEVEL_NEXT(bptr);
            }
 
            if (j == b->numlevel)
            {
                found = true;
                break;
            }
        }
        startptr = LEVEL_NEXT(startptr);
    }
 
    if (!found)
        i = -1;
 
    PG_FREE_IF_COPY(a, 0);
    PG_FREE_IF_COPY(b, 1);
    PG_RETURN_INT32(i);
}

References a, b, i, j, ltree_level::len, LEVEL_NEXT, LTREE_FIRST, ltree_level::name, PG_FREE_IF_COPY, PG_GETARG_INT32, PG_GETARG_LTREE_P, PG_RETURN_INT32, and start.

ltree_isparent()

Datum ltree_isparent

(

PG_FUNCTION_ARGS

)

Definition at line 236 of file ltree_op.c.

{
    ltree      *c = PG_GETARG_LTREE_P(1);
    ltree      *p = PG_GETARG_LTREE_P(0);
    bool        res = inner_isparent(c, p);
 
    PG_FREE_IF_COPY(c, 1);
    PG_FREE_IF_COPY(p, 0);
    PG_RETURN_BOOL(res);
}

References inner_isparent(), PG_FREE_IF_COPY, PG_GETARG_LTREE_P, PG_RETURN_BOOL, and res.

Referenced by _ltree_extract_isparent(), and _ltree_isparent().

ltree_le()

Datum ltree_le

(

PG_FUNCTION_ARGS

)

Definition at line 101 of file ltree_op.c.

{
    RUNCMP;
    PG_RETURN_BOOL(res <= 0);
}

References PG_RETURN_BOOL, res, and RUNCMP.

ltree_lt()

Datum ltree_lt

(

PG_FUNCTION_ARGS

)

Definition at line 94 of file ltree_op.c.

{
    RUNCMP;
    PG_RETURN_BOOL(res < 0);
}

References PG_RETURN_BOOL, res, and RUNCMP.

ltree_ne()

Datum ltree_ne

(

PG_FUNCTION_ARGS

)

Definition at line 129 of file ltree_op.c.

{
    RUNCMP;
    PG_RETURN_BOOL(res != 0);
}

References PG_RETURN_BOOL, res, and RUNCMP.

ltree_risparent()

Datum ltree_risparent

(

PG_FUNCTION_ARGS

)

Definition at line 248 of file ltree_op.c.

{
    ltree      *c = PG_GETARG_LTREE_P(0);
    ltree      *p = PG_GETARG_LTREE_P(1);
    bool        res = inner_isparent(c, p);
 
    PG_FREE_IF_COPY(c, 0);
    PG_FREE_IF_COPY(p, 1);
    PG_RETURN_BOOL(res);
}

References inner_isparent(), PG_FREE_IF_COPY, PG_GETARG_LTREE_P, PG_RETURN_BOOL, and res.

Referenced by _ltree_extract_risparent(), and _ltree_risparent().

ltree_textadd()

Datum ltree_textadd

(

PG_FUNCTION_ARGS

)

Definition at line 464 of file ltree_op.c.

{
    ltree      *a = PG_GETARG_LTREE_P(1);
    text       *b = PG_GETARG_TEXT_PP(0);
    char       *s;
    ltree      *r,
               *tmp;
 
    s = text_to_cstring(b);
 
    tmp = (ltree *) DatumGetPointer(DirectFunctionCall1(ltree_in,
                                                        PointerGetDatum(s)));
 
    pfree(s);
 
    r = ltree_concat(tmp, a);
 
    pfree(tmp);
 
    PG_FREE_IF_COPY(a, 1);
    PG_FREE_IF_COPY(b, 0);
    PG_RETURN_POINTER(r);
}

References a, b, DatumGetPointer(), DirectFunctionCall1, ltree_concat(), ltree_in(), pfree(), PG_FREE_IF_COPY, PG_GETARG_LTREE_P, PG_GETARG_TEXT_PP, PG_RETURN_POINTER, PointerGetDatum(), and text_to_cstring().

ltreeparentsel()

Datum ltreeparentsel

(

PG_FUNCTION_ARGS

)

Definition at line 645 of file ltree_op.c.

{
    PlannerInfo *root = (PlannerInfo *) PG_GETARG_POINTER(0);
    Oid         operator = PG_GETARG_OID(1);
    List       *args = (List *) PG_GETARG_POINTER(2);
    int         varRelid = PG_GETARG_INT32(3);
    double      selec;
 
    /* Use generic restriction selectivity logic, with default 0.001. */
    selec = generic_restriction_selectivity(root, operator, InvalidOid,
                                            args, varRelid,
                                            0.001);
 
    PG_RETURN_FLOAT8((float8) selec);
}

References generate_unaccent_rules::args, generic_restriction_selectivity(), InvalidOid, PG_GETARG_INT32, PG_GETARG_OID, PG_GETARG_POINTER, PG_RETURN_FLOAT8, and root.

nlevel()

Datum nlevel

(

PG_FUNCTION_ARGS

)

Definition at line 202 of file ltree_op.c.

{
    ltree      *a = PG_GETARG_LTREE_P(0);
    int         res = a->numlevel;
 
    PG_FREE_IF_COPY(a, 0);
    PG_RETURN_INT32(res);
}

References a, PG_FREE_IF_COPY, PG_GETARG_LTREE_P, PG_RETURN_INT32, and res.

PG_FUNCTION_INFO_V1() [1/22]

PG_FUNCTION_INFO_V1

(

hash_ltree

)

PG_FUNCTION_INFO_V1() [2/22]

PG_FUNCTION_INFO_V1

(

hash_ltree_extended

)

PG_FUNCTION_INFO_V1() [3/22]

PG_FUNCTION_INFO_V1

(

lca

)

PG_FUNCTION_INFO_V1() [4/22]

PG_FUNCTION_INFO_V1

(

ltree2text

)

PG_FUNCTION_INFO_V1() [5/22]

PG_FUNCTION_INFO_V1

(

ltree_addltree

)

PG_FUNCTION_INFO_V1() [6/22]

PG_FUNCTION_INFO_V1

(

ltree_addtext

)

PG_FUNCTION_INFO_V1() [7/22]

PG_FUNCTION_INFO_V1

(

ltree_cmp

)

PG_FUNCTION_INFO_V1() [8/22]

PG_FUNCTION_INFO_V1

(

ltree_eq

)

PG_FUNCTION_INFO_V1() [9/22]

PG_FUNCTION_INFO_V1

(

ltree_ge

)

PG_FUNCTION_INFO_V1() [10/22]

PG_FUNCTION_INFO_V1

(

ltree_gt

)

PG_FUNCTION_INFO_V1() [11/22]

PG_FUNCTION_INFO_V1

(

ltree_index

)

PG_FUNCTION_INFO_V1() [12/22]

PG_FUNCTION_INFO_V1

(

ltree_isparent

)

PG_FUNCTION_INFO_V1() [13/22]

PG_FUNCTION_INFO_V1

(

ltree_le

)

PG_FUNCTION_INFO_V1() [14/22]

PG_FUNCTION_INFO_V1

(

ltree_lt

)

PG_FUNCTION_INFO_V1() [15/22]

PG_FUNCTION_INFO_V1

(

ltree_ne

)

PG_FUNCTION_INFO_V1() [16/22]

PG_FUNCTION_INFO_V1

(

ltree_risparent

)

PG_FUNCTION_INFO_V1() [17/22]

PG_FUNCTION_INFO_V1

(

ltree_textadd

)

PG_FUNCTION_INFO_V1() [18/22]

PG_FUNCTION_INFO_V1

(

ltreeparentsel

)

PG_FUNCTION_INFO_V1() [19/22]

PG_FUNCTION_INFO_V1

(

nlevel

)

PG_FUNCTION_INFO_V1() [20/22]

PG_FUNCTION_INFO_V1

(

subltree

)

PG_FUNCTION_INFO_V1() [21/22]

PG_FUNCTION_INFO_V1

(

subpath

)

PG_FUNCTION_INFO_V1() [22/22]

PG_FUNCTION_INFO_V1

(

text2ltree

)

subltree()

Datum subltree

(

PG_FUNCTION_ARGS

)

Definition at line 300 of file ltree_op.c.

{
    ltree      *t = PG_GETARG_LTREE_P(0);
    ltree      *res = inner_subltree(t, PG_GETARG_INT32(1), PG_GETARG_INT32(2));
 
    PG_FREE_IF_COPY(t, 0);
    PG_RETURN_POINTER(res);
}

References inner_subltree(), PG_FREE_IF_COPY, PG_GETARG_INT32, PG_GETARG_LTREE_P, PG_RETURN_POINTER, and res.

subpath()

Datum subpath

(

PG_FUNCTION_ARGS

)

Definition at line 310 of file ltree_op.c.

{
    ltree      *t = PG_GETARG_LTREE_P(0);
    int32       start = PG_GETARG_INT32(1);
    int32       len = (fcinfo->nargs == 3) ? PG_GETARG_INT32(2) : 0;
    int32       end;
    ltree      *res;
 
    end = start + len;
 
    if (start < 0)
    {
        start = t->numlevel + start;
        end = start + len;
    }
    if (start < 0)
    {                           /* start > t->numlevel */
        start = t->numlevel + start;
        end = start + len;
    }
 
    if (len < 0)
        end = t->numlevel + len;
    else if (len == 0)
        end = (fcinfo->nargs == 3) ? start : 0xffff;
 
    res = inner_subltree(t, start, end);
 
    PG_FREE_IF_COPY(t, 0);
    PG_RETURN_POINTER(res);
}

References inner_subltree(), len, ltree::numlevel, PG_FREE_IF_COPY, PG_GETARG_INT32, PG_GETARG_LTREE_P, PG_RETURN_POINTER, res, and start.

Referenced by add_foreign_final_paths(), add_paths_to_append_rel(), adjust_paths_for_srfs(), append_nonpartial_cost(), apply_scanjoin_target_to_paths(), build_setop_child_paths(), cost_append(), cost_bitmap_and_node(), cost_bitmap_or_node(), create_agg_path(), create_append_path(), create_append_plan(), create_gather_merge_path(), create_gather_path(), create_group_path(), create_groupingsets_path(), create_incremental_sort_path(), create_limit_path(), create_lockrows_path(), create_material_path(), create_memoize_path(), create_merge_append_path(), create_merge_append_plan(), create_modifytable_path(), create_modifytable_plan(), create_projection_path(), create_set_projection_path(), create_setop_path(), create_sort_path(), create_subqueryscan_path(), create_unique_path(), create_upper_unique_path(), create_windowagg_path(), ExecSupportsMarkRestore(), generate_gather_paths(), generate_union_paths(), generate_useful_gather_paths(), get_param_path_clause_serials(), is_dummy_rel(), mark_async_capable_plan(), recurse_set_operations(), reparameterize_path(), set_subquery_pathlist(), and walkdir().

text2ltree()

Datum text2ltree

(

PG_FUNCTION_ARGS

)

Definition at line 591 of file ltree_op.c.

{
    text       *in = PG_GETARG_TEXT_PP(0);
    char       *s;
    ltree      *out;
 
    s = text_to_cstring(in);
 
    out = (ltree *) DatumGetPointer(DirectFunctionCall1(ltree_in,
                                                        PointerGetDatum(s)));
    pfree(s);
    PG_FREE_IF_COPY(in, 0);
    PG_RETURN_POINTER(out);
}

References DatumGetPointer(), DirectFunctionCall1, ltree_in(), pfree(), PG_FREE_IF_COPY, PG_GETARG_TEXT_PP, PG_RETURN_POINTER, PointerGetDatum(), and text_to_cstring().

Variable Documentation

PG_MODULE_MAGIC

PG_MODULE_MAGIC

Definition at line 18 of file ltree_op.c.