nodes.h File Reference

#include "nodes/nodetags.h"

Include dependency graph for nodes.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Data Structures
struct	Node

Macros
#define	pg_node_attr(...)
#define	nodeTag(nodeptr)   (((const Node*)(nodeptr))->type)
#define	makeNode(_type_)   ((_type_ *) newNode(sizeof(_type_),T_##_type_))
#define	NodeSetTag(nodeptr, t)   (((Node*)(nodeptr))->type = (t))
#define	IsA(nodeptr, _type_)   (nodeTag(nodeptr) == T_##_type_)
#define	castNode(_type_, nodeptr)   ((_type_ *) (nodeptr))
#define	copyObject(obj)   copyObjectImpl(obj)
#define	IS_OUTER_JOIN(jointype)
#define	AGGSPLITOP_COMBINE   0x01 /* substitute combinefn for transfn */
#define	AGGSPLITOP_SKIPFINAL   0x02 /* skip finalfn, return state as-is */
#define	AGGSPLITOP_SERIALIZE   0x04 /* apply serialfn to output */
#define	AGGSPLITOP_DESERIALIZE   0x08 /* apply deserialfn to input */
#define	DO_AGGSPLIT_COMBINE(as)   (((as) & AGGSPLITOP_COMBINE) != 0)
#define	DO_AGGSPLIT_SKIPFINAL(as)   (((as) & AGGSPLITOP_SKIPFINAL) != 0)
#define	DO_AGGSPLIT_SERIALIZE(as)   (((as) & AGGSPLITOP_SERIALIZE) != 0)
#define	DO_AGGSPLIT_DESERIALIZE(as)   (((as) & AGGSPLITOP_DESERIALIZE) != 0)

Typedefs
typedef enum NodeTag	NodeTag
typedef struct Node	Node
typedef int	ParseLoc
typedef double	Selectivity
typedef double	Cost
typedef double	Cardinality
typedef enum CmdType	CmdType
typedef enum JoinType	JoinType
typedef enum AggStrategy	AggStrategy
typedef enum AggSplit	AggSplit
typedef enum SetOpCmd	SetOpCmd
typedef enum SetOpStrategy	SetOpStrategy
typedef enum OnConflictAction	OnConflictAction
typedef enum LimitOption	LimitOption

Enumerations
enum	NodeTag { T_Invalid = 0 }
enum	CmdType {   CMD_UNKNOWN , CMD_SELECT , CMD_UPDATE , CMD_INSERT ,   CMD_DELETE , CMD_MERGE , CMD_UTILITY , CMD_NOTHING }
enum	JoinType {   JOIN_INNER , JOIN_LEFT , JOIN_FULL , JOIN_RIGHT ,   JOIN_SEMI , JOIN_ANTI , JOIN_RIGHT_SEMI , JOIN_RIGHT_ANTI ,   JOIN_UNIQUE_OUTER , JOIN_UNIQUE_INNER }
enum	AggStrategy { AGG_PLAIN , AGG_SORTED , AGG_HASHED , AGG_MIXED }
enum	AggSplit { AGGSPLIT_SIMPLE = 0 , AGGSPLIT_INITIAL_SERIAL = AGGSPLITOP_SKIPFINAL | AGGSPLITOP_SERIALIZE , AGGSPLIT_FINAL_DESERIAL = AGGSPLITOP_COMBINE | AGGSPLITOP_DESERIALIZE }
enum	SetOpCmd { SETOPCMD_INTERSECT , SETOPCMD_INTERSECT_ALL , SETOPCMD_EXCEPT , SETOPCMD_EXCEPT_ALL }
enum	SetOpStrategy { SETOP_SORTED , SETOP_HASHED }
enum	OnConflictAction { ONCONFLICT_NONE , ONCONFLICT_NOTHING , ONCONFLICT_UPDATE }
enum	LimitOption { LIMIT_OPTION_COUNT , LIMIT_OPTION_WITH_TIES }

