PostgreSQL Source Code  git master
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 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 BitmapsetreadBitmapset (void)
 
uintptr_t readDatum (bool typbyval)
 
boolreadBoolCols (int numCols)
 
int * readIntCols (int numCols)
 
OidreadOidCols (int numCols)
 
int16readAttrNumberCols (int numCols)
 
void * copyObjectImpl (const void *from)
 
bool equal (const void *a, const void *b)
 

Variables

PGDLLIMPORT NodenewNodeMacroHolder
 

Macro Definition Documentation

◆ AGGSPLITOP_COMBINE

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

Definition at line 376 of file nodes.h.

◆ AGGSPLITOP_DESERIALIZE

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

Definition at line 379 of file nodes.h.

◆ AGGSPLITOP_SERIALIZE

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

Definition at line 378 of file nodes.h.

◆ AGGSPLITOP_SKIPFINAL

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

Definition at line 377 of file nodes.h.

◆ castNode

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

Definition at line 197 of file nodes.h.

◆ copyObject

#define copyObject (   obj)    copyObjectImpl(obj)

Definition at line 244 of file nodes.h.

◆ DO_AGGSPLIT_COMBINE

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

Definition at line 393 of file nodes.h.

◆ DO_AGGSPLIT_DESERIALIZE

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

Definition at line 396 of file nodes.h.

◆ DO_AGGSPLIT_SERIALIZE

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

Definition at line 395 of file nodes.h.

◆ DO_AGGSPLIT_SKIPFINAL

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

Definition at line 394 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)
@ JOIN_FULL
Definition: nodes.h:306
@ JOIN_RIGHT
Definition: nodes.h:307
@ JOIN_LEFT
Definition: nodes.h:305
@ JOIN_ANTI
Definition: nodes.h:319

Definition at line 347 of file nodes.h.

◆ IsA

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

Definition at line 179 of file nodes.h.

◆ makeNode

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

Definition at line 176 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), \
)
PGDLLIMPORT Node * newNodeMacroHolder
Definition: nodes.c:31
#define palloc0fast(sz)
Definition: palloc.h:120
Definition: nodes.h:129

Definition at line 166 of file nodes.h.

◆ NodeSetTag

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

Definition at line 177 of file nodes.h.

◆ nodeTag

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

Definition at line 133 of file nodes.h.

◆ pg_node_attr

#define pg_node_attr (   ...)

Definition at line 120 of file nodes.h.

Typedef Documentation

◆ AggSplit

typedef enum AggSplit AggSplit

◆ AggStrategy

typedef enum AggStrategy AggStrategy

◆ Cardinality

typedef double Cardinality

Definition at line 263 of file nodes.h.

◆ CmdType

typedef enum CmdType CmdType

◆ Cost

typedef double Cost

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

◆ Selectivity

typedef double Selectivity

Definition at line 261 of file nodes.h.

◆ SetOpCmd

typedef enum SetOpCmd SetOpCmd

◆ SetOpStrategy

Enumeration Type Documentation

◆ AggSplit

enum AggSplit
Enumerator
AGGSPLIT_SIMPLE 
AGGSPLIT_INITIAL_SERIAL 
AGGSPLIT_FINAL_DESERIAL 

Definition at line 382 of file nodes.h.

383 {
384  /* Basic, non-split aggregation: */
385  AGGSPLIT_SIMPLE = 0,
386  /* Initial phase of partial aggregation, with serialization: */
388  /* Final phase of partial aggregation, with deserialization: */
390 } AggSplit;
#define AGGSPLITOP_DESERIALIZE
Definition: nodes.h:379
#define AGGSPLITOP_SKIPFINAL
Definition: nodes.h:377
#define AGGSPLITOP_SERIALIZE
Definition: nodes.h:378
AggSplit
Definition: nodes.h:383
@ AGGSPLIT_FINAL_DESERIAL
Definition: nodes.h:389
@ AGGSPLIT_SIMPLE
Definition: nodes.h:385
@ AGGSPLIT_INITIAL_SERIAL
Definition: nodes.h:387
#define AGGSPLITOP_COMBINE
Definition: nodes.h:376

