PostgreSQL Source Code  git master
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros
print.c File Reference
#include "postgres.h"
#include "access/printtup.h"
#include "lib/stringinfo.h"
#include "nodes/print.h"
#include "optimizer/clauses.h"
#include "parser/parsetree.h"
#include "utils/lsyscache.h"
Include dependency graph for print.c:

Go to the source code of this file.

Macros

#define LINELEN   78
 
#define INDENTSTOP   3
 
#define MAXINDENT   60
 
#define LINELEN   78
 

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 INDENTSTOP   3

Referenced by pretty_format_node_dump().

#define LINELEN   78
#define LINELEN   78
#define MAXINDENT   60

Referenced by pretty_format_node_dump().

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:992
#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:3981
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:992
char * nodeToString(const void *obj)
Definition: outfuncs.c:3981
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:802
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:992
char * format_node_dump(const char *dump)
Definition: print.c:96
char * nodeToString(const void *obj)
Definition: outfuncs.c:3981
void print_expr ( const Node expr,
const List rtable 
)

Definition at line 308 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().

309 {
310  if (expr == NULL)
311  {
312  printf("<>");
313  return;
314  }
315 
316  if (IsA(expr, Var))
317  {
318  const Var *var = (const Var *) expr;
319  char *relname,
320  *attname;
321 
322  switch (var->varno)
323  {
324  case INNER_VAR:
325  relname = "INNER";
326  attname = "?";
327  break;
328  case OUTER_VAR:
329  relname = "OUTER";
330  attname = "?";
331  break;
332  case INDEX_VAR:
333  relname = "INDEX";
334  attname = "?";
335  break;
336  default:
337  {
338  RangeTblEntry *rte;
339 
340  Assert(var->varno > 0 &&
341  (int) var->varno <= list_length(rtable));
342  rte = rt_fetch(var->varno, rtable);
343  relname = rte->eref->aliasname;
344  attname = get_rte_attribute_name(rte, var->varattno);
345  }
346  break;
347  }
348  printf("%s.%s", relname, attname);
349  }
350  else if (IsA(expr, Const))
351  {
352  const Const *c = (const Const *) expr;
353  Oid typoutput;
354  bool typIsVarlena;
355  char *outputstr;
356 
357  if (c->constisnull)
358  {
359  printf("NULL");
360  return;
361  }
362 
364  &typoutput, &typIsVarlena);
365 
366  outputstr = OidOutputFunctionCall(typoutput, c->constvalue);
367  printf("%s", outputstr);
368  pfree(outputstr);
369  }
370  else if (IsA(expr, OpExpr))
371  {
372  const OpExpr *e = (const OpExpr *) expr;
373  char *opname;
374 
375  opname = get_opname(e->opno);
376  if (list_length(e->args) > 1)
377  {
378  print_expr(get_leftop((const Expr *) e), rtable);
379  printf(" %s ", ((opname != NULL) ? opname : "(invalid operator)"));
380  print_expr(get_rightop((const Expr *) e), rtable);
381  }
382  else
383  {
384  /* we print prefix and postfix ops the same... */
385  printf("%s ", ((opname != NULL) ? opname : "(invalid operator)"));
386  print_expr(get_leftop((const Expr *) e), rtable);
387  }
388  }
389  else if (IsA(expr, FuncExpr))
390  {
391  const FuncExpr *e = (const FuncExpr *) expr;
392  char *funcname;
393  ListCell *l;
394 
395  funcname = get_func_name(e->funcid);
396  printf("%s(", ((funcname != NULL) ? funcname : "(invalid function)"));
397  foreach(l, e->args)
398  {
399  print_expr(lfirst(l), rtable);
400  if (lnext(l))
401  printf(",");
402  }
403  printf(")");
404  }
405  else
406  printf("unknown expr");
407 }
Datum constvalue
Definition: primnodes.h:174
#define IsA(nodeptr, _type_)
Definition: nodes.h:559
void getTypeOutputInfo(Oid type, Oid *typOutput, bool *typIsVarlena)
Definition: lsyscache.c:2600
List * args
Definition: primnodes.h:434
AttrNumber varattno
Definition: primnodes.h:146
unsigned int Oid
Definition: postgres_ext.h:31
Definition: primnodes.h:141
Oid consttype
Definition: primnodes.h:170
char * get_opname(Oid opno)
Definition: lsyscache.c:1087
void pfree(void *pointer)
Definition: mcxt.c:992
Oid funcid
Definition: primnodes.h:426
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:308
#define lnext(lc)
Definition: pg_list.h:105
#define rt_fetch(rangetable_index, rangetable)
Definition: parsetree.h:31
Index varno
Definition: primnodes.h:144
#define INNER_VAR
Definition: primnodes.h:131
char * get_rte_attribute_name(RangeTblEntry *rte, AttrNumber attnum)
#define NULL
Definition: c.h:226
#define Assert(condition)
Definition: c.h:671
#define lfirst(lc)
Definition: pg_list.h:106
char * aliasname
Definition: primnodes.h:41
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:2006
Oid opno
Definition: primnodes.h:473
Alias * eref
Definition: parsenodes.h:961
List * args
Definition: primnodes.h:479
#define INDEX_VAR
Definition: primnodes.h:133
#define OUTER_VAR
Definition: primnodes.h:132
bool constisnull
Definition: primnodes.h:175
void print_pathkeys ( const List pathkeys,
const List rtable 
)

