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 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_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 NodenewNode (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, uintptr_t 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 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)
 

Macro Definition Documentation

◆ AGGSPLITOP_COMBINE

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

Definition at line 367 of file nodes.h.

◆ AGGSPLITOP_DESERIALIZE

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

Definition at line 370 of file nodes.h.

◆ AGGSPLITOP_SERIALIZE

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

Definition at line 369 of file nodes.h.

◆ AGGSPLITOP_SKIPFINAL

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

Definition at line 368 of file nodes.h.

◆ castNode

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

Definition at line 176 of file nodes.h.

◆ copyObject

#define copyObject (   obj)    copyObjectImpl(obj)

Definition at line 224 of file nodes.h.

◆ DO_AGGSPLIT_COMBINE

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

Definition at line 384 of file nodes.h.

◆ DO_AGGSPLIT_DESERIALIZE

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

Definition at line 387 of file nodes.h.

◆ DO_AGGSPLIT_SERIALIZE

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

Definition at line 386 of file nodes.h.

◆ DO_AGGSPLIT_SKIPFINAL

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

Definition at line 385 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)
@ JOIN_FULL
Definition: nodes.h:295
@ JOIN_RIGHT
Definition: nodes.h:296
@ JOIN_LEFT
Definition: nodes.h:294
@ JOIN_RIGHT_ANTI
Definition: nodes.h:309
@ JOIN_ANTI
Definition: nodes.h:308

Definition at line 337 of file nodes.h.

◆ IsA

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

Definition at line 158 of file nodes.h.

◆ makeNode

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

Definition at line 155 of file nodes.h.

◆ NodeSetTag

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

Definition at line 156 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 252 of file nodes.h.

◆ CmdType

typedef enum CmdType CmdType

◆ Cost

typedef double Cost

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

◆ ParseLoc

typedef int ParseLoc

Definition at line 240 of file nodes.h.

◆ Selectivity

typedef double Selectivity

Definition at line 250 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 373 of file nodes.h.

374 {
375  /* Basic, non-split aggregation: */
376  AGGSPLIT_SIMPLE = 0,
377  /* Initial phase of partial aggregation, with serialization: */
379  /* Final phase of partial aggregation, with deserialization: */
381 } AggSplit;
#define AGGSPLITOP_DESERIALIZE
Definition: nodes.h:370
#define AGGSPLITOP_SKIPFINAL
Definition: nodes.h:368
#define AGGSPLITOP_SERIALIZE
Definition: nodes.h:369
AggSplit
Definition: nodes.h:374
@ AGGSPLIT_FINAL_DESERIAL
Definition: nodes.h:380
@ AGGSPLIT_SIMPLE
Definition: nodes.h:376
@ AGGSPLIT_INITIAL_SERIAL
Definition: nodes.h:378
#define AGGSPLITOP_COMBINE
Definition: nodes.h:367

◆ AggStrategy

Enumerator
AGG_PLAIN 
AGG_SORTED 
AGG_HASHED 
AGG_MIXED 

Definition at line 351 of file nodes.h.

352 {
353  AGG_PLAIN, /* simple agg across all input rows */
354  AGG_SORTED, /* grouped agg, input must be sorted */
355  AGG_HASHED, /* grouped agg, use internal hashtable */
356  AGG_MIXED, /* grouped agg, hash and sort both used */
357 } AggStrategy;
AggStrategy
Definition: nodes.h:352
@ AGG_SORTED
Definition: nodes.h:354
@ AGG_HASHED
Definition: nodes.h:355
@ AGG_MIXED
Definition: nodes.h:356
@ AGG_PLAIN
Definition: nodes.h:353

◆ CmdType

enum CmdType
Enumerator
CMD_UNKNOWN 
CMD_SELECT 
CMD_UPDATE 
CMD_INSERT 
CMD_DELETE 
CMD_MERGE 
CMD_UTILITY 
CMD_NOTHING 

Definition at line 262 of file nodes.h.