Functions
static Node *	newNode (size_t size, NodeTag tag)
void	outNode (struct StringInfoData *str, const void *obj)
void	outToken (struct StringInfoData *str, const char *s)
void	outBitmapset (struct StringInfoData *str, const struct Bitmapset *bms)
void	outDatum (struct StringInfoData *str, Datum value, int typlen, bool typbyval)
char *	nodeToString (const void *obj)
char *	nodeToStringWithLocations (const void *obj)
char *	bmsToString (const struct Bitmapset *bms)
void *	stringToNode (const char *str)
struct Bitmapset *	readBitmapset (void)
Datum	readDatum (bool typbyval)
bool *	readBoolCols (int numCols)
int *	readIntCols (int numCols)
Oid *	readOidCols (int numCols)
int16 *	readAttrNumberCols (int numCols)
void *	copyObjectImpl (const void *from)
bool	equal (const void *a, const void *b)

Macro Definition Documentation

AGGSPLITOP_COMBINE

#define AGGSPLITOP_COMBINE   0x01 /* substitute combinefn for transfn */

Definition at line 378 of file nodes.h.

AGGSPLITOP_DESERIALIZE

#define AGGSPLITOP_DESERIALIZE   0x08 /* apply deserialfn to input */

Definition at line 381 of file nodes.h.

AGGSPLITOP_SERIALIZE

#define AGGSPLITOP_SERIALIZE   0x04 /* apply serialfn to output */

Definition at line 380 of file nodes.h.

AGGSPLITOP_SKIPFINAL

#define AGGSPLITOP_SKIPFINAL   0x02 /* skip finalfn, return state as-is */

Definition at line 379 of file nodes.h.

castNode

#define castNode	(		_type_,
			nodeptr
	)		((_type_ *) (nodeptr))

Definition at line 182 of file nodes.h.

copyObject

#define copyObject

(

obj

)

copyObjectImpl(obj)

Definition at line 232 of file nodes.h.

DO_AGGSPLIT_COMBINE

#define DO_AGGSPLIT_COMBINE

(

as

)

(((as) & AGGSPLITOP_COMBINE) != 0)

Definition at line 395 of file nodes.h.

DO_AGGSPLIT_DESERIALIZE

#define DO_AGGSPLIT_DESERIALIZE

(

as

)

(((as) & AGGSPLITOP_DESERIALIZE) != 0)

Definition at line 398 of file nodes.h.

DO_AGGSPLIT_SERIALIZE

#define DO_AGGSPLIT_SERIALIZE

(

as

)

(((as) & AGGSPLITOP_SERIALIZE) != 0)

Definition at line 397 of file nodes.h.

DO_AGGSPLIT_SKIPFINAL

#define DO_AGGSPLIT_SKIPFINAL

(

as

)

(((as) & AGGSPLITOP_SKIPFINAL) != 0)

Definition at line 396 of file nodes.h.

IS_OUTER_JOIN

#define IS_OUTER_JOIN

(

jointype

)

Value:

    (((1 << (jointype)) & \
      ((1 << JOIN_LEFT) | \
       (1 << JOIN_FULL) | \
       (1 << JOIN_RIGHT) | \
       (1 << JOIN_ANTI) | \
       (1 << JOIN_RIGHT_ANTI))) != 0)

Definition at line 348 of file nodes.h.

{
    AGG_PLAIN,                  /* simple agg across all input rows */
    AGG_SORTED,                 /* grouped agg, input must be sorted */
    AGG_HASHED,                 /* grouped agg, use internal hashtable */
    AGG_MIXED,                  /* grouped agg, hash and sort both used */
} AggStrategy;
 
/*
 * AggSplit -
 *    splitting (partial aggregation) modes for Agg plan nodes
 *
 * This is needed in both pathnodes.h and plannodes.h, so put it here...
 */
 
/* Primitive options supported by nodeAgg.c: */
#define AGGSPLITOP_COMBINE      0x01    /* substitute combinefn for transfn */
#define AGGSPLITOP_SKIPFINAL    0x02    /* skip finalfn, return state as-is */
#define AGGSPLITOP_SERIALIZE    0x04    /* apply serialfn to output */
#define AGGSPLITOP_DESERIALIZE  0x08    /* apply deserialfn to input */
 
/* Supported operating modes (i.e., useful combinations of these options): */
typedef enum AggSplit
{
    /* Basic, non-split aggregation: */
    AGGSPLIT_SIMPLE = 0,
    /* Initial phase of partial aggregation, with serialization: */
    AGGSPLIT_INITIAL_SERIAL = AGGSPLITOP_SKIPFINAL | AGGSPLITOP_SERIALIZE,
    /* Final phase of partial aggregation, with deserialization: */
    AGGSPLIT_FINAL_DESERIAL = AGGSPLITOP_COMBINE | AGGSPLITOP_DESERIALIZE,
} AggSplit;
 