◆ AggStrategy

Enumerator
AGG_PLAIN 
AGG_SORTED 
AGG_HASHED 
AGG_MIXED 

Definition at line 360 of file nodes.h.

361 {
362  AGG_PLAIN, /* simple agg across all input rows */
363  AGG_SORTED, /* grouped agg, input must be sorted */
364  AGG_HASHED, /* grouped agg, use internal hashtable */
365  AGG_MIXED /* grouped agg, hash and sort both used */
366 } AggStrategy;
AggStrategy
Definition: nodes.h:361
@ AGG_SORTED
Definition: nodes.h:363
@ AGG_HASHED
Definition: nodes.h:364
@ AGG_MIXED
Definition: nodes.h:365
@ AGG_PLAIN
Definition: nodes.h:362

◆ CmdType

enum CmdType
Enumerator
CMD_UNKNOWN 
CMD_SELECT 
CMD_UPDATE 
CMD_INSERT 
CMD_DELETE 
CMD_MERGE 
CMD_UTILITY 
CMD_NOTHING 

Definition at line 273 of file nodes.h.

274 {
275  CMD_UNKNOWN,
276  CMD_SELECT, /* select stmt */
277  CMD_UPDATE, /* update stmt */
278  CMD_INSERT, /* insert stmt */
279  CMD_DELETE, /* delete stmt */
280  CMD_MERGE, /* merge stmt */
281  CMD_UTILITY, /* cmds like create, destroy, copy, vacuum,
282  * etc. */
283  CMD_NOTHING /* dummy command for instead nothing rules
284  * with qual */
285 } CmdType;
CmdType
Definition: nodes.h:274
@ CMD_MERGE
Definition: nodes.h:280
@ CMD_UTILITY
Definition: nodes.h:281
@ CMD_INSERT
Definition: nodes.h:278
@ CMD_DELETE
Definition: nodes.h:279
@ CMD_UNKNOWN
Definition: nodes.h:275
@ CMD_UPDATE
Definition: nodes.h:277
@ CMD_SELECT
Definition: nodes.h:276
@ CMD_NOTHING
Definition: nodes.h:283

◆ 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 298 of file nodes.h.

299 {
300  /*
301  * The canonical kinds of joins according to the SQL JOIN syntax. Only
302  * these codes can appear in parser output (e.g., JoinExpr nodes).
303  */
304  JOIN_INNER, /* matching tuple pairs only */
305  JOIN_LEFT, /* pairs + unmatched LHS tuples */
306  JOIN_FULL, /* pairs + unmatched LHS + unmatched RHS */
307  JOIN_RIGHT, /* pairs + unmatched RHS tuples */
308 
309  /*
310  * Semijoins and anti-semijoins (as defined in relational theory) do not
311  * appear in the SQL JOIN syntax, but there are standard idioms for
312  * representing them (e.g., using EXISTS). The planner recognizes these
313  * cases and converts them to joins. So the planner and executor must
314  * support these codes. NOTE: in JOIN_SEMI output, it is unspecified
315  * which matching RHS row is joined to. In JOIN_ANTI output, the row is
316  * guaranteed to be null-extended.
317  */
318  JOIN_SEMI, /* 1 copy of each LHS row that has match(es) */
319  JOIN_ANTI, /* 1 copy of each LHS row that has no match */
320 
321  /*
322  * These codes are used internally in the planner, but are not supported
323  * by the executor (nor, indeed, by most of the planner).
324  */
325  JOIN_UNIQUE_OUTER, /* LHS path must be made unique */
326  JOIN_UNIQUE_INNER /* RHS path must be made unique */
327 
328  /*
329  * We might need additional join types someday.
330  */
331 } JoinType;
JoinType
Definition: nodes.h:299
@ JOIN_SEMI
Definition: nodes.h:318
@ JOIN_INNER
Definition: nodes.h:304
@ JOIN_UNIQUE_OUTER
Definition: nodes.h:325
@ JOIN_UNIQUE_INNER
Definition: nodes.h:326

◆ LimitOption