Definition at line 414 of file print.c.

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

415 {
416  const ListCell *i;
417 
418  printf("(");
419  foreach(i, pathkeys)
420  {
421  PathKey *pathkey = (PathKey *) lfirst(i);
423  ListCell *k;
424  bool first = true;
425 
426  eclass = pathkey->pk_eclass;
427  /* chase up, in case pathkey is non-canonical */
428  while (eclass->ec_merged)
429  eclass = eclass->ec_merged;
430 
431  printf("(");
432  foreach(k, eclass->ec_members)
433  {
435 
436  if (first)
437  first = false;
438  else
439  printf(", ");
440  print_expr((Node *) mem->em_expr, rtable);
441  }
442  printf(")");
443  if (lnext(i))
444  printf(", ");
445  }
446  printf(")\n");
447 }
Definition: nodes.h:508
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:308
#define lnext(lc)
Definition: pg_list.h:105
#define lfirst(lc)
Definition: pg_list.h:106
EquivalenceClass * pk_eclass
Definition: relation.h:791
int i
struct EquivalenceClass * ec_merged
Definition: relation.h:726
List * ec_members
Definition: relation.h:714
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_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_VALUES:
283  printf("%d\t%s\t[values list]",
284  i, rte->eref->aliasname);
285  break;
286  case RTE_CTE:
287  printf("%d\t%s\t[cte]",
288  i, rte->eref->aliasname);
289  break;
290  default:
291  printf("%d\t%s\t[unknown rtekind]",
292  i, rte->eref->aliasname);
293  }
294 
295  printf("\t%s\t%s\n",
296  (rte->inh ? "inh" : ""),
297  (rte->inFromCl ? "inFromCl" : ""));
298  i++;
299  }
300 }
#define lfirst(lc)
Definition: pg_list.h:106
char * aliasname
Definition: primnodes.h:41
RTEKind rtekind
Definition: parsenodes.h:882
int i
Alias * eref
Definition: parsenodes.h:961
void print_slot ( TupleTableSlot slot)

Definition at line 480 of file print.c.

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

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

Definition at line 454 of file print.c.

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

455 {
456  const ListCell *tl;
457 
458  printf("(\n");
459  foreach(tl, tlist)
460  {
461  TargetEntry *tle = (TargetEntry *) lfirst(tl);
462 
463  printf("\t%d %s\t", tle->resno,
464  tle->resname ? tle->resname : "<null>");
465  if (tle->ressortgroupref != 0)
466  printf("(%u):\t", tle->ressortgroupref);
467  else
468  printf(" :\t");
469  print_expr((Node *) tle->expr, rtable);
470  printf("\n");
471  }
472  printf(")\n");
473 }
Definition: nodes.h:508
char * resname
Definition: primnodes.h:1332
AttrNumber resno
Definition: primnodes.h:1331
void print_expr(const Node *expr, const List *rtable)
Definition: print.c:308
#define lfirst(lc)
Definition: pg_list.h:106
Expr * expr
Definition: primnodes.h:1330
Index ressortgroupref
Definition: primnodes.h:1333