PostgreSQL Source Code  git master
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros
print.h File Reference
Include dependency graph for print.h:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Macros

#define nodeDisplay(x)   pprint(x)
 

Functions

void print (const void *obj)
 
void pprint (const void *obj)
 
void elog_node_display (int lev, const char *title, const void *obj, bool pretty)
 
char * format_node_dump (const char *dump)
 
char * pretty_format_node_dump (const char *dump)
 
void print_rt (const List *rtable)
 
void print_expr (const Node *expr, const List *rtable)
 
void print_pathkeys (const List *pathkeys, const List *rtable)
 
void print_tl (const List *tlist, const List *rtable)
 
void print_slot (TupleTableSlot *slot)
 

Macro Definition Documentation

#define nodeDisplay (   x)    pprint(x)

Definition at line 20 of file print.h.

Function Documentation

void elog_node_display ( int  lev,
const char *  title,
const void *  obj,
bool  pretty 
)

Definition at line 71 of file print.c.

References ereport, errdetail_internal(), errmsg_internal(), format_node_dump(), nodeToString(), pfree(), and pretty_format_node_dump().

Referenced by pg_plan_query(), and pg_rewrite_query().

72 {
73  char *s;
74  char *f;
75 
76  s = nodeToString(obj);
77  if (pretty)
79  else
80  f = format_node_dump(s);
81  pfree(s);
82  ereport(lev,
83  (errmsg_internal("%s:", title),
84  errdetail_internal("%s", f)));
85  pfree(f);
86 }
char * pretty_format_node_dump(const char *dump)
Definition: print.c:150
int errdetail_internal(const char *fmt,...)
Definition: elog.c:900
void pfree(void *pointer)
Definition: mcxt.c:950
#define ereport(elevel, rest)
Definition: elog.h:122
int errmsg_internal(const char *fmt,...)
Definition: elog.c:827
char * format_node_dump(const char *dump)
Definition: print.c:96
char * nodeToString(const void *obj)
Definition: outfuncs.c:4154
char* format_node_dump ( const char *  dump)

Definition at line 96 of file print.c.

References appendStringInfo(), StringInfoData::data, i, initStringInfo(), and LINELEN.

Referenced by elog_node_display(), and print().

97 {
98 #define LINELEN 78
99  char line[LINELEN + 1];
100  StringInfoData str;
101  int i;
102  int j;
103  int k;
104 
105  initStringInfo(&str);
106  i = 0;
107  for (;;)
108  {
109  for (j = 0; j < LINELEN && dump[i] != '\0'; i++, j++)
110  line[j] = dump[i];
111  if (dump[i] == '\0')
112  break;
113  if (dump[i] == ' ')
114  {
115  /* ok to break at adjacent space */
116  i++;
117  }
118  else
119  {
120  for (k = j - 1; k > 0; k--)
121  if (line[k] == ' ')
122  break;
123  if (k > 0)
124  {
125  /* back up; will reprint all after space */
126  i -= (j - k - 1);
127  j = k;
128  }
129  }
130  line[j] = '\0';
131  appendStringInfo(&str, "%s\n", line);
132  }
133  if (j > 0)
134  {
135  line[j] = '\0';
136  appendStringInfo(&str, "%s\n", line);
137  }
138  return str.data;
139 #undef LINELEN
140 }
void appendStringInfo(StringInfo str, const char *fmt,...)
Definition: stringinfo.c:110
void initStringInfo(StringInfo str)
Definition: stringinfo.c:65
#define LINELEN
int i
void pprint ( const void *  obj)

Definition at line 53 of file print.c.

References nodeToString(), pfree(), and pretty_format_node_dump().

Referenced by preprocess_expression().

54 {
55  char *s;
56  char *f;
57 
58  s = nodeToString(obj);
60  pfree(s);
61  printf("%s\n", f);
62  fflush(stdout);
63  pfree(f);
64 }
char * pretty_format_node_dump(const char *dump)
Definition: print.c:150
void pfree(void *pointer)
Definition: mcxt.c:950
char * nodeToString(const void *obj)
Definition: outfuncs.c:4154
char* pretty_format_node_dump ( const char *  dump)

