#include "nodes/nodetags.h"

Include dependency graph for nodes.h:

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

Data Structures
struct	Node

Macros
#define	pg_node_attr(...)

#define	nodeTag(nodeptr) (((const Node*)(nodeptr))->type)

#define	newNode(size, tag)

#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 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_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 , LIMIT_OPTION_DEFAULT }

Functions
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, uintptr_t value, int typlen, bool typbyval)

char *	nodeToString (const void *obj)

char *	bmsToString (const struct Bitmapset *bms)

void *	stringToNode (const char *str)

struct Bitmapset *	readBitmapset (void)

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

Variables
PGDLLIMPORT Node *	newNodeMacroHolder

Macro Definition Documentation

◆ AGGSPLITOP_COMBINE

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

Definition at line 359 of file nodes.h.

◆ AGGSPLITOP_DESERIALIZE

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

Definition at line 362 of file nodes.h.

◆ AGGSPLITOP_SERIALIZE

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

Definition at line 361 of file nodes.h.

◆ AGGSPLITOP_SKIPFINAL

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

Definition at line 360 of file nodes.h.

◆ castNode

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

Definition at line 180 of file nodes.h.

◆ copyObject

#define copyObject ( obj ) copyObjectImpl(obj)

Definition at line 227 of file nodes.h.

◆ DO_AGGSPLIT_COMBINE

#define DO_AGGSPLIT_COMBINE ( as ) (((as) & AGGSPLITOP_COMBINE) != 0)

Definition at line 376 of file nodes.h.

◆ DO_AGGSPLIT_DESERIALIZE

#define DO_AGGSPLIT_DESERIALIZE ( as ) (((as) & AGGSPLITOP_DESERIALIZE) != 0)

Definition at line 379 of file nodes.h.

◆ DO_AGGSPLIT_SERIALIZE

#define DO_AGGSPLIT_SERIALIZE ( as ) (((as) & AGGSPLITOP_SERIALIZE) != 0)

Definition at line 378 of file nodes.h.

◆ DO_AGGSPLIT_SKIPFINAL

#define DO_AGGSPLIT_SKIPFINAL ( as ) (((as) & AGGSPLITOP_SKIPFINAL) != 0)

Definition at line 377 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))) != 0)

Definition at line 330 of file nodes.h.

◆ IsA

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

Definition at line 162 of file nodes.h.

◆ makeNode

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

Definition at line 159 of file nodes.h.

◆ newNode

#define newNode	(	size,
		tag
	)

Value:

( \
    AssertMacro((size) >= sizeof(Node)),        /* need the tag, at least */ \
    newNodeMacroHolder = (Node *) palloc0fast(size), \
    newNodeMacroHolder->type = (tag), \
    newNodeMacroHolder \
)

Definition at line 149 of file nodes.h.

◆ NodeSetTag

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

Definition at line 160 of file nodes.h.

◆ nodeTag

#define nodeTag ( nodeptr ) (((const Node*)(nodeptr))->type)

Definition at line 116 of file nodes.h.

◆ pg_node_attr

#define pg_node_attr ( ... )

Definition at line 103 of file nodes.h.

Typedef Documentation

◆ AggSplit

typedef enum AggSplit AggSplit

◆ AggStrategy

typedef enum AggStrategy AggStrategy

◆ Cardinality

typedef double Cardinality

Definition at line 246 of file nodes.h.

◆ CmdType

typedef enum CmdType CmdType

◆ Cost

typedef double Cost

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

◆ Selectivity

typedef double Selectivity

Definition at line 244 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 365 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 343 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 256 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_UNIQUE_OUTER
JOIN_UNIQUE_INNER

Definition at line 281 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 */
  
     /*
      * 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 path must be made unique */
     JOIN_UNIQUE_INNER           /* RHS path must be made unique */
  
     /*
      * We might need additional join types someday.
      */
 } JoinType;

◆ LimitOption

enum LimitOption