Enumerator
LIMIT_OPTION_COUNT 
LIMIT_OPTION_WITH_TIES 
LIMIT_OPTION_DEFAULT 

Definition at line 437 of file nodes.h.

438 {
439  LIMIT_OPTION_COUNT, /* FETCH FIRST... ONLY */
440  LIMIT_OPTION_WITH_TIES, /* FETCH FIRST... WITH TIES */
441  LIMIT_OPTION_DEFAULT, /* No limit present */
442 } LimitOption;
LimitOption
Definition: nodes.h:438
@ LIMIT_OPTION_COUNT
Definition: nodes.h:439
@ LIMIT_OPTION_WITH_TIES
Definition: nodes.h:440
@ LIMIT_OPTION_DEFAULT
Definition: nodes.h:441

◆ NodeTag

enum NodeTag
Enumerator
T_Invalid 

Definition at line 26 of file nodes.h.

27 {
28  T_Invalid = 0,
29 
30 #include "nodes/nodetags.h"
31 } NodeTag;
NodeTag
Definition: nodes.h:27
@ T_Invalid
Definition: nodes.h:28

◆ OnConflictAction

Enumerator
ONCONFLICT_NONE 
ONCONFLICT_NOTHING 
ONCONFLICT_UPDATE 

Definition at line 424 of file nodes.h.