Definition at line 150 of file print.c.

References appendStringInfo(), StringInfoData::data, i, INDENTSTOP, initStringInfo(), LINELEN, MAXINDENT, and Min.

Referenced by elog_node_display(), and pprint().

151 {
152 #define INDENTSTOP 3
153 #define MAXINDENT 60
154 #define LINELEN 78
155  char line[LINELEN + 1];
156  StringInfoData str;
157  int indentLev;
158  int indentDist;
159  int i;
160  int j;
161 
162  initStringInfo(&str);
163  indentLev = 0; /* logical indent level */
164  indentDist = 0; /* physical indent distance */
165  i = 0;
166  for (;;)
167  {
168  for (j = 0; j < indentDist; j++)
169  line[j] = ' ';
170  for (; j < LINELEN && dump[i] != '\0'; i++, j++)
171  {
172  line[j] = dump[i];
173  switch (line[j])
174  {
175  case '}':
176  if (j != indentDist)
177  {
178  /* print data before the } */
179  line[j] = '\0';
180  appendStringInfo(&str, "%s\n", line);
181  }
182  /* print the } at indentDist */
183  line[indentDist] = '}';
184  line[indentDist + 1] = '\0';
185  appendStringInfo(&str, "%s\n", line);
186  /* outdent */
187  if (indentLev > 0)
188  {
189  indentLev--;
190  indentDist = Min(indentLev * INDENTSTOP, MAXINDENT);
191  }
192  j = indentDist - 1;
193  /* j will equal indentDist on next loop iteration */
194  /* suppress whitespace just after } */
195  while (dump[i + 1] == ' ')
196  i++;
197  break;
198  case ')':
199  /* force line break after ), unless another ) follows */
200  if (dump[i + 1] != ')')
201  {
202  line[j + 1] = '\0';
203  appendStringInfo(&str, "%s\n", line);
204  j = indentDist - 1;
205  while (dump[i + 1] == ' ')
206  i++;
207  }
208  break;
209  case '{':
210  /* force line break before { */
211  if (j != indentDist)
212  {
213  line[j] = '\0';
214  appendStringInfo(&str, "%s\n", line);
215  }
216  /* indent */
217  indentLev++;
218  indentDist = Min(indentLev * INDENTSTOP, MAXINDENT);
219  for (j = 0; j < indentDist; j++)
220  line[j] = ' ';
221  line[j] = dump[i];
222  break;
223  case ':':
224  /* force line break before : */
225  if (j != indentDist)
226  {
227  line[j] = '\0';
228  appendStringInfo(&str, "%s\n", line);
229  }
230  j = indentDist;
231  line[j] = dump[i];
232  break;
233  }
234  }
235  line[j] = '\0';
236  if (dump[i] == '\0')
237  break;
238  appendStringInfo(&str, "%s\n", line);
239  }
240  if (j > 0)
241  appendStringInfo(&str, "%s\n", line);
242  return str.data;
243 #undef INDENTSTOP
244 #undef MAXINDENT
245 #undef LINELEN
246 }
#define Min(x, y)
Definition: c.h:806
void appendStringInfo(StringInfo str, const char *fmt,...)
Definition: stringinfo.c:110
void initStringInfo(StringInfo str)
Definition: stringinfo.c:65
#define MAXINDENT
#define LINELEN
#define INDENTSTOP
int i
void print ( const void *  obj)

Definition at line 35 of file print.c.

References format_node_dump(), nodeToString(), and pfree().