263 {
264  CMD_UNKNOWN,
265  CMD_SELECT, /* select stmt */
266  CMD_UPDATE, /* update stmt */
267  CMD_INSERT, /* insert stmt */
268  CMD_DELETE, /* delete stmt */
269  CMD_MERGE, /* merge stmt */
270  CMD_UTILITY, /* cmds like create, destroy, copy, vacuum,
271  * etc. */
272  CMD_NOTHING, /* dummy command for instead nothing rules
273  * with qual */
274 } CmdType;
CmdType
Definition: nodes.h:263
@ CMD_MERGE
Definition: nodes.h:269
@ CMD_UTILITY
Definition: nodes.h:270
@ CMD_INSERT
Definition: nodes.h:267
@ CMD_DELETE
Definition: nodes.h:268
@ CMD_UNKNOWN
Definition: nodes.h:264
@ CMD_UPDATE
Definition: nodes.h:266
@ CMD_SELECT
Definition: nodes.h:265
@ CMD_NOTHING
Definition: nodes.h:272

◆ JoinType

enum JoinType
Enumerator
JOIN_INNER 
JOIN_LEFT 
JOIN_FULL 
JOIN_RIGHT 
JOIN_SEMI 
JOIN_ANTI 
JOIN_RIGHT_ANTI 
JOIN_UNIQUE_OUTER 
JOIN_UNIQUE_INNER 

Definition at line 287 of file nodes.h.

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

◆ LimitOption

Enumerator
LIMIT_OPTION_COUNT 
LIMIT_OPTION_WITH_TIES 

Definition at line 428 of file nodes.h.

429 {
430  LIMIT_OPTION_COUNT, /* FETCH FIRST... ONLY */
431  LIMIT_OPTION_WITH_TIES, /* FETCH FIRST... WITH TIES */
432 } LimitOption;
LimitOption
Definition: nodes.h:429
@ LIMIT_OPTION_COUNT
Definition: nodes.h:430
@ LIMIT_OPTION_WITH_TIES
Definition: nodes.h:431

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

416 {
417  ONCONFLICT_NONE, /* No "ON CONFLICT" clause */
418  ONCONFLICT_NOTHING, /* ON CONFLICT ... DO NOTHING */
419  ONCONFLICT_UPDATE, /* ON CONFLICT ... DO UPDATE */
OnConflictAction
Definition: nodes.h:416
@ ONCONFLICT_NONE
Definition: nodes.h:417
@ ONCONFLICT_UPDATE
Definition: nodes.h:419
@ ONCONFLICT_NOTHING
Definition: nodes.h:418

◆ SetOpCmd

enum SetOpCmd
Enumerator
SETOPCMD_INTERSECT 
SETOPCMD_INTERSECT_ALL 
SETOPCMD_EXCEPT 
SETOPCMD_EXCEPT_ALL 

Definition at line 395 of file nodes.h.

396 {
401 } SetOpCmd;
SetOpCmd
Definition: nodes.h:396
@ SETOPCMD_EXCEPT
Definition: nodes.h:399
@ SETOPCMD_EXCEPT_ALL
Definition: nodes.h:400
@ SETOPCMD_INTERSECT_ALL
Definition: nodes.h:398
@ SETOPCMD_INTERSECT
Definition: nodes.h:397

◆ SetOpStrategy

Enumerator
SETOP_SORTED 
SETOP_HASHED 

Definition at line 403 of file nodes.h.

404 {
405  SETOP_SORTED, /* input must be sorted */
406  SETOP_HASHED, /* use internal hashtable */
407 } SetOpStrategy;
SetOpStrategy
Definition: nodes.h:404
@ SETOP_HASHED
Definition: nodes.h:406
@ SETOP_SORTED
Definition: nodes.h:405

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
#define elog(elevel,...)
Definition: elog.h:224
List * list_copy_deep(const List *oldlist)
Definition: list.c:1639
List * list_copy(const List *oldlist)
Definition: list.c:1573
#define nodeTag(nodeptr)
Definition: nodes.h:133
void check_stack_depth(void)
Definition: postgres.c:3531

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

224 {
225  bool retval;
226 
227  if (a == b)
228  return true;
229 
230  /*
231  * note that a!=b, so only one of them can be NULL
232  */
233  if (a == NULL || b == NULL)
234  return false;
235 
236  /*
237  * are they the same type of nodes?
238  */
239  if (nodeTag(a) != nodeTag(b))
240  return false;
241 
242  /* Guard against stack overflow due to overly complex expressions */
244 
245  switch (nodeTag(a))
246  {
247 #include "equalfuncs.switch.c"
248 
249  case T_List:
250  case T_IntList:
251  case T_OidList:
252  case T_XidList:
253  retval = _equalList(a, b);
254  break;
255 
256  default:
257  elog(ERROR, "unrecognized node type: %d",
258  (int) nodeTag(a));
259  retval = false; /* keep compiler quiet */
260  break;
261  }
262 
263  return retval;
264 }
static bool _equalList(const List *a, const List *b)
Definition: equalfuncs.c:156
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_partition_bounds_for_split_list(), check_partitions_for_split(), 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(), find_minmax_agg_replacement_param(), findTargetlistEntrySQL92(), findTargetlistEntrySQL99(), fix_expr_common(), fix_indexqual_operand(), 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(), 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(), transformPartitionCmdForMerge(), transformWindowFuncCall(), and trivial_subqueryscan().

◆ newNode()

static Node* newNode ( size_t  size,
NodeTag  tag 
)
inlinestatic

Definition at line 144 of file nodes.h.

145 {
146  Node *result;
147 
148  Assert(size >= sizeof(Node)); /* need the tag, at least */
149  result = (Node *) palloc0(size);
150  result->type = tag;
151 
152  return result;
153 }
#define Assert(condition)
Definition: c.h:858
void * palloc0(Size size)
Definition: mcxt.c:1346
static pg_noinline void Size size
Definition: slab.c:607
Definition: nodes.h:129
NodeTag type
Definition: nodes.h:130

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

Referenced by _copyExtensibleNode(), and _readExtensibleNode().

◆ nodeToString()

◆ nodeToStringWithLocations()

char* nodeToStringWithLocations ( const void *  obj)

Definition at line 797 of file outfuncs.c.

798 {
799  return nodeToStringInternal(obj, true);
800 }

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 
)

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