425 {
426  ONCONFLICT_NONE, /* No "ON CONFLICT" clause */
427  ONCONFLICT_NOTHING, /* ON CONFLICT ... DO NOTHING */
428  ONCONFLICT_UPDATE /* ON CONFLICT ... DO UPDATE */
OnConflictAction
Definition: nodes.h:425
@ ONCONFLICT_NONE
Definition: nodes.h:426
@ ONCONFLICT_UPDATE
Definition: nodes.h:428
@ ONCONFLICT_NOTHING
Definition: nodes.h:427

◆ SetOpCmd

enum SetOpCmd
Enumerator
SETOPCMD_INTERSECT 
SETOPCMD_INTERSECT_ALL 
SETOPCMD_EXCEPT 
SETOPCMD_EXCEPT_ALL 

Definition at line 404 of file nodes.h.

405 {
410 } SetOpCmd;
SetOpCmd
Definition: nodes.h:405
@ SETOPCMD_EXCEPT
Definition: nodes.h:408
@ SETOPCMD_EXCEPT_ALL
Definition: nodes.h:409
@ SETOPCMD_INTERSECT_ALL
Definition: nodes.h:407
@ SETOPCMD_INTERSECT
Definition: nodes.h:406

◆ SetOpStrategy

Enumerator
SETOP_SORTED 
SETOP_HASHED 

Definition at line 412 of file nodes.h.

413 {
414  SETOP_SORTED, /* input must be sorted */
415  SETOP_HASHED /* use internal hashtable */
416 } SetOpStrategy;
SetOpStrategy
Definition: nodes.h:413
@ SETOP_HASHED
Definition: nodes.h:415
@ SETOP_SORTED
Definition: nodes.h:414

Function Documentation

◆ bmsToString()

char* bmsToString ( const struct Bitmapset bms)

◆ copyObjectImpl()

void* copyObjectImpl ( const void *  from)

Definition at line 177 of file copyfuncs.c.

178 {
179  void *retval;
180 
181  if (from == NULL)
182  return NULL;
183 
184  /* Guard against stack overflow due to overly complex expressions */
186 
187  switch (nodeTag(from))
188  {
189 #include "copyfuncs.switch.c"
190 
191  case T_List:
192  retval = list_copy_deep(from);
193  break;
194 
195  /*
196  * Lists of integers, OIDs and XIDs don't need to be deep-copied,
197  * so we perform a shallow copy via list_copy()
198  */
199  case T_IntList:
200  case T_OidList:
201  case T_XidList:
202  retval = list_copy(from);
203  break;
204 
205  default:
206  elog(ERROR, "unrecognized node type: %d", (int) nodeTag(from));
207  retval = 0; /* keep compiler quiet */
208  break;
209  }
210 
211  return retval;
212 }
#define ERROR
Definition: elog.h:39
List * list_copy_deep(const List *oldlist)
Definition: list.c:1638
List * list_copy(const List *oldlist)
Definition: list.c:1572
#define nodeTag(nodeptr)
Definition: nodes.h:133
void check_stack_depth(void)
Definition: postgres.c:3454

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 225 of file equalfuncs.c.

226 {
227  bool retval;
228 
229  if (a == b)
230  return true;
231 
232  /*
233  * note that a!=b, so only one of them can be NULL
234  */
235  if (a == NULL || b == NULL)
236  return false;
237 
238  /*
239  * are they the same type of nodes?
240  */
241  if (nodeTag(a) != nodeTag(b))
242  return false;
243 
244  /* Guard against stack overflow due to overly complex expressions */
246 
247  switch (nodeTag(a))
248  {
249 #include "equalfuncs.switch.c"
250 
251  case T_List:
252  case T_IntList:
253  case T_OidList:
254  case T_XidList:
255  retval = _equalList(a, b);
256  break;
257 
258  default:
259  elog(ERROR, "unrecognized node type: %d",
260  (int) nodeTag(a));
261  retval = false; /* keep compiler quiet */
262  break;
263  }
264 
265  return retval;
266 }
static bool _equalList(const List *a, const List *b)
Definition: equalfuncs.c:158
int b
Definition: isn.c:70
int a
Definition: isn.c:69

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

◆ 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 245 of file readfuncs.c.

246 {
247  return _readBitmapset();
248 }
static Bitmapset * _readBitmapset(void)
Definition: readfuncs.c:203

References _readBitmapset().

◆ readBoolCols()

bool* readBoolCols ( int  numCols)

◆ readDatum()

uintptr_t readDatum ( bool  typbyval)

Definition at line 709 of file readfuncs.c.

710 {
711  Size length,
712  i;
713  int tokenLength;
714  const char *token;
715  Datum res;
716  char *s;
717 
718  /*
719  * read the actual length of the value
720  */
721  token = pg_strtok(&tokenLength);
722  length = atoui(token);
723 
724  token = pg_strtok(&tokenLength); /* read the '[' */
725  if (token == NULL || token[0] != '[')
726  elog(ERROR, "expected \"[\" to start datum, but got \"%s\"; length = %zu",
727  token ? token : "[NULL]", length);
728 
729  if (typbyval)
730  {
731  if (length > (Size) sizeof(Datum))
732  elog(ERROR, "byval datum but length = %zu", length);
733  res = (Datum) 0;
734  s = (char *) (&res);
735  for (i = 0; i < (Size) sizeof(Datum); i++)
736  {
737  token = pg_strtok(&tokenLength);
738  s[i] = (char) atoi(token);
739  }
740  }
741  else if (length <= 0)
742  res = (Datum) NULL;
743  else
744  {
745  s = (char *) palloc(length);
746  for (i = 0; i < length; i++)
747  {
748  token = pg_strtok(&tokenLength);
749  s[i] = (char) atoi(token);
750  }
751  res = PointerGetDatum(s);
752  }
753 
754  token = pg_strtok(&tokenLength); /* read the ']' */
755  if (token == NULL || token[0] != ']')
756  elog(ERROR, "expected \"]\" to end datum, but got \"%s\"; length = %zu",
757  token ? token : "[NULL]", length);
758 
759  return res;
760 }
size_t Size
Definition: c.h:589
int i
Definition: isn.c:73
void * palloc(Size size)
Definition: mcxt.c:1210
static Datum PointerGetDatum(const void *X)
Definition: postgres.h:322
uintptr_t Datum
Definition: postgres.h:64
const char * pg_strtok(int *length)
Definition: read.c:153
#define atoui(x)
Definition: readfuncs.c:177

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 90 of file read.c.

91 {
92  return stringToNodeInternal(str, false);
93 }
static void * stringToNodeInternal(const char *str, bool restore_loc_fields)
Definition: read.c:49

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(), fmgr_sql_validator(), func_get_detail(), generate_partition_qual(), generateClonedExtStatsStmt(), generateClonedIndexStmt(), GenerateTypeDependencies(), get_dependent_generated_columns(), 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.