36 {
37  char *s;
38  char *f;
39 
40  s = nodeToString(obj);
41  f = format_node_dump(s);
42  pfree(s);
43  printf("%s\n", f);
44  fflush(stdout);
45  pfree(f);
46 }
void pfree(void *pointer)
Definition: mcxt.c:950
char * format_node_dump(const char *dump)
Definition: print.c:96
char * nodeToString(const void *obj)
Definition: outfuncs.c:4154
void print_expr ( const Node expr,
const List rtable 
)

Definition at line 312 of file print.c.

References Alias::aliasname, FuncExpr::args, OpExpr::args, Assert, Const::constisnull, Const::consttype, Const::constvalue, RangeTblEntry::eref, FuncExpr::funcid, get_func_name(), get_leftop(), get_opname(), get_rightop(), get_rte_attribute_name(), getTypeOutputInfo(), INDEX_VAR, INNER_VAR, IsA, lfirst, list_length(), lnext, NULL, OidOutputFunctionCall(), OpExpr::opno, OUTER_VAR, pfree(), print_expr(), rt_fetch, Var::varattno, and Var::varno.

Referenced by print_expr(), print_pathkeys(), and print_tl().

313 {
314  if (expr == NULL)
315  {
316  printf("<>");
317  return;
318  }
319 
320  if (IsA(expr, Var))
321  {
322  const Var *var = (const Var *) expr;
323  char *relname,
324  *attname;
325 
326  switch (var->varno)
327  {
328  case INNER_VAR:
329  relname = "INNER";
330  attname = "?";
331  break;
332  case OUTER_VAR:
333  relname = "OUTER";
334  attname = "?";
335  break;
336  case INDEX_VAR:
337  relname = "INDEX";
338  attname = "?";
339  break;
340  default:
341  {
342  RangeTblEntry *rte;
343 
344  Assert(var->varno > 0 &&
345  (int) var->varno <= list_length(rtable));
346  rte = rt_fetch(var->varno, rtable);
347  relname = rte->eref->aliasname;
348  attname = get_rte_attribute_name(rte, var->varattno);
349  }
350  break;
351  }
352  printf("%s.%s", relname, attname);
353  }
354  else if (IsA(expr, Const))
355  {
356  const Const *c = (const Const *) expr;
357  Oid typoutput;
358  bool typIsVarlena;
359  char *outputstr;
360 
361  if (c->constisnull)
362  {
363  printf("NULL");
364  return;
365  }
366 
368  &typoutput, &typIsVarlena);
369 
370  outputstr = OidOutputFunctionCall(typoutput, c->constvalue);
371  printf("%s", outputstr);
372  pfree(outputstr);
373  }
374  else if (IsA(expr, OpExpr))
375  {
376  const OpExpr *e = (const OpExpr *) expr;
377  char *opname;
378 
379  opname = get_opname(e->opno);
380  if (list_length(e->args) > 1)
381  {
382  print_expr(get_leftop((const Expr *) e), rtable);
383  printf(" %s ", ((opname != NULL) ? opname : "(invalid operator)"));
384  print_expr(get_rightop((const Expr *) e), rtable);
385  }
386  else
387  {
388  /* we print prefix and postfix ops the same... */
389  printf("%s ", ((opname != NULL) ? opname : "(invalid operator)"));
390  print_expr(get_leftop((const Expr *) e), rtable);
391  }
392  }
393  else if (IsA(expr, FuncExpr))
394  {
395  const FuncExpr *e = (const FuncExpr *) expr;
396  char *funcname;
397  ListCell *l;
398 
399  funcname = get_func_name(e->funcid);
400  printf("%s(", ((funcname != NULL) ? funcname : "(invalid function)"));
401  foreach(l, e->args)
402  {
403  print_expr(lfirst(l), rtable);
404  if (lnext(l))
405  printf(",");
406  }
407  printf(")");
408  }
409  else
410  printf("unknown expr");
411 }
Datum constvalue
Definition: primnodes.h:196
#define IsA(nodeptr, _type_)
Definition: nodes.h:573
void getTypeOutputInfo(Oid type, Oid *typOutput, bool *typIsVarlena)
Definition: lsyscache.c:2600
List * args
Definition: primnodes.h:456
AttrNumber varattno
Definition: primnodes.h:168
unsigned int Oid
Definition: postgres_ext.h:31
Definition: primnodes.h:163
Oid consttype
Definition: primnodes.h:192
char * get_opname(Oid opno)
Definition: lsyscache.c:1087
void pfree(void *pointer)
Definition: mcxt.c:950
Oid funcid
Definition: primnodes.h:448
char * get_func_name(Oid funcid)
Definition: lsyscache.c:1380
Node * get_leftop(const Expr *clause)
Definition: clauses.c:198
char * c
void print_expr(const Node *expr, const List *rtable)
Definition: print.c:312
#define lnext(lc)
Definition: pg_list.h:105
#define rt_fetch(rangetable_index, rangetable)
Definition: parsetree.h:31
Index varno
Definition: primnodes.h:166
#define INNER_VAR
Definition: primnodes.h:153
char * get_rte_attribute_name(RangeTblEntry *rte, AttrNumber attnum)
#define NULL
Definition: c.h:229
#define Assert(condition)
Definition: c.h:675
#define lfirst(lc)
Definition: pg_list.h:106
char * aliasname
Definition: primnodes.h:42
static int list_length(const List *l)
Definition: pg_list.h:89
Node * get_rightop(const Expr *clause)
Definition: clauses.c:215
e
Definition: preproc-init.c:82
char * OidOutputFunctionCall(Oid functionId, Datum val)
Definition: fmgr.c:2056
Oid opno
Definition: primnodes.h:495
Alias * eref
Definition: parsenodes.h:1000
List * args
Definition: primnodes.h:501
#define INDEX_VAR
Definition: primnodes.h:155
#define OUTER_VAR
Definition: primnodes.h:154
bool constisnull
Definition: primnodes.h:197
void print_pathkeys ( const List pathkeys,
const List rtable 
)