Enumerator
LIMIT_OPTION_COUNT
LIMIT_OPTION_WITH_TIES
LIMIT_OPTION_DEFAULT

Definition at line 420 of file nodes.h.

 {
     LIMIT_OPTION_COUNT,         /* FETCH FIRST... ONLY */
     LIMIT_OPTION_WITH_TIES,     /* FETCH FIRST... WITH TIES */
     LIMIT_OPTION_DEFAULT,       /* No limit present */
 } 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 407 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 387 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 395 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 )

◆ copyObjectImpl()

void* copyObjectImpl ( const void * from )

Definition at line 171 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 = 0;         /* keep compiler quiet */
             break;
     }
  
     return retval;
 }

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

Referenced by list_copy_deep().

◆ equal()

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

Definition at line 219 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, 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_length_hist_frac(), check_new_partition_bound(), check_ungrouped_columns_walker(), clause_is_strict_for(), CompareIndexInfo(), convert_subquery_pathkeys(), create_projection_path(), CreateStatistics(), deparseParam(), deparseVar(), dependencies_clauselist_selectivity(), dependency_is_compatible_expression(), ec_member_matches_foreign(), equalPolicy(), equalRuleLocks(), 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(), findTargetlistEntrySQL92(), findTargetlistEntrySQL99(), fix_expr_common(), fix_indexqual_operand(), fix_scan_expr_mutator(), fix_upper_expr_mutator(), get_eclass_for_sort_expr(), get_partition_for_tuple(), get_relation_column_alias_ids(), grouping_planner(), infer_collation_opclass_match(), is_exprlist_member(), length_hist_bsearch(), list_delete(), list_member(), match_boolean_partition_clause(), match_clause_to_partition_key(), match_eclasses_to_foreign_key_col(), match_expr_to_partition_keys(), match_index_to_operand(), matches_boolean_partition_clause(), maybe_reread_subscription(), mcv_match_expression(), MergeAttributes(), MergeCheckConstraint(), MergeWithExistingConstraint(), operator_predicate_proof(), 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(), recomputeNamespacePath(), reconsider_full_join_clause(), reconsider_outer_join_clause(), RelationGetIndexAttrBitmap(), replace_nestloop_param_placeholdervar(), replace_nestloop_param_var(), search_indexed_tlist_for_sortgroupref(), stat_find_expression(), tlist_member(), tlist_same_exprs(), transformIndexConstraints(), transformPartitionBound(), transformWindowFuncCall(), and trivial_subqueryscan().

◆ nodeToString()

char* nodeToString ( const void * obj )

Definition at line 873 of file outfuncs.c.

 {
     StringInfoData str;
  
     /* see stringinfo.h for an explanation of this maneuver */
     initStringInfo(&str);
     outNode(&str, obj);
     return str.data;
 }

References initStringInfo(), outNode(), and generate_unaccent_rules::str.

Referenced by AlterDomainDefault(), AlterPolicy(), CreatePolicy(), CreateStatistics(), CreateTriggerFiringOn(), DefineDomain(), DetachAddConstraintIfNeeded(), domainAddConstraint(), elog_node_display(), ExecSerializePlan(), expandTableLikeClause(), InsertRule(), pg_parse_query(), pg_plan_query(), pg_rewrite_query(), pprint(), print(), ProcedureCreate(), publication_add_relation(), StoreAttrDefault(), StorePartitionBound(), StorePartitionKey(), StoreRelCheck(), and UpdateIndexRelation().

◆ outBitmapset()

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

◆ outDatum()

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

◆ outNode()

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

◆ outToken()

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

◆ readAttrNumberCols()

int16* readAttrNumberCols ( int numCols )

◆ readBitmapset()

struct Bitmapset* readBitmapset ( void )

Definition at line 240 of file readfuncs.c.

 {
     return _readBitmapset();
 }

References _readBitmapset().

◆ readBoolCols()

bool* readBoolCols ( int numCols )

◆ readDatum()

uintptr_t readDatum ( bool typbyval )