590 {
591  Size length,
592  i;
593  int tokenLength;
594  const char *token;
595  Datum res;
596  char *s;
597 
598  /*
599  * read the actual length of the value
600  */
601  token = pg_strtok(&tokenLength);
602  length = atoui(token);
603 
604  token = pg_strtok(&tokenLength); /* read the '[' */
605  if (token == NULL || token[0] != '[')
606  elog(ERROR, "expected \"[\" to start datum, but got \"%s\"; length = %zu",
607  token ? token : "[NULL]", length);
608 
609  if (typbyval)
610  {
611  if (length > (Size) sizeof(Datum))
612  elog(ERROR, "byval datum but length = %zu", length);
613  res = (Datum) 0;
614  s = (char *) (&res);
615  for (i = 0; i < (Size) sizeof(Datum); i++)
616  {
617  token = pg_strtok(&tokenLength);
618  s[i] = (char) atoi(token);
619  }
620  }
621  else if (length <= 0)
622  res = (Datum) NULL;
623  else
624  {
625  s = (char *) palloc(length);
626  for (i = 0; i < length; i++)
627  {
628  token = pg_strtok(&tokenLength);
629  s[i] = (char) atoi(token);
630  }
631  res = PointerGetDatum(s);
632  }
633 
634  token = pg_strtok(&tokenLength); /* read the ']' */
635  if (token == NULL || token[0] != ']')
636  elog(ERROR, "expected \"]\" to end datum, but got \"%s\"; length = %zu",
637  token ? token : "[NULL]", length);
638 
639  return res;
640 }
size_t Size
Definition: c.h:605
#define token
Definition: indent_globs.h:126
int i
Definition: isn.c:73
void * palloc(Size size)
Definition: mcxt.c:1316
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(), res, and token.

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 }
const char * str
static void * stringToNodeInternal(const char *str, bool restore_loc_fields)
Definition: read.c:49

References str, and stringToNodeInternal().

Referenced by AddRelationNewConstraints(), AlterPolicy(), AlterPublicationTables(), ATExecValidateConstraint(), 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_partition_bound_spec(), 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(), TupleDescGetDefault(), TypeCreate(), and validateDomainCheckConstraint().