Definition at line 418 of file print.c.

References EquivalenceClass::ec_members, EquivalenceClass::ec_merged, eclass(), EquivalenceMember::em_expr, i, lfirst, lnext, PathKey::pk_eclass, and print_expr().

419 {
420  const ListCell *i;
421 
422  printf("(");
423  foreach(i, pathkeys)
424  {
425  PathKey *pathkey = (PathKey *) lfirst(i);
427  ListCell *k;
428  bool first = true;
429 
430  eclass = pathkey->pk_eclass;
431  /* chase up, in case pathkey is non-canonical */
432  while (eclass->ec_merged)
433  eclass = eclass->ec_merged;
434 
435  printf("(");
436  foreach(k, eclass->ec_members)
437  {
439 
440  if (first)
441  first = false;
442  else
443  printf(", ");
444  print_expr((Node *) mem->em_expr, rtable);
445  }
446  printf(")");
447  if (lnext(i))
448  printf(", ");
449  }
450  printf(")\n");
451 }
Definition: nodes.h:522
static struct cvec * eclass(struct vars *v, chr c, int cases)
Definition: regc_locale.c:508
void print_expr(const Node *expr, const List *rtable)
Definition: print.c:312
#define lnext(lc)
Definition: pg_list.h:105
#define lfirst(lc)
Definition: pg_list.h:106
EquivalenceClass * pk_eclass
Definition: relation.h:814
int i
struct EquivalenceClass * ec_merged
Definition: relation.h:749
List * ec_members
Definition: relation.h:737
void print_rt ( const List rtable)

Definition at line 253 of file print.c.

References Alias::aliasname, RangeTblEntry::eref, i, RangeTblEntry::inFromCl, RangeTblEntry::inh, lfirst, RangeTblEntry::relid, RangeTblEntry::relkind, RTE_CTE, RTE_FUNCTION, RTE_JOIN, RTE_RELATION, RTE_SUBQUERY, RTE_TABLEFUNC, RTE_VALUES, and RangeTblEntry::rtekind.