Definition at line 704 of file readfuncs.c.

 {
     Size        length,
                 i;
     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 (i = 0; i < (Size) sizeof(Datum); i++)
         {
             token = pg_strtok(&tokenLength);
             s[i] = (char) atoi(token);
         }
     }
     else if (length <= 0)
         res = (Datum) NULL;
     else
     {
         s = (char *) palloc(length);
         for (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, i, palloc(), pg_strtok(), PointerGetDatum(), and res.

Referenced by _readConst().

◆ readIntCols()

int* readIntCols ( int numCols )

◆ readOidCols()

Oid* readOidCols ( int numCols )

◆ stringToNode()

void* stringToNode ( const char * str )

Definition at line 89 of file read.c.

 {
     return stringToNodeInternal(str, false);
 }

References generate_unaccent_rules::str, and stringToNodeInternal().

Referenced by AddRelationNewConstraints(), AlterPolicy(), AlterPublicationTables(), ATExecValidateConstraint(), build_column_default(), CloneRowTriggersToPartition(), ConstraintImpliedByRelConstraint(), ExecParallelGetQueryDesc(), ExecRelCheck(), expandTableLikeClause(), fetch_function_defaults(), fetch_statentries_for_relation(), fill_extraUpdatedCols(), fmgr_sql_validator(), func_get_detail(), generate_partition_qual(), generateClonedExtStatsStmt(), generateClonedIndexStmt(), GenerateTypeDependencies(), get_qual_for_range(), get_relation_constraints(), get_relation_statistics(), get_typdefault(), index_concurrently_create_copy(), init_sql_fcache(), inline_function(), inline_set_returning_function(), 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(), RelationBuildPartitionDesc(), RelationBuildPartitionKey(), RelationBuildRowSecurity(), RelationBuildRuleLock(), RelationGetDummyIndexExpressions(), RelationGetIndexAttrBitmap(), RelationGetIndexExpressions(), RelationGetIndexPredicate(), TriggerEnabled(), TypeCreate(), and validateDomainConstraint().

Variable Documentation

◆ newNodeMacroHolder

PGDLLIMPORT Node* newNodeMacroHolder

extern

Definition at line 31 of file nodes.c.

Data Structures

Macros

Typedefs

Enumerations

Functions

Variables

Macro Definition Documentation

◆ AGGSPLITOP_COMBINE

◆ AGGSPLITOP_DESERIALIZE

◆ AGGSPLITOP_SERIALIZE

◆ AGGSPLITOP_SKIPFINAL

◆ castNode

◆ copyObject

◆ DO_AGGSPLIT_COMBINE

◆ DO_AGGSPLIT_DESERIALIZE

◆ DO_AGGSPLIT_SERIALIZE

◆ DO_AGGSPLIT_SKIPFINAL

◆ IS_OUTER_JOIN

◆ IsA

◆ makeNode

◆ newNode

◆ NodeSetTag

◆ nodeTag

◆ pg_node_attr

Typedef Documentation

◆ AggSplit

◆ AggStrategy

◆ Cardinality

◆ CmdType

◆ Cost

◆ JoinType

◆ LimitOption

◆ Node

◆ NodeTag

◆ OnConflictAction

◆ Selectivity

◆ SetOpCmd

◆ SetOpStrategy

Enumeration Type Documentation

◆ AggSplit

◆ AggStrategy

◆ CmdType

◆ JoinType

◆ LimitOption

◆ NodeTag

◆ OnConflictAction

◆ SetOpCmd

◆ SetOpStrategy

Function Documentation

◆ bmsToString()

◆ copyObjectImpl()

◆ equal()

◆ nodeToString()

◆ outBitmapset()

◆ outDatum()

◆ outNode()

◆ outToken()

◆ readAttrNumberCols()

◆ readBitmapset()

◆ readBoolCols()

◆ readDatum()

◆ readIntCols()

◆ readOidCols()

◆ stringToNode()

Variable Documentation

◆ newNodeMacroHolder