/* Test whether an AggSplit value selects each primitive option: */
#define DO_AGGSPLIT_COMBINE(as)     (((as) & AGGSPLITOP_COMBINE) != 0)
#define DO_AGGSPLIT_SKIPFINAL(as)   (((as) & AGGSPLITOP_SKIPFINAL) != 0)
#define DO_AGGSPLIT_SERIALIZE(as)   (((as) & AGGSPLITOP_SERIALIZE) != 0)
#define DO_AGGSPLIT_DESERIALIZE(as) (((as) & AGGSPLITOP_DESERIALIZE) != 0)
 
/*
 * SetOpCmd and SetOpStrategy -
 *    overall semantics and execution strategies for SetOp plan nodes
 *
 * This is needed in both pathnodes.h and plannodes.h, so put it here...
 */
typedef enum SetOpCmd
{
    SETOPCMD_INTERSECT,
    SETOPCMD_INTERSECT_ALL,
    SETOPCMD_EXCEPT,
    SETOPCMD_EXCEPT_ALL,
} SetOpCmd;
 
typedef enum SetOpStrategy
{
    SETOP_SORTED,               /* input must be sorted */
    SETOP_HASHED,               /* use internal hashtable */
} SetOpStrategy;
 
/*
 * OnConflictAction -
 *    "ON CONFLICT" clause type of query
 *
 * This is needed in both parsenodes.h and plannodes.h, so put it here...
 */
typedef enum OnConflictAction
{
    ONCONFLICT_NONE,            /* No "ON CONFLICT" clause */
    ONCONFLICT_NOTHING,         /* ON CONFLICT ... DO NOTHING */
    ONCONFLICT_UPDATE,          /* ON CONFLICT ... DO UPDATE */
} OnConflictAction;
 
/*
 * LimitOption -
 *  LIMIT option of query
 *
 * This is needed in both parsenodes.h and plannodes.h, so put it here...
 */
typedef enum LimitOption
{
    LIMIT_OPTION_COUNT,         /* FETCH FIRST... ONLY */
    LIMIT_OPTION_WITH_TIES,     /* FETCH FIRST... WITH TIES */
} LimitOption;
 
#endif                          /* NODES_H */

IsA

#define IsA	(		nodeptr,
			_type_
	)		(nodeTag(nodeptr) == T_##_type_)

Definition at line 164 of file nodes.h.

makeNode

#define makeNode

(

_type_

)

((_type_ *) newNode(sizeof(_type_),T_##_type_))

Definition at line 161 of file nodes.h.

NodeSetTag

#define NodeSetTag	(		nodeptr,
			t
	)		(((Node*)(nodeptr))->type = (t))

Definition at line 162 of file nodes.h.

nodeTag

#define nodeTag

(

nodeptr

)

(((const Node*)(nodeptr))->type)

Definition at line 139 of file nodes.h.

pg_node_attr

#define pg_node_attr

(

...

)

Definition at line 126 of file nodes.h.

Typedef Documentation

AggSplit

typedef enum AggSplit AggSplit

AggStrategy

typedef enum AggStrategy AggStrategy

Cardinality

typedef double Cardinality

Definition at line 262 of file nodes.h.

CmdType

typedef enum CmdType CmdType

Cost

typedef double Cost

Definition at line 261 of file nodes.h.

JoinType

typedef enum JoinType JoinType

LimitOption

typedef enum LimitOption LimitOption

Node

typedef struct Node Node

NodeTag

typedef enum NodeTag NodeTag

OnConflictAction

typedef enum OnConflictAction OnConflictAction

ParseLoc

typedef int ParseLoc

Definition at line 250 of file nodes.h.

Selectivity

typedef double Selectivity

Definition at line 260 of file nodes.h.

SetOpCmd

typedef enum SetOpCmd SetOpCmd

SetOpStrategy

typedef enum SetOpStrategy SetOpStrategy

Enumeration Type Documentation

AggSplit

enum AggSplit

Enumerator
AGGSPLIT_SIMPLE
AGGSPLIT_INITIAL_SERIAL
AGGSPLIT_FINAL_DESERIAL

Definition at line 384 of file nodes.h.

{
    /* Basic, non-split aggregation: */
    AGGSPLIT_SIMPLE = 0,
    /* Initial phase of partial aggregation, with serialization: */
    AGGSPLIT_INITIAL_SERIAL = AGGSPLITOP_SKIPFINAL | AGGSPLITOP_SERIALIZE,
    /* Final phase of partial aggregation, with deserialization: */
    AGGSPLIT_FINAL_DESERIAL = AGGSPLITOP_COMBINE | AGGSPLITOP_DESERIALIZE,
} AggSplit;

AggStrategy

enum AggStrategy

Enumerator
AGG_PLAIN
AGG_SORTED
AGG_HASHED
AGG_MIXED

Definition at line 362 of file nodes.h.

{
    AGG_PLAIN,                  /* simple agg across all input rows */
    AGG_SORTED,                 /* grouped agg, input must be sorted */
    AGG_HASHED,                 /* grouped agg, use internal hashtable */
    AGG_MIXED,                  /* grouped agg, hash and sort both used */
} AggStrategy;

CmdType

enum CmdType

Enumerator
CMD_UNKNOWN
CMD_SELECT
CMD_UPDATE
CMD_INSERT
CMD_DELETE
CMD_MERGE
CMD_UTILITY
CMD_NOTHING

Definition at line 272 of file nodes.h.

{
    CMD_UNKNOWN,
    CMD_SELECT,                 /* select stmt */
    CMD_UPDATE,                 /* update stmt */
    CMD_INSERT,                 /* insert stmt */
    CMD_DELETE,                 /* delete stmt */
    CMD_MERGE,                  /* merge stmt */
    CMD_UTILITY,                /* cmds like create, destroy, copy, vacuum,
                                 * etc. */
    CMD_NOTHING,                /* dummy command for instead nothing rules
                                 * with qual */
} CmdType;

JoinType

enum JoinType

Enumerator
JOIN_INNER
JOIN_LEFT
JOIN_FULL
JOIN_RIGHT
JOIN_SEMI
JOIN_ANTI
JOIN_RIGHT_SEMI
JOIN_RIGHT_ANTI
JOIN_UNIQUE_OUTER
JOIN_UNIQUE_INNER

Definition at line 297 of file nodes.h.

{
    /*
     * The canonical kinds of joins according to the SQL JOIN syntax. Only
     * these codes can appear in parser output (e.g., JoinExpr nodes).
     */
    JOIN_INNER,                 /* matching tuple pairs only */
    JOIN_LEFT,                  /* pairs + unmatched LHS tuples */
    JOIN_FULL,                  /* pairs + unmatched LHS + unmatched RHS */
    JOIN_RIGHT,                 /* pairs + unmatched RHS tuples */
 
    /*
     * Semijoins and anti-semijoins (as defined in relational theory) do not
     * appear in the SQL JOIN syntax, but there are standard idioms for
     * representing them (e.g., using EXISTS).  The planner recognizes these
     * cases and converts them to joins.  So the planner and executor must
     * support these codes.  NOTE: in JOIN_SEMI output, it is unspecified
     * which matching RHS row is joined to.  In JOIN_ANTI output, the row is
     * guaranteed to be null-extended.
     */
    JOIN_SEMI,                  /* 1 copy of each LHS row that has match(es) */
    JOIN_ANTI,                  /* 1 copy of each LHS row that has no match */
    JOIN_RIGHT_SEMI,            /* 1 copy of each RHS row that has match(es) */
    JOIN_RIGHT_ANTI,            /* 1 copy of each RHS row that has no match */
 
    /*
     * These codes are used internally in the planner, but are not supported
     * by the executor (nor, indeed, by most of the planner).
     */
    JOIN_UNIQUE_OUTER,          /* LHS has be made unique */
    JOIN_UNIQUE_INNER,          /* RHS has be made unique */
 
    /*
     * We might need additional join types someday.
     */
} JoinType;

LimitOption

enum LimitOption

Enumerator
LIMIT_OPTION_COUNT
LIMIT_OPTION_WITH_TIES

Definition at line 439 of file nodes.h.

{
    LIMIT_OPTION_COUNT,         /* FETCH FIRST... ONLY */
    LIMIT_OPTION_WITH_TIES,     /* FETCH FIRST... WITH TIES */
} LimitOption;

NodeTag

enum NodeTag

Enumerator
T_Invalid

Definition at line 26 of file nodes.h.

{
    T_Invalid = 0,
 
#include "nodes/nodetags.h"
} NodeTag;

OnConflictAction

enum OnConflictAction

Enumerator
ONCONFLICT_NONE
ONCONFLICT_NOTHING
ONCONFLICT_UPDATE

Definition at line 426 of file nodes.h.

{
    ONCONFLICT_NONE,            /* No "ON CONFLICT" clause */
    ONCONFLICT_NOTHING,         /* ON CONFLICT ... DO NOTHING */
    ONCONFLICT_UPDATE,          /* ON CONFLICT ... DO UPDATE */
} OnConflictAction;

SetOpCmd

enum SetOpCmd

Enumerator
SETOPCMD_INTERSECT
SETOPCMD_INTERSECT_ALL
SETOPCMD_EXCEPT
SETOPCMD_EXCEPT_ALL

Definition at line 406 of file nodes.h.

{
    SETOPCMD_INTERSECT,
    SETOPCMD_INTERSECT_ALL,
    SETOPCMD_EXCEPT,
    SETOPCMD_EXCEPT_ALL,
} SetOpCmd;

SetOpStrategy

enum SetOpStrategy

Enumerator
SETOP_SORTED
SETOP_HASHED

Definition at line 414 of file nodes.h.

{
    SETOP_SORTED,               /* input must be sorted */
    SETOP_HASHED,               /* use internal hashtable */
} SetOpStrategy;

Function Documentation

bmsToString()

char * bmsToString ( const struct Bitmapset *  bms )

extern

copyObjectImpl()

void * copyObjectImpl ( const void *  from )

extern

Definition at line 177 of file copyfuncs.c.

{
    void       *retval;
 
    if (from == NULL)
        return NULL;
 
    /* Guard against stack overflow due to overly complex expressions */
    check_stack_depth();
 
    switch (nodeTag(from))
    {
#include "copyfuncs.switch.c"
 
        case T_List:
            retval = list_copy_deep(from);
            break;
 
            /*
             * Lists of integers, OIDs and XIDs don't need to be deep-copied,
             * so we perform a shallow copy via list_copy()
             */
        case T_IntList:
        case T_OidList:
        case T_XidList:
            retval = list_copy(from);
            break;
 
        default:
            elog(ERROR, "unrecognized node type: %d", (int) nodeTag(from));
            retval = NULL;      /* keep compiler quiet */
            break;
    }
 
    return retval;
}

References check_stack_depth(), elog, ERROR, fb(), list_copy(), list_copy_deep(), and nodeTag.

Referenced by list_copy_deep().

equal()

bool equal ( const void *  a, const void *  b  )

extern

Definition at line 223 of file equalfuncs.c.

{
    bool        retval;
 
    if (a == b)
        return true;
 
    /*
     * note that a!=b, so only one of them can be NULL
     */
    if (a == NULL || b == NULL)
        return false;
 
    /*
     * are they the same type of nodes?
     */
    if (nodeTag(a) != nodeTag(b))
        return false;
 
    /* Guard against stack overflow due to overly complex expressions */
    check_stack_depth();
 
    switch (nodeTag(a))
    {
#include "equalfuncs.switch.c"
 
        case T_List:
        case T_IntList:
        case T_OidList:
        case T_XidList:
            retval = _equalList(a, b);
            break;
 
        default:
            elog(ERROR, "unrecognized node type: %d",
                 (int) nodeTag(a));
            retval = false;     /* keep compiler quiet */
            break;
    }
 
    return retval;
}

References _equalList(), a, b, check_stack_depth(), elog, ERROR, fb(), and nodeTag.

Referenced by _equalA_Const(), _equalList(), add_row_identity_var(), add_sp_item_to_pathtarget(), add_unique_group_var(), addRangeClause(), AlterPublicationTables(), calc_hist_selectivity_scalar(), calc_hist_selectivity_scalar(), calc_length_hist_frac(), calc_length_hist_frac(), check_new_partition_bound(), check_partition_bounds_for_split_list(), clause_is_strict_for(), CompareIndexInfo(), convert_subquery_pathkeys(), create_ordered_paths(), create_projection_path(), CreateStatistics(), deparseParam(), deparseVar(), dependencies_clauselist_selectivity(), dependency_is_compatible_expression(), ec_member_matches_foreign(), equalPolicy(), equalRuleLocks(), estimate_multivariate_bucketsize(), estimate_multivariate_ndistinct(), examine_variable(), ExecInitWindowAgg(), expand_grouping_sets(), exprs_known_equal(), finalize_grouping_exprs_walker(), find_compatible_agg(), find_ec_member_matching_expr(), find_em_for_rel_target(), find_list_position(), find_minmax_agg_replacement_param(), findTargetlistEntrySQL92(), findTargetlistEntrySQL99(), fix_expr_common(), fix_indexqual_operand(), get_eclass_for_sort_expr(), get_expression_sortgroupref(), get_partition_for_tuple(), get_variable(), group_by_has_partkey(), grouping_planner(), infer_collation_opclass_match(), length_hist_bsearch(), length_hist_bsearch(), list_delete(), list_member(), list_member_rangevar(), match_boolean_partition_clause(), match_clause_to_partition_key(), match_eclasses_to_foreign_key_col(), match_expr_to_partition_keys(), match_index_to_operand(), match_unique_clauses(), matches_boolean_partition_clause(), maybe_reread_subscription(), mcv_match_expression(), MergeAttributes(), MergeCheckConstraint(), MergeWithExistingConstraint(), operator_predicate_proof(), optimize_window_clauses(), pg_parse_query(), pg_plan_query(), pg_rewrite_query(), plan_union_children(), predicate_implied_by_simple_clause(), predicate_refuted_by_simple_clause(), preprocess_groupclause(), process_duplicate_ors(), process_equivalence(), process_matched_tle(), process_subquery_nestloop_params(), rbound_bsearch(), rbound_bsearch(), recomputeNamespacePath(), reconsider_full_join_clause(), reconsider_outer_join_clause(), RelationGetIndexAttrBitmap(), replace_nestloop_param_placeholdervar(), replace_nestloop_param_var(), replace_relid_callback(), restrict_infos_logically_equal(), search_indexed_tlist_for_sortgroupref(), split_selfjoin_quals(), stat_find_expression(), substitute_grouped_columns_mutator(), tlist_member(), tlist_same_exprs(), transformIndexConstraints(), transformPartitionBound(), transformPartitionCmdForMerge(), transformPartitionCmdForSplit(), transformWindowFuncCall(), trivial_subqueryscan(), and update_eclasses().

newNode()

static Node * newNode ( size_t  size, NodeTag  tag  )

inlinestatic

Definition at line 150 of file nodes.h.

{
    Node       *result;
 
    Assert(size >= sizeof(Node));   /* need the tag, at least */
    result = (Node *) palloc0(size);
    result->type = tag;
 
    return result;
}

References Assert, palloc0(), and Node::type.

Referenced by _copyExtensibleNode(), and _readExtensibleNode().

nodeToString()

char * nodeToString ( const void *  obj )

extern

Definition at line 802 of file outfuncs.c.

{
    return nodeToStringInternal(obj, false);
}

References nodeToStringInternal().

Referenced by AlterDomainDefault(), AlterPolicy(), CreatePolicy(), CreateStatistics(), createTableConstraints(), CreateTriggerFiringOn(), DefineDomain(), domainAddCheckConstraint(), ExecSerializePlan(), expandTableLikeClause(), InsertRule(), ProcedureCreate(), publication_add_relation(), StoreAttrDefault(), StorePartitionBound(), StorePartitionKey(), StoreRelCheck(), and UpdateIndexRelation().

nodeToStringWithLocations()

char * nodeToStringWithLocations ( const void *  obj )

extern

Definition at line 808 of file outfuncs.c.

{
    return nodeToStringInternal(obj, true);
}

References nodeToStringInternal().

Referenced by elog_node_display(), pg_parse_query(), pg_plan_query(), pg_rewrite_query(), pprint(), and print().

outBitmapset()

void outBitmapset ( struct StringInfoData *  str, const struct Bitmapset *  bms  )

extern

outDatum()

void outDatum ( struct StringInfoData *  str, Datum  value, int  typlen, bool  typbyval  )

extern

outNode()

void outNode ( struct StringInfoData *  str, const void *  obj  )

extern

outToken()

void outToken ( struct StringInfoData *  str, const char *  s  )

extern

readAttrNumberCols()

int16 * readAttrNumberCols ( int  numCols )

extern

readBitmapset()

struct Bitmapset * readBitmapset ( void  )

extern

Definition at line 249 of file readfuncs.c.

{
    return _readBitmapset();
}

References _readBitmapset().

readBoolCols()

bool * readBoolCols ( int  numCols )

extern

readDatum()

Datum readDatum ( bool  typbyval )

extern

Definition at line 598 of file readfuncs.c.

{
    Size        length;
    int         tokenLength;
    const char *token;
    Datum       res;
    char       *s;
 
    /*
     * read the actual length of the value
     */
    token = pg_strtok(&tokenLength);
    length = atoui(token);
 
    token = pg_strtok(&tokenLength);    /* read the '[' */
    if (token == NULL || token[0] != '[')
        elog(ERROR, "expected \"[\" to start datum, but got \"%s\"; length = %zu",
             token ? token : "[NULL]", length);
 
    if (typbyval)
    {
        if (length > (Size) sizeof(Datum))
            elog(ERROR, "byval datum but length = %zu", length);
        res = (Datum) 0;
        s = (char *) (&res);
        for (Size i = 0; i < (Size) sizeof(Datum); i++)
        {
            token = pg_strtok(&tokenLength);
            s[i] = (char) atoi(token);
        }
    }
    else if (length <= 0)
        res = (Datum) 0;
    else
    {
        s = (char *) palloc(length);
        for (Size i = 0; i < length; i++)
        {
            token = pg_strtok(&tokenLength);
            s[i] = (char) atoi(token);
        }
        res = PointerGetDatum(s);
    }
 
    token = pg_strtok(&tokenLength);    /* read the ']' */
    if (token == NULL || token[0] != ']')
        elog(ERROR, "expected \"]\" to end datum, but got \"%s\"; length = %zu",
             token ? token : "[NULL]", length);
 
    return res;
}

References atoui, elog, ERROR, fb(), i, palloc(), pg_strtok(), PointerGetDatum(), and token.

Referenced by _readConst().

readIntCols()

int * readIntCols ( int  numCols )

extern

readOidCols()

Oid * readOidCols ( int  numCols )

extern

stringToNode()

void * stringToNode ( const char *  str )

extern

Definition at line 90 of file read.c.

{
    return stringToNodeInternal(str, false);
}

References str, and stringToNodeInternal().

Referenced by AddRelationNewConstraints(), AlterPolicy(), AlterPublicationTables(), CloneRowTriggersToPartition(), ConstraintImpliedByRelConstraint(), createTableConstraints(), ExecParallelGetQueryDesc(), ExecRelCheck(), expandTableLikeClause(), extended_statistics_update(), fetch_function_defaults(), fetch_statentries_for_relation(), fmgr_sql_validator(), func_get_detail(), generate_partition_qual(), generateClonedExtStatsStmt(), generateClonedIndexStmt(), GenerateTypeDependencies(), get_dependent_generated_columns(), get_partition_bound_spec(), get_qual_for_range(), get_relation_constraints(), get_relation_statistics(), get_typdefault(), index_concurrently_create_copy(), inline_function(), inline_sql_function_in_from(), load_domaintype_info(), make_ruledef(), make_viewdef(), MergeAttributes(), MergeWithExistingConstraint(), pg_get_constraintdef_worker(), pg_get_expr_worker(), pg_get_function_arg_default(), pg_get_indexdef_worker(), pg_get_partkeydef_worker(), pg_get_statisticsobj_worker(), pg_get_statisticsobjdef_expressions(), pg_get_triggerdef_worker(), pgoutput_row_filter_init(), print_function_arguments(), print_function_sqlbody(), ProcedureCreate(), pub_rf_contains_invalid_column(), QueueCheckConstraintValidation(), RelationBuildPartitionDesc(), RelationBuildPartitionKey(), RelationBuildRowSecurity(), RelationBuildRuleLock(), RelationGetDummyIndexExpressions(), RelationGetIndexAttrBitmap(), RelationGetIndexExpressions(), RelationGetIndexPredicate(), sql_compile_callback(), TriggerEnabled(), TupleDescGetDefault(), TypeCreate(), and validateDomainCheckConstraint().