254 {
255  const ListCell *l;
256  int i = 1;
257 
258  printf("resno\trefname \trelid\tinFromCl\n");
259  printf("-----\t---------\t-----\t--------\n");
260  foreach(l, rtable)
261  {
262  RangeTblEntry *rte = lfirst(l);
263 
264  switch (rte->rtekind)
265  {
266  case RTE_RELATION:
267  printf("%d\t%s\t%u\t%c",
268  i, rte->eref->aliasname, rte->relid, rte->relkind);
269  break;
270  case RTE_SUBQUERY:
271  printf("%d\t%s\t[subquery]",
272  i, rte->eref->aliasname);
273  break;
274  case RTE_JOIN:
275  printf("%d\t%s\t[join]",
276  i, rte->eref->aliasname);
277  break;
278  case RTE_FUNCTION:
279  printf("%d\t%s\t[rangefunction]",
280  i, rte->eref->aliasname);
281  break;
282  case RTE_TABLEFUNC:
283  printf("%d\t%s\t[table function]",
284  i, rte->eref->aliasname);
285  break;
286  case RTE_VALUES:
287  printf("%d\t%s\t[values list]",
288  i, rte->eref->aliasname);
289  break;
290  case RTE_CTE:
291  printf("%d\t%s\t[cte]",
292  i, rte->eref->aliasname);
293  break;
294  default:
295  printf("%d\t%s\t[unknown rtekind]",
296  i, rte->eref->aliasname);
297  }
298 
299  printf("\t%s\t%s\n",
300  (rte->inh ? "inh" : ""),
301  (rte->inFromCl ? "inFromCl" : ""));
302  i++;
303  }
304 }
#define lfirst(lc)
Definition: pg_list.h:106
char * aliasname
Definition: primnodes.h:42
RTEKind rtekind
Definition: parsenodes.h:916
int i
Alias * eref
Definition: parsenodes.h:1000
void print_slot ( TupleTableSlot slot)

Definition at line 484 of file print.c.

References debugtup(), NULL, TupleTableSlot::tts_tupleDescriptor, and TupIsNull.

485 {
486  if (TupIsNull(slot))
487  {
488  printf("tuple is null.\n");
489  return;
490  }
491  if (!slot->tts_tupleDescriptor)
492  {
493  printf("no tuple descriptor.\n");
494  return;
495  }
496 
497  debugtup(slot, NULL);
498 }
#define TupIsNull(slot)
Definition: tuptable.h:138
TupleDesc tts_tupleDescriptor
Definition: tuptable.h:121
#define NULL
Definition: c.h:229
bool debugtup(TupleTableSlot *slot, DestReceiver *self)
Definition: printtup.c:532
void print_tl ( const List tlist,
const List rtable 
)

Definition at line 458 of file print.c.

References TargetEntry::expr, lfirst, print_expr(), TargetEntry::resname, TargetEntry::resno, and TargetEntry::ressortgroupref.

459 {
460  const ListCell *tl;
461 
462  printf("(\n");
463  foreach(tl, tlist)
464  {
465  TargetEntry *tle = (TargetEntry *) lfirst(tl);
466 
467  printf("\t%d %s\t", tle->resno,
468  tle->resname ? tle->resname : "<null>");
469  if (tle->ressortgroupref != 0)
470  printf("(%u):\t", tle->ressortgroupref);
471  else
472  printf(" :\t");
473  print_expr((Node *) tle->expr, rtable);
474  printf("\n");
475  }
476  printf(")\n");
477 }
Definition: nodes.h:522
char * resname
Definition: primnodes.h:1354
AttrNumber resno
Definition: primnodes.h:1353
void print_expr(const Node *expr, const List *rtable)
Definition: print.c:312
#define lfirst(lc)
Definition: pg_list.h:106
Expr * expr
Definition: primnodes.h:1352
Index ressortgroupref
Definition: primnodes.